Kernel mutual subspace method for robust facial image recognition

A multiple observation-based scheme (MObS) is described for robust facial recognition, and a novel object recognition method called kernel mutual subspace method (KMS) is proposed. The mutual sub-space method (MSM) proposed by (Maeda, et al., 1999) is a powerful method for recognizing facial images. However, its recognition accuracy is degraded when the data distribution has a nonlinear structure. To overcome this shortcoming we apply kernel principal component analysis (kPCP) to MSM. This paper describes theoretical aspects of the proposed method and presents the results of facial image recognition experiments.

[1]  E. Oja.  Simplified neuron model as a principal component analyzer , 1982, Journal of mathematical biology.

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

[3]  S. Katagiri,et al.  Discriminative Subspace Method for Minimum Error Pattern Recognition , 1995, Proceedings of 1995 IEEE Workshop on Neural Networks for Signal Processing.

[4]  Ken-ichi Maeda,et al.  Face recognition using temporal image sequence , 1998, Proceedings Third IEEE International Conference on Automatic Face and Gesture Recognition.

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

[6]  Koji Tsuda.  Subspace classifier in the Hilbert space , 1999, Pattern Recognit. Lett..

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

[8]  D. B. Gerham.  Characterizing virtual eigensignatures for general purpose face recognition , 1998 .