In this paper, a regularized kernel locality preserving discriminant analysis (RKLPDA) method is proposed for facial feature extraction and recognition. The proposed RKLPDA comes into the characteristic of LPDA that encodes both the geometrical and discriminant structure of the data manifold, and improves the classification ability for linear non-separable data by introducing kernel trick. Meanwhile, by regularizing the eigenvectors of the kernel locality preserving within-class scatter, RKLPDA utilizes all the discriminant information and eliminates the small sample size (SSS) problem. Experiments on ORL and FERET face databases are performed to test and evaluate the proposed algorithm. The results demonstrate the effectiveness of RKLPDA. © 2010 Springer-Verlag.
CITATION STYLE
Gu, X., Gong, W., Yang, L., & Li, W. (2010). Regularized kernel locality preserving discriminant analysis for face recognition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6475 LNCS, pp. 284–291). https://doi.org/10.1007/978-3-642-17691-3_26
Mendeley helps you to discover research relevant for your work.