Efficient kernel discriminative common vectors for classification

Verfasser / Beitragende:
[Jianwei Zheng, Qiongfang Huang, Shengyong Chen, Wanliang Wang]
Ort, Verlag, Jahr:
2015
Enthalten in:
The Visual Computer, 31/5(2015-05-01), 643-655
Format:
Artikel (online)
ID: 60554123X
LEADER caa a22 4500
001 60554123X
003 CHVBK
005 20210128100915.0
007 cr unu---uuuuu
008 210128e20150501xx s 000 0 eng
024 7 0 |a 10.1007/s00371-014-0991-9  |2 doi 
035 |a (NATIONALLICENCE)springer-10.1007/s00371-014-0991-9 
245 0 0 |a Efficient kernel discriminative common vectors for classification  |h [Elektronische Daten]  |c [Jianwei Zheng, Qiongfang Huang, Shengyong Chen, Wanliang Wang] 
520 3 |a Kernel discriminant analysis (KDA) which operates in the reproducing kernel Hilbert space (RKHS) is a very popular approach to dimensionality reduction. Kernel discriminative common vectors (KDCV) shares the same modified Fisher linear discriminant criterion with KDA and guarantees a 100% recognition rate for the training set samples as well as favorable generalization performance. However, KDCV has the disadvantage of high computational complexity in both the training and the testing stage. This paper attempts to improve the computation efficiency of KDCV by two strategies. First, the Cholesky decomposition is introduced to obtain the projection matrix instead of eigen-decomposition. Second, we replace the matrix operation with vector operation in the testing process which reduces the computational complexity. Extensive experiments on COIL images dataset, ORL faces dataset, PIE faces dataset, and USPS handwritten digits dataset demonstrate that the proposed algorithm is more efficient than the traditional KDCV algorithm without loss of accuracy. 
540 |a Springer-Verlag Berlin Heidelberg, 2014 
690 7 |a Feature extraction  |2 nationallicence 
690 7 |a Kernel discriminative common vector  |2 nationallicence 
690 7 |a Cholesky decomposition  |2 nationallicence 
690 7 |a Kernel trick  |2 nationallicence 
700 1 |a Zheng  |D Jianwei  |u College of Computer Science and Technology, Zhejiang University of Technology, 288 Liuhe Road, 310023, Hangzhou, China  |4 aut 
700 1 |a Huang  |D Qiongfang  |u College of Computer Science and Technology, Zhejiang University of Technology, 288 Liuhe Road, 310023, Hangzhou, China  |4 aut 
700 1 |a Chen  |D Shengyong  |u College of Computer Science and Technology, Zhejiang University of Technology, 288 Liuhe Road, 310023, Hangzhou, China  |4 aut 
700 1 |a Wang  |D Wanliang  |u College of Computer Science and Technology, Zhejiang University of Technology, 288 Liuhe Road, 310023, Hangzhou, China  |4 aut 
773 0 |t The Visual Computer  |d Springer Berlin Heidelberg  |g 31/5(2015-05-01), 643-655  |x 0178-2789  |q 31:5<643  |1 2015  |2 31  |o 371 
856 4 0 |u https://doi.org/10.1007/s00371-014-0991-9  |q text/html  |z Onlinezugriff via DOI 
898 |a BK010053  |b XK010053  |c XK010000 
900 7 |a Metadata rights reserved  |b Springer special CC-BY-NC licence  |2 nationallicence 
908 |D 1  |a research-article  |2 jats 
949 |B NATIONALLICENCE  |F NATIONALLICENCE  |b NL-springer 
950 |B NATIONALLICENCE  |P 856  |E 40  |u https://doi.org/10.1007/s00371-014-0991-9  |q text/html  |z Onlinezugriff via DOI 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Zheng  |D Jianwei  |u College of Computer Science and Technology, Zhejiang University of Technology, 288 Liuhe Road, 310023, Hangzhou, China  |4 aut 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Huang  |D Qiongfang  |u College of Computer Science and Technology, Zhejiang University of Technology, 288 Liuhe Road, 310023, Hangzhou, China  |4 aut 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Chen  |D Shengyong  |u College of Computer Science and Technology, Zhejiang University of Technology, 288 Liuhe Road, 310023, Hangzhou, China  |4 aut 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Wang  |D Wanliang  |u College of Computer Science and Technology, Zhejiang University of Technology, 288 Liuhe Road, 310023, Hangzhou, China  |4 aut 
950 |B NATIONALLICENCE  |P 773  |E 0-  |t The Visual Computer  |d Springer Berlin Heidelberg  |g 31/5(2015-05-01), 643-655  |x 0178-2789  |q 31:5<643  |1 2015  |2 31  |o 371