Non-iterative two-dimensional linear discriminant analysis

Kohei Inoue, Kiichi Urahama

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Citations (Scopus)

Abstract

Linear discriminant analysis (LDA) is a well-known scheme for feature extraction and dimensionality reduction of labeled data in a vector space. Recently, LDA has been extended to two-dimensional LDA (2DLDA), which is an iterative algorithm for data in matrix representation. In this paper, we propose non-iterative algorithms for 2DLDA. Experimental results show that the non-iterative algorithms achieve competitive recognition rates with the iterative 2DLDA, while they are computationally more efficient than the iterative 2DLDA.

Original languageEnglish
Title of host publicationProceedings - 18th International Conference on Pattern Recognition, ICPR 2006
Pages540-543
Number of pages4
Volume2
DOIs
Publication statusPublished - 2006
Event18th International Conference on Pattern Recognition, ICPR 2006 - Hong Kong, China
Duration: Aug 20 2006Aug 24 2006

Other

Other18th International Conference on Pattern Recognition, ICPR 2006
CountryChina
CityHong Kong
Period8/20/068/24/06

Fingerprint

Discriminant analysis
Vector spaces
Feature extraction

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering
  • Computer Vision and Pattern Recognition
  • Hardware and Architecture

Cite this

Inoue, K., & Urahama, K. (2006). Non-iterative two-dimensional linear discriminant analysis. In Proceedings - 18th International Conference on Pattern Recognition, ICPR 2006 (Vol. 2, pp. 540-543). [1699262] https://doi.org/10.1109/ICPR.2006.860

Non-iterative two-dimensional linear discriminant analysis. / Inoue, Kohei; Urahama, Kiichi.

Proceedings - 18th International Conference on Pattern Recognition, ICPR 2006. Vol. 2 2006. p. 540-543 1699262.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Inoue, K & Urahama, K 2006, Non-iterative two-dimensional linear discriminant analysis. in Proceedings - 18th International Conference on Pattern Recognition, ICPR 2006. vol. 2, 1699262, pp. 540-543, 18th International Conference on Pattern Recognition, ICPR 2006, Hong Kong, China, 8/20/06. https://doi.org/10.1109/ICPR.2006.860
Inoue K, Urahama K. Non-iterative two-dimensional linear discriminant analysis. In Proceedings - 18th International Conference on Pattern Recognition, ICPR 2006. Vol. 2. 2006. p. 540-543. 1699262 https://doi.org/10.1109/ICPR.2006.860
Inoue, Kohei ; Urahama, Kiichi. / Non-iterative two-dimensional linear discriminant analysis. Proceedings - 18th International Conference on Pattern Recognition, ICPR 2006. Vol. 2 2006. pp. 540-543
@inproceedings{bf88260936d14048a3d6bc78fc588842,
title = "Non-iterative two-dimensional linear discriminant analysis",
abstract = "Linear discriminant analysis (LDA) is a well-known scheme for feature extraction and dimensionality reduction of labeled data in a vector space. Recently, LDA has been extended to two-dimensional LDA (2DLDA), which is an iterative algorithm for data in matrix representation. In this paper, we propose non-iterative algorithms for 2DLDA. Experimental results show that the non-iterative algorithms achieve competitive recognition rates with the iterative 2DLDA, while they are computationally more efficient than the iterative 2DLDA.",
author = "Kohei Inoue and Kiichi Urahama",
year = "2006",
doi = "10.1109/ICPR.2006.860",
language = "English",
isbn = "0769525210",
volume = "2",
pages = "540--543",
booktitle = "Proceedings - 18th International Conference on Pattern Recognition, ICPR 2006",

}

TY - GEN

T1 - Non-iterative two-dimensional linear discriminant analysis

AU - Inoue, Kohei

AU - Urahama, Kiichi

PY - 2006

Y1 - 2006

N2 - Linear discriminant analysis (LDA) is a well-known scheme for feature extraction and dimensionality reduction of labeled data in a vector space. Recently, LDA has been extended to two-dimensional LDA (2DLDA), which is an iterative algorithm for data in matrix representation. In this paper, we propose non-iterative algorithms for 2DLDA. Experimental results show that the non-iterative algorithms achieve competitive recognition rates with the iterative 2DLDA, while they are computationally more efficient than the iterative 2DLDA.

AB - Linear discriminant analysis (LDA) is a well-known scheme for feature extraction and dimensionality reduction of labeled data in a vector space. Recently, LDA has been extended to two-dimensional LDA (2DLDA), which is an iterative algorithm for data in matrix representation. In this paper, we propose non-iterative algorithms for 2DLDA. Experimental results show that the non-iterative algorithms achieve competitive recognition rates with the iterative 2DLDA, while they are computationally more efficient than the iterative 2DLDA.

UR - http://www.scopus.com/inward/record.url?scp=34047221157&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34047221157&partnerID=8YFLogxK

U2 - 10.1109/ICPR.2006.860

DO - 10.1109/ICPR.2006.860

M3 - Conference contribution

AN - SCOPUS:34047221157

SN - 0769525210

SN - 9780769525211

VL - 2

SP - 540

EP - 543

BT - Proceedings - 18th International Conference on Pattern Recognition, ICPR 2006

ER -