Sparse Representation Classification Beyond ℓ1 Minimization and the Subspace Assumption

DOI10.1109/TIT.2020.2981309MaRDI QIDQ5124486zbMATH OpenWikidataFDO

Authors Cencheng Shen, Li Chen, Yuexiao Dong, Carey E. Priebe

Publication date 29 September 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1502.01368

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Ridge regression; shrinkage estimators (Lasso) (62J07) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Abstract: 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.

Cited in

(1)

scientific article; zbMATH DE number 7164743 (Why is no real title available?)

This page was built for publication: Sparse Representation Classification Beyond ℓ1 Minimization and the Subspace Assumption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124486)