Verification of human faces using predicted eigenvalues

To alleviate the conventional problems of LDA and its variants, we propose a procedure of predicting eigenvalues using few reliable eigenvalues from the range space. Partitioning of entire eigenspace is performed using two control points, however, the effective low dimensional discriminative vectors are extracted from the whole eigenspace. This prediction strategy enables to perform discriminant evaluation in the full eigenspace. The proposed method is evaluated and compared with 8 popular subspace based methods for face verification task. Experimental results on popular face databases show that our method consistently outperforms others.

[1]  Xudong Jiang,et al.  Eigenfeature Regularization and Extraction in Face Recognition , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Alex Pentland,et al.  Bayesian face recognition , 2000, Pattern Recognit..

[3]  Dao-Qing Dai,et al.  Improved discriminate analysis for high-dimensional data and its application to face recognition , 2007, Pattern Recognit..

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

[5]  Xiaogang Wang,et al.  A unified framework for subspace face recognition , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Xiaogang Wang,et al.  Dual-space linear discriminant analysis for face recognition , 2004, Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004..

[7]  Bruce A. Draper,et al.  The CSU Face Identification Evaluation System , 2005, Machine Vision and Applications.

[8]  Tieniu Tan,et al.  Null Space Approach of Fisher Discriminant Analysis for Face Recognition , 2004, ECCV Workshop BioAW.

[9]  Xudong Jiang,et al.  Complete discriminant evaluation and feature extraction in kernel space for face recognition , 2008, Machine Vision and Applications.