Please use this identifier to cite or link to this item:

Face recognition using a kernel fractional-step discriminant analysis algorithm

Authors Dai, Guang
Yeung, Dit-Yan
Qian, Yun-Tao
Issue Date 2007
Source Pattern recognition , v. 40, (1), 2007, January, p. 229-243
Summary Feature extraction is among the most important problems in face recognition systems. In this paper, we propose an enhanced kernel discriminant analysis (KDA) algorithm called kernel fractional-step discriminant analysis (KFDA) for nonlinear feature extraction and dimensionality reduction. Not only can this new algorithm, like other kernel methods, deal with nonlinearity required for many face recognition tasks, it can also outperform traditional KDA algorithms in resisting the adverse effects due to outlier classes. Moreover, to further strengthen the overall performance of KDA algorithms for face recognition, we propose two new kernel functions: cosine fractional-power polynomial kernel and non-normal Gaussian RBF kernel. We perform extensive comparative studies based on the YaleB and FERET face databases. Experimental results show that our KFDA algorithm outperforms traditional kernel principal component analysis (KPCA) and KDA algorithms. Moreover, further improvement can be obtained when the two new kernel functions are used. (c) 2006 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
ISSN 0031-3203
Rights Pattern Recognition © copyright (2006) Elsevier. The Journal's web site is located at
Language English
Format Article
Access View full-text via DOI
View full-text via Web of Science
View full-text via Scopus
Files in this item:
File Description Size Format
yeung.pr2007a1.pdf 722396 B Adobe PDF