.png){kind=icon}
Return
Sparse neighbor representation for classification
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2011.11.010.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Recent research of sparse signal representation has aimed at learning discriminative sparse models instead of purely reconstructive ones for classification tasks, such as sparse representation based classification (SRC) which obtains state-of-the-art results in face recognition. In this paper, a new method is proposed in that direction. With the assumption of locally linear embedding, the proposed method achieves the classification goal via sparse neighbor representation, combining the reconstruction property, sparsity and discrimination power. The experiments on several data sets are performed and results show that the proposed method is acceptable for nonlinear data sets. Further, it is argued that the proposed method is well suited for the classification of low dimensional data dimensionally reduced by dimensionality reduction methods, especially the methods obtaining the low dimensional and neighborhood preserving embeddings, and it costs less time. (C) 2011 Elsevier B.V. All rights reserved.
Keywords:
Sparse representation
Locally linear embedding
Sparse neighbor representation
K nearest neighbors
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.3
Papers:
8.0K
Citations:
1.6W
Organization
Cited Papers
ShareSaveShareSaveShareSaveBacterial Inactivation by Solar Ultraviolet Radiation Compared with Sensitivity to 254 nm Radiation
OAAI
OAAIShareSaveShareSaveImproved system for object detection and star/galaxy classification via local subspace analysis.png)
NEURAL NETWORKS
NEURAL NETWORKSIF6.3
PREAI
ShareSaveShareSave
View more