4.6 Article

A new kernel Fisher discriminant algorithm with application to face recognition

Journal

NEUROCOMPUTING
Volume 56, Issue -, Pages 415-421

Publisher

ELSEVIER
DOI: 10.1016/S0925-2312(03)00444-2

Keywords

Kernel-based methods; principal component analysis (PCA); Fisher linear discriminant analysis; (FLD or LDA); feature extraction; face recognition

Ask authors/readers for more resources

Kernel-based methods have been of wide concern in the field of machine learning and neurocomputing. In this paper, a new Kernel Fisher discriminant analysis (KFD) algorithm, called complete KFD (CKFD), is developed. CKFD has two advantages over the existing KFD algorithms. First, its implementation is divided into two phases, i.e., Kernel principal component analysis (KPCA) plus Fisher linear discriminant analysis (FLD), which makes it more transparent and simpler. Second, CKFD can make use of two categories of discriminant information, which makes it more powerful. The proposed algorithm was applied to face recognition and tested on a subset of the FERET database. The experimental results demonstrate that CKFD is significantly better than the algorithms of Kernel Fisherface and Kernel Eigenface. (C) 2003 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available