Journal
NEUROCOMPUTING
Volume 74, Issue 17, Pages 3313-3322Publisher
ELSEVIER
DOI: 10.1016/j.neucom.2011.05.014
Keywords
Pattern classification; Nonlinear feature extraction; Fisher discriminant analysis; Kernel Fisher discriminant analysis; Fast kernel Fisher discriminant analysis
Categories
Funding
- Hong Kong Government [5341/08E, 5366/09E]
- Hong Kong Polytechnic University [1-ZV5U]
- Henan Provincial Advanced Research Funding [092300410154]
Ask authors/readers for more resources
Kernel Fisher discriminant analysis (KFDA) extracts a nonlinear feature from a sample by calculating as many kernel functions as the training samples. Thus, its computational efficiency is inversely proportional to the size of the training sample set. In this paper we propose a more approach to efficient nonlinear feature extraction, FKFDA (fast KFDA). This FKFDA consists of two parts. First, we select a portion of training samples based on two criteria produced by approximating the kernel principal component analysis (AKPCA) in the kernel feature space. Then, referring to the selected training samples as nodes, we formulate FKFDA to improve the efficiency of nonlinear feature extraction. In FKFDA, the discriminant vectors are expressed as linear combinations of nodes in the kernel feature space, and the extraction of a feature from a sample only requires calculating as many kernel functions as the nodes. Therefore, the proposed FKFDA has a much faster feature extraction procedure compared with the naive kernel-based methods. Experimental results on face recognition and benchmark datasets classification suggest that the proposed FKFDA can generate well classified features. (C) 2011 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
Recommended
No Data Available