Zhao Feng, Zhang Jun-ying, Liang Jun-li. A Fast Algorithm about Kernel Fisher Discriminant Analysis[J]. Journal of Electronics & Information Technology, 2007, 29(7): 1731-1734. doi: 10.3724/SP.J.1146.2006.00974
Citation:
Zhao Feng, Zhang Jun-ying, Liang Jun-li. A Fast Algorithm about Kernel Fisher Discriminant Analysis[J]. Journal of Electronics & Information Technology, 2007, 29(7): 1731-1734. doi: 10.3724/SP.J.1146.2006.00974
Zhao Feng, Zhang Jun-ying, Liang Jun-li. A Fast Algorithm about Kernel Fisher Discriminant Analysis[J]. Journal of Electronics & Information Technology, 2007, 29(7): 1731-1734. doi: 10.3724/SP.J.1146.2006.00974
Citation:
Zhao Feng, Zhang Jun-ying, Liang Jun-li. A Fast Algorithm about Kernel Fisher Discriminant Analysis[J]. Journal of Electronics & Information Technology, 2007, 29(7): 1731-1734. doi: 10.3724/SP.J.1146.2006.00974
The standard Kernel Fisher Discriminant Analysis(KFDA) may suffer from the large computation complexity and the slow speed of feature extraction for the case of large number of training samples. To tackle these problems, a fast algorithm of KFDA is presented. The algorithm firstly proposes an optimized algorithm based on the theory of linear correlation, which finds out a basis of the sub-space spanned by the training samples mapped onto the feature space and which avoids the operation of matrix inversion ; Then using the linear combination of the basis to express the optimal projection vectors，and combining with Fisher criterion in the feature space, a novel criterion for the computation of the optimal projection vectors is presented, which only needs to calculate the eigenvalue of a matrix which size is the same as the number of the basis. In addition, the feature extraction for one sample only needs to calculate the kernel functions between the basis and the sample. The experimental results using different datasets demonstrate the validity of the presented algorithm.
Mika S, Ratsch G, and Jason G. Fisher discriminant analysis with kernels. Proc. of Neural Networks Signal Processing IEEE, Madison, WI, USA, 1999: 41-48.[2]Baudat G and Anouar F. Generalized discriminant analysis using a kernel approach[J].Neural Computation.2000, 12(10):2385-2404[3]Tristrom C. Two variations on fisher s linear discriminant for patter recognition[J].IEEE Trans. on Pattern Analysis and Machine Intelligence.2002, 24(2):268-273[4]Yang J, Frangi A F, and Yang J Y. A new kernel fisher discriminant algorithm with application to face recognition. Neural Computation, 2004, 56(4): 415-421.[5]Liang Z Z H and Shi P F. An efficient and effective method to solve kernel fisher discriminant analysis. Neural Computation, 2004, 61(1): 485-493.[6]Liu Q H and Lu H Q. Improving kernel Fisher discriminant analysis for face recognition[J].IEEE Trans. on Circuits and Systems for Video Technology.2004, 14(1):42-49[7]Baudat G and Anouar F. Kernel-based methods and function approximation. Proceedings of the International Joint Conference on Neural Networks, Washington, DC, 2001: 1244-1249.[8]Bian Z H Q and Zhang X G. Matrix Theory. 2nd edition, Xian: Northwestern ploytechnical university Press, 2004: 262-288.
DownLoad: