Mandal, B, Jiang, X-D and Kot, A (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,. CSREA Press, pp. 235-241. ISBN 1601320434

[img]
Preview
Text
IPC3662.pdf - Accepted Version

Download (148kB) | Preview

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.

Item Type: Book Section
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Natural Sciences > School of Computing and Maths
Depositing User: Symplectic
Date Deposited: 10 May 2018 08:42
Last Modified: 10 May 2018 08:43
URI: http://eprints.keele.ac.uk/id/eprint/4860

Actions (login required)

View Item View Item