Regularized kernel discriminant analysis with a robust kernel for face recognition and verification

61Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose a robust approach to discriminant kernel-based feature extraction for face recognition and verification. We show, for the first time, how to perform the eigen analysis of the within-class scatter matrix directly in the feature space. This eigen analysis provides the eigenspectrum of its range space and the corresponding eigenvectors as well as the eigenvectors spanning its null space. Based on our analysis, we propose a kernel discriminant analysis (KDA) which combines eigenspectrum regularization with a feature-level scheme (ER-KDA). Finally, we combine the proposed ER-KDA with a nonlinear robust kernel particularly suitable for face recognition/verification applications which require robustness against outliers caused by occlusions and illumination changes. We applied the proposed framework to several popular databases (Yale, AR, XM2VTS) and achieved state-of-the-art performance for most of our experiments. © 2012 IEEE.

Cite

CITATION STYLE

APA

Zafeiriou, S., Tzimiropoulos, G., Petrou, M., & Stathaki, T. (2012). Regularized kernel discriminant analysis with a robust kernel for face recognition and verification. IEEE Transactions on Neural Networks and Learning Systems, 23(3), 526–534. https://doi.org/10.1109/TNNLS.2011.2182058

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free