Name
Abstract | ||
|---|---|---|
In this paper, we extend the idea of sparse representation into the high dimensional feature space induced by the kernel function, and propose a kernel based test sample sparse representation and classification algorithm (KTSRC) for the first time. The KTSRC is based on the assumption that the test sample can be linearly represented by a part of the training samples in the high dimensional feature space. Although the explicit form of the sample in the feature space is unknown, we can implement the KTSRC by the kernel trick. The experimental results show that the KTSRC achieves promising performance in face recognition, and outperforms the state-of-the-art methods. |
Year | Venue | Keywords |
|---|---|---|
2012 | ICPR | training sample,image representation,kernel based test sample sparse representation and classification,face recognition,kernel based sparse representation,feature extraction,image classification,feature space,ktsrc algorithm |
Field | DocType | ISSN |
k-nearest neighbors algorithm,Computer vision,Radial basis function kernel,Pattern recognition,Kernel embedding of distributions,Computer science,Sparse approximation,Tree kernel,Polynomial kernel,Artificial intelligence,Kernel method,Kernel (statistics) | Conference | 1051-4651 |
ISBN | Citations | PageRank |
978-1-4673-2216-4 | 7 | 0.43 |
References | Authors | |
11 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Qi Zhu | 1 | 147 | 11.68 |
| Xu Yong | 2 | 335 | 19.68 |
| Jinghua Wang | 3 | 162 | 22.31 |
| Zizhu Fan | 4 | 329 | 14.61 |