Selecting Kernel Eigenfaces for Face Recognition with One Training Sample Per Subject

It is well-known that supervised learning techniques such as linear discriminant analysis (LDA) often suffer from the so called small sample size problem when apply to solve face recognition problems. This is due to the fact that in most cases, the number of training samples is much smaller than the dimensionality of the sample space. The problem becomes even more severe if only one training sample is available for each subject. In this paper, followed by the wellknown unsupervised technique, kernel principal component analysis(KPCA), a novel feature selection scheme is proposed to establish a discriminant feature subspace in which the class separability is maximized. Extensive experiments performed on the FERET database indicate that the proposed scheme significantly boosts the recognition performance of the traditional KPCA solution.

• Type: Conference
• Year: 2006
• Where: ICMCS
• Authors: Jie Wang, Konstantinos N. Plataniotis, Anastasios N. Venetsanopoulos
• Keywords: ICMCS 2006, Linear Discriminant Analysis, Sample Size Problem, Training Sample