.png){kind=icon}
.png){kind=icon}
Return
Dimension reduction using kernel collaborative representation based projection
.png){kind=icon}
PRE
AI
DOI：10.1016/j.aeue.2017.06.032.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Dimension reduction plays a key role in pattern recognition. Sparsity preserving projection (SPP) and collaborative representation based projection (CRP) are two up-to-date dimension reduction methods. SPP uses sparse representation for dimension reduction and CRP uses collaborative representation. SPP and CRP both have good performances in dimension reduction and CRP is computationally more efficient than SPP. To make CRP more effective for linear inseparable data, we propose kernel collaborative representation based projection (KCRP) in this paper. In KCRP, the original data is mapped into a higher dimensional space by a nonlinear mapping and collaborative representation is performed in this new space by using kernel trick. Then, the low dimensional features are obtained by preserving the collaborative reconstructive relation. Experiments on AR, ORL and FERET databases show that KCRP performs better than SPP, CRP and some other popular dimension reduction methods. (C) 2017 Published by Elsevier GmbH.
Keywords:
Dimension reduction
Collaborative representation
Kernel method
Face recognition
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
A
IF:
3.2
Papers:
5.6K
Citations:
8.3K