Local Maximal Marginal Embedding with Application to Face Recognition

Many problems in information processing involve some form of dimensionality reduction. This paper develops a new approach for dimensionality reduction of high dimensional data, called local maximal marginal (interclass) embedding (LMME), to manifold learning and pattern recognition. LMME can be seen as a linear approach of a multimanifolds-based learning framework which integrates the information of neighbor and class relations. LMME characterize the local maximal marginal scatter as well as the local intraclass compactness, seeking to find a projection that maximizes the local maximal margin and minimizes the local intraclass scatter. This characteristic makes LMME more powerful than the most up-to-data method, Marginal Fisher Analysis (MFA), and maintain all the advantages of MFA. The proposed algorithm is applied to face recognition and is examined using the Yale, AR, ORL and face image databases. The experimental results show LMME consistently outperforms PCA, LDA and MFA, owing to the locally discriminating nature. This demonstrates that LMME is an effective method for face recognition.

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

[2]  Keinosuke Fukunaga,et al.  Introduction to Statistical Pattern Recognition , 1972 .

[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]  Jieping Ye,et al.  An optimization criterion for generalized discriminant analysis on undersampled problems , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[6]  Anil K. Jain,et al.  Statistical Pattern Recognition: A Review , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  I. Jolliffe Principal Component Analysis , 2002 .

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

[9]  Aziz Umit Batur,et al.  Linear subspaces for illumination robust face recognition , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

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

[11]  Avinash C. Kak,et al.  PCA versus LDA , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  Jian Yang,et al.  Globally Maximizing, Locally Minimizing: Unsupervised Discriminant Projection with Applications to Face and Palm Biometrics , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[13]  Alex Pentland,et al.  Face recognition using eigenfaces , 1991, Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[14]  Honggang Zhang,et al.  Comments on "Globally Maximizing, Locally Minimizing: Unsupervised Discriminant Projection with Application to Face and Palm Biometrics" , 2007, IEEE Trans. Pattern Anal. Mach. Intell..