A Survey of Sparse Representation: Algorithms and Applications

961Citations
Citations of this article
691Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Sparse representation has attracted much attention from researchers in fields of signal processing, image processing, computer vision, and pattern recognition. Sparse representation also has a good reputation in both theoretical research and practical applications. Many different algorithms have been proposed for sparse representation. The main purpose of this paper is to provide a comprehensive study and an updated review on sparse representation and to supply guidance for researchers. The taxonomy of sparse representation methods can be studied from various viewpoints. For example, in terms of different norm minimizations used in sparsity constraints, the methods can be roughly categorized into five groups: 1) sparse representation with $l-{0}$ -norm minimization; 2) sparse representation with $l-{p}$ -norm ( $0

Cite

CITATION STYLE

APA

Zhang, Z., Xu, Y., Yang, J., Li, X., & Zhang, D. (2015). A Survey of Sparse Representation: Algorithms and Applications. IEEE Access, 3, 490–530. https://doi.org/10.1109/ACCESS.2015.2430359

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free