DocumentCode
2459624
Title
Direct Orthogonal Discriminant Analysis
Author
Lin, Yu´e ; Gu, Guochang ; Liu, Haibo ; Shen, Jing
Author_Institution
Sch. of Comput. Sci. & Technol., Harbin Eng. Univ., Harbin
fYear
2008
fDate
18-20 Oct. 2008
Firstpage
176
Lastpage
179
Abstract
Orthogonal discriminant analysis algorithms have recently been proposed. However, these methods donpsilat address the singularity problem in the high dimensional feature space. In this paper, we present a new method called direct orthogonal discriminant analysis (DODA), which is able to extract all the orthogonal discriminant vectors simultaneously in the high-dimensional feature space and does not suffer the singularity problem. This method is very simple and easy to be implemented. Experimental results show that the proposed method is very competitive in comparison with some existing dimensionality reduction algorithms.
Keywords
pattern recognition; dimensionality reduction; direct orthogonal discriminant analysis; high-dimensional feature space; orthogonal discriminant vector; pattern recognition; Algorithm design and analysis; Computer science; Databases; Face recognition; Linear discriminant analysis; Pattern recognition; Principal component analysis; Scattering; Space technology; Vectors; Direct Orthogonal Discriminant Analysis; orthogonal discriminant analysis; singularity problem;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer and Computational Sciences, 2008. IMSCCS '08. International Multisymposiums on
Conference_Location
Shanghai
Print_ISBN
978-0-7695-3430-5
Type
conf
DOI
10.1109/IMSCCS.2008.25
Filename
4760319
Link To Document