.png){kind=icon}
.png){kind=icon}
Return
A note on two-dimensional linear discriminant analysis
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2008.07.009.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
2DLDA and its variants have attracted Much attention from researchers recently due to the advantages over the singularity problem and the computational cost. In this paper, we further analyze the 2DLDA method and derive the upper bound of its criterion. Based on this Upper bound, we show that the discriminant power of two-dimensional discriminant analysis is not stronger than that of LDA under the assumption that the same dimensionality is considered. In experimental parts. on one hand, we confirm the validity Of Our claim and show the matrix-based methods are not always better than vector-based methods in the small sample size problem: oil the other hand, we compare several distance measures when the feature matrices and feature Vectors are applied. The matlab codes used in this paper are available at http://www.mathworks.com/matlabcentral/fileexchange/loadCategory.do?objectType=category& objectld=127&objectName=Application. (C) 2008 Elsevier B.V. All rights reserved.
Keywords:
Feature extraction
Linear discriminant analysis
2DLDA
Discriminant power
Distance measure
Journal
IF:
3.3
Papers:
7.8K
Citations:
1.6W