Embedded Manifold-Based Kernel Fisher Discriminant Analysis for Face Recognition

Manifold learning algorithms mainly focus on discovering the intrinsic low-dimensional manifold embedded in the high-dimensional Euclidean space. Among them, locally linear embedding (LLE) is one of the most promising dimensionality reduction methods. Though LLE holds local neighborhood information, it doesn’t fully take the label information and the global structure information into account for classification tasks. To enhance classification performance, this paper proposes a novel dimensionality reduction method for face recognition, termed embedded manifold-based kernel Fisher discriminant analysis, or EMKFDA for short. The goal of EMKFDA is to emphasize the local geometry structure of the data while utilizing the global discriminative structure obtained from linear discriminant analysis, which can maximize the between-class scatter and minimize the within-class scatter. In addition, by optimizing an objective function in a kernel feature space, nonlinear features can be extracted. Thus, EMKFDA, which combines manifold criterion and Fisher criterion, has better discrimination, and is more suitable for recognition tasks. Experiments on the ORL, Yale, and FERET face databases show the impressive performance of the proposed method. Results show that this proposed algorithm exceeds other popular approaches reported in the literature and achieves much higher recognition accuracy.

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

[2]  Xuelong Li,et al.  A unifying framework for spectral analysis based dimensionality reduction , 2008, 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence).

[3]  Xuelong Li,et al.  Local Coordinates Alignment (LCA): a Novel Manifold Learning Approach , 2008, Int. J. Pattern Recognit. Artif. Intell..

[4]  Stan Z. Li,et al.  Manifold Learning and Applications in Recognition , 2005 .

[5]  张振跃,et al.  Principal Manifolds and Nonlinear Dimensionality Reduction via Tangent Space Alignment , 2004 .

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

[7]  De-Shuang Huang,et al.  Locally linear discriminant embedding: An efficient method for face recognition , 2008, Pattern Recognit..

[8]  Kun Zhou,et al.  Locality Sensitive Discriminant Analysis , 2007, IJCAI.

[9]  Weiguo Gong,et al.  Uncorrelated linear discriminant analysis based on weighted pairwise Fisher criterion , 2007, Pattern Recognit..

[10]  Nenghai Yu,et al.  Face Recognition Using Neighborhood Preserving Projections , 2005, PCM.

[11]  Francis E. Grousset,et al.  Eurasian Air Pollution Reaches Eastern North America , 2000, Science.

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

[13]  David J. Kriegman,et al.  The yale face database , 1997 .

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

[15]  Azriel Rosenfeld,et al.  Face recognition: A literature survey , 2003, CSUR.

[16]  Lawrence K. Saul,et al.  Think Globally, Fit Locally: Unsupervised Learning of Low Dimensional Manifold , 2003, J. Mach. Learn. Res..

[17]  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).

[18]  H. Sebastian Seung,et al.  The Manifold Ways of Perception , 2000, Science.

[19]  Wenming Zheng,et al.  An efficient algorithm to solve the small sample size problem for LDA , 2004, Pattern Recognit..

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

[21]  Vladimir Naumovich Vapni The Nature of Statistical Learning Theory , 1995 .

[22]  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).

[23]  Bernhard Schölkopf,et al.  Nonlinear Component Analysis as a Kernel Eigenvalue Problem , 1998, Neural Computation.

[24]  Kilian Q. Weinberger,et al.  Unsupervised Learning of Image Manifolds by Semidefinite Programming , 2004, Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004..

[25]  H. Zha,et al.  Principal manifolds and nonlinear dimensionality reduction via tangent space alignment , 2004, SIAM J. Sci. Comput..

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

[27]  G. Baudat,et al.  Generalized Discriminant Analysis Using a Kernel Approach , 2000, Neural Computation.

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

[29]  Daoqiang Zhang,et al.  Efficient and robust feature extraction by maximum margin criterion , 2003, IEEE Transactions on Neural Networks.

[30]  Feiping Nie,et al.  Nonlinear Dimensionality Reduction with Local Spline Embedding , 2009, IEEE Transactions on Knowledge and Data Engineering.

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

[32]  Jianlin Wang,et al.  Solving the small sample size problem in face recognition using generalized discriminant analysis , 2006, Pattern Recognit..

[33]  Mikhail Belkin,et al.  Laplacian Eigenmaps for Dimensionality Reduction and Data Representation , 2003, Neural Computation.