Kernel-based nonlinear discriminant analysis for face recognition

Linear subspace analysis methods have been successfully applied to extract features for face recognition. But they are inadequate to represent the complex and nonlinear variations of real face images, such as illumination, facial expression and pose variations, because of their linear properties. In...

Full description

Saved in:
Bibliographic Details
Published in:Journal of computer science and technology 2003-11, Vol.18 (6), p.788-795
Main Authors: Liu, QingShan, Huang, Rui, Lu, HanQing, Ma, SongDe
Format: Article
Language:English
Subjects:
Complexity
Discriminant analysis
Face recognition
Feature recognition
Kernels
Mathematical analysis
Nonlinearity
Polynomials
Principal component analysis
Principal components analysis
Studies
Subspaces
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Linear subspace analysis methods have been successfully applied to extract features for face recognition. But they are inadequate to represent the complex and nonlinear variations of real face images, such as illumination, facial expression and pose variations, because of their linear properties. In this paper, a nonlinear subspace analysis method, Kernel-based Nonlinear Discriminant Analysis (KNDA), is presented for face recognition, which combines the nonlinear kernel trick with the linear subspace analysis method — Fisher Linear Discriminant Analysis (FLDA). First, the kernel trick is used to project the input data into an implicit feature space, then FLDA is performed in this feature space. Thus nonlinear discriminant features of the input data are yielded. In addition, in order to reduce the computational complexity, a geometry-based feature vectors selection scheme is adopted. Another similar nonlinear subspace analysis is Kernel-based Principal Component Analysis (KPCA), which combines the kernel trick with linear Principal Component Analysis (PCA). Experiments are performed with the polynomial kernel, and KNDA is compared with KPCA and FLDA. Extensive experimental results show that KNDA can give a higher recognition rate than KPCA and FLDA.
ISSN:1000-9000
1860-4749
DOI:10.1007/BF02945468