Kernel Fisher Discriminant Analysis in Full Eigenspace

Mandal

Abstract

This work proposes a method which enables us to perform kernel Fisher discriminant analysis in the whole
eigenspace for face recognition. It employs the ratio of eigenvalues to decompose the entire kernel feature space into two subspaces: a reliable subspace spanned mainly by the facial variation and an unreliable subspace due to finite number of training samples. Eigenvectors are then scaled using a suitable weighting function. This weighting function circumvents undue scaling of projection vectors corresponding to the undependable small and zero eigenvalues. Eigenfeatures are only extracted after the discriminant evaluation in the whole kernel feature space. These efforts facilitate a discriminative and stable low-dimensional feature representation of the face image. Experimental results comparing other popular kernel subspace methods on FERET, ORL and GT databases show that our approach consistently outperforms others.

Citation

Mandal. (2008). Kernel Fisher Discriminant Analysis in Full Eigenspace. In Proceedings of the 2007 International Conference on Image Processing, Computer Vision, & Pattern Recognition, IPCV 2007, June 25-28, 2007, Las Vegas Nevada, (235-241)

• Acceptance Date: Jun 25, 2007
• Publication Date: Jan 4, 2008
• Pages: 235-241
• Series Title: International Conference on Image Processing, Computer Vision, and Pattern Recognition (IPCV 2007)
• Book Title: Proceedings of the 2007 International Conference on Image Processing, Computer Vision, & Pattern Recognition, IPCV 2007, June 25-28, 2007, Las Vegas Nevada,
• ISBN: 1601320434