Automated face recognition using adaptive subspace method

Automated face recognition is reemerging as an active research area because of its various commercial and law enforcement applications. In this paper, we propose a novel approach called the adaptive subspace method motivated by the traditional eigenfaces approach. Our scheme begins with the standardization of face images in order to achieve some invariance of face representation under different image acquisition conditions. Then we combine the K-L expansion technique with genetic algorithms to construct an optimal feature subspace for identification. Finally, any input face image can be projected into this adaptive subspace to be identified using a minimum distance classifier. Experimental results are also given in detail and show our approach offers superior performance.

[1]  ERKKI OJA,et al.  The ALSM algorithm - an improved subspace method of classification , 1983, Pattern Recognit..

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

[3]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[4]  Zi-Quan Hong,et al.  Algebraic feature extraction of image for recognition , 1991, Pattern Recognit..

[5]  A. Krzyzak,et al.  Neural-net method for dual subspace pattern recognition , 1991, IJCNN-91-Seattle International Joint Conference on Neural Networks.

[6]  Rama Chellappa,et al.  Human and machine recognition of faces: a survey , 1995, Proc. IEEE.

[7]  L. D. Harmon,et al.  Identification of human faces , 1971 .

[8]  Alice J. O'Toole,et al.  Connectionist models of face processing: A survey , 1994, Pattern Recognit..

[9]  L Sirovich,et al.  Low-dimensional procedure for the characterization of human faces. , 1987, Journal of the Optical Society of America. A, Optics and image science.

[10]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .