An efficient regularized neighborhood discriminant analysis through QR decomposition

Inspired by the concept of manifold learning, the discriminant embedding technologies aim to exploit low dimensional discriminant manifold structure in the high dimensional space for dimension reduction and classification. However, such graph embedding framework based techniques usually suffer from the large complexity and small sample size (SSS) problem. To address the problem, we reformulate the Laplacian matrix and propose a regularized neighborhood discriminant analysis method, namely RNDA, to discover the local discriminant information, which follows similar approach to regularized LDA. Compared with other discriminant embedding techniques, RNDA achieves efficiency by employing the QR decomposition as a pre-step. Experiments on face databases are presented to show the outstanding performance of the proposed method.

[1]  Konstantinos N. Plataniotis,et al.  Regularized discriminant analysis for the small sample size problem in face recognition , 2003, Pattern Recognit. Lett..

[2]  Bernhard Schölkopf,et al.  A kernel view of the dimensionality reduction of manifolds , 2004, ICML.

[3]  Xiaofei He,et al.  Locality Preserving Projections , 2003, NIPS.

[4]  S T Roweis,et al.  Nonlinear dimensionality reduction by locally linear embedding. , 2000, Science.

[5]  Peng Zhang,et al.  Nonlinear Dimensionality Reduction by Locally Linear Inlaying , 2009, IEEE Transactions on Neural Networks.

[6]  Mikhail Belkin,et al.  Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering , 2001, NIPS.

[7]  Gene H. Golub,et al.  Matrix computations , 1983 .

[8]  Jian Huang,et al.  A new regularized linear discriminant analysis method to solve small sample size problems , 2005, Int. J. Pattern Recognit. Artif. Intell..

[9]  J. Tenenbaum,et al.  A global geometric framework for nonlinear dimensionality reduction. , 2000, Science.

[10]  Hua Yu,et al.  A direct LDA algorithm for high-dimensional data - with application to face recognition , 2001, Pattern Recognit..

[11]  Shuicheng Yan,et al.  Neighborhood preserving embedding , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[12]  Shuicheng Yan,et al.  Graph embedding: a general framework for dimensionality reduction , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[13]  M. Turk,et al.  Eigenfaces for Recognition , 1991, Journal of Cognitive Neuroscience.

[14]  Xiangyang Xue,et al.  Discriminant neighborhood embedding for classification , 2006, Pattern Recognit..

[15]  Jieping Ye,et al.  A two-stage linear discriminant analysis via QR-decomposition , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  David G. Stork,et al.  Pattern Classification , 1973 .

[17]  Yuxiao Hu,et al.  Face recognition using Laplacianfaces , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[18]  David J. Kriegman,et al.  Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection , 1996, ECCV.

[19]  David G. Stork,et al.  Pattern classification, 2nd Edition , 2000 .

[20]  Ja-Chen Lin,et al.  A new LDA-based face recognition system which can solve the small sample size problem , 1998, Pattern Recognit..

[21]  Hwann-Tzong Chen,et al.  Local discriminant embedding and its variants , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).