KPCA Plus LDA: A Complete Kernel Fisher Discriminant Framework for Feature Extraction and Recognition
Issue No. 02 - February (2005 vol. 27)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPAMI.2005.33
David Zhang , IEEE
This paper examines the theory of kernel Fisher discriminant analysis (KFD) in a Hilbert space and develops a two-phase KFD framework, i.e., kernel principal component analysis (KPCA) plus Fisher linear discriminant analysis (LDA). This framework provides novel insights into the nature of KFD. Based on this framework, the authors propose a complete kernel Fisher discriminant analysis (CKFD) algorithm. CKFD can be used to carry out discriminant analysis in "double discriminant subspaces.” The fact that, it can make full use of two kinds of discriminant information, regular and irregular, makes CKFD a more powerful discriminator. The proposed algorithm was tested and evaluated using the FERET face database and the CENPARMI handwritten numeral database. The experimental results show that CKFD outperforms other KFD algorithms.
Kernel-based methods, subspace methods, principal component analysis (PCA), Fisher linear discriminant analysis (LDA or FLD), feature extraction, machine learning, face recognition, handwritten digit recognition.
D. Zhang, J. Yang, A. F. Frangi, J. Yang and Z. Jin, "KPCA Plus LDA: A Complete Kernel Fisher Discriminant Framework for Feature Extraction and Recognition," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 27, no. , pp. 230-244, 2005.