Sparse Representation Classification Beyond L1 Minimization and the Subspace Assumption
The sparse representation classifier (SRC) has been utilized in various classification problems, which makes use of L1 minimization and works well for image recognition satisfying a subspace assumption. In this paper we propose a new implementation of SRC via screening, establish its equivalence to the original SRC under regularity conditions, and prove its classification consistency under a latent subspace model and contamination. The results are demonstrated via simulations and real data experiments, where the new algorithm achieves comparable numerical performance and significantly faster.
Code (0)
등록된 구현이 없습니다.
Tasks
ClassificationClassification ConsistencyGeneral ClassificationSimilar Papers 제목 키워드 기반
Approximate Subspace-Sparse Recovery with Corrupted Data via Constrained $\ell_1$-Minimization
High-dimensional data often lie in low-dimensional subspaces corresponding to different classes they belong to. Finding sparse representations of data points in a dictionary built using the collection of data helps to un…
ClusteringCorrelation Adaptive Subspace Segmentation by Trace Lasso
This paper studies the subspace segmentation problem. Given a set of data points drawn from a union of subspaces, the goal is to partition them into their underlying subspaces they were drawn from. The spectral clusterin…
ClusteringSegmentationSparse Subspace Clustering: Algorithm, Theory, and Applications
In many real-world problems, we are dealing with collections of high-dimensional data, such as images, videos, text and web documents, DNA microarray data, and more. Often, high-dimensional data lie close to low-dimensio…
ClusteringFace ClusteringImage ClusteringMotion SegmentationSubspace-Sparse Representation
Given an overcomplete dictionary $A$ and a signal $b$ that is a linear combination of a few linearly independent columns of $A$, classical sparse recovery theory deals with the problem of recovering the unique sparse rep…
Sparse Representation-based ClassificationScalable Sparse Subspace Clustering via Ordered Weighted $\ell_1$ Regression
The main contribution of the paper is a new approach to subspace clustering that is significantly more computationally efficient and scalable than existing state-of-the-art methods. The central idea is to modify the regr…
Clusteringregression