Orthogonal Locality Sensitive Discriminant Analysis for Face Recognition

An innovative appearance-based method that called Orthogonal Locality Sensitive Discriminant Analysis is presented for face recognition in this paper. Our algorithm is based on the Locality Sensitive Discriminant Analysis (LSDA) algorithm, which aims at finding a projection by maximizing the margin between data points from different classes at each local area. However, a major disadvantage of LSDA is that LSDA is non- or- thogonal, and this makes it difficult to estimate the intrinsic dimensionality and to recon- struct the face data. Non-orthogonality distorts the local geometrical structure of the data submanifold. In this paper, an Orthogonal LSDA algorithm is proposed to preserve the local geometrical structure by computing the mutually orthogonal basis functions itera- tively. Since it produces orthogonal basis functions and can have more local structure preserving power, it is expected to have more discriminating power than LSDA. Experi- ments based on the ORL and Yale face database show the impressive performance of the proposed method. Results show that our new algorithm outperforms the other popular approaches reported in the literature and achieves a much higher recognition rate.

[1]  Gregory Shakhnarovich,et al.  Face Recognition in Subspaces , 2011, Handbook of Face Recognition.

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

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

[4]  Deng Cai,et al.  Orthogonal locality preserving indexing , 2005, SIGIR '05.

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

[6]  Xiaolong Teng,et al.  Face recognition using discriminant locality preserving projections , 2006, Image Vis. Comput..

[7]  Yuxiao Hu,et al.  Learning a locality preserving subspace for visual recognition , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

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

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

[10]  Yousef Saad,et al.  Orthogonal Neighborhood Preserving Projections: A Projection-Based Dimensionality Reduction Technique , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

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

[13]  Nicolas Le Roux,et al.  Out-of-Sample Extensions for LLE, Isomap, MDS, Eigenmaps, and Spectral Clustering , 2003, NIPS.

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

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

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

[17]  Marian Stewart Bartlett,et al.  Independent component representations for face recognition , 1998, Electronic Imaging.

[18]  Jiawei Han,et al.  Orthogonal Laplacianfaces for Face Recognition , 2006, IEEE Transactions on Image Processing.

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