稀疏逼近
计算机科学
算法
贪婪算法
规范(哲学)
代表(政治)
缩小
神经编码
人工智能
匹配追踪
理论计算机科学
压缩传感
政治学
政治
程序设计语言
法学
作者
Zheng Zhang,Yong Xu,Jian Yang,Xuelong Li,David Zhang
出处
期刊:IEEE Access
[Institute of Electrical and Electronics Engineers]
日期:2015-01-01
卷期号:3: 490-530
被引量:852
标识
DOI:10.1109/access.2015.2430359
摘要
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 article is to provide a comprehensive study and an updated review on sparse representation and to supply a 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: sparse representation with $l_0$-norm minimization, sparse representation with $l_p$-norm (0$<$p$<$1) minimization, sparse representation with $l_1$-norm minimization and sparse representation with $l_{2,1}$-norm minimization. In this paper, a comprehensive overview of sparse representation is provided. The available sparse representation algorithms can also be empirically categorized into four groups: greedy strategy approximation, constrained optimization, proximity algorithm-based optimization, and homotopy algorithm-based sparse representation. The rationales of different algorithms in each category are analyzed and a wide range of sparse representation applications are summarized, which could sufficiently reveal the potential nature of the sparse representation theory. Specifically, an experimentally comparative study of these sparse representation algorithms was presented. The Matlab code used in this paper can be available at: http://www.yongxu.org/lunwen.html.
科研通智能强力驱动
Strongly Powered by AbleSci AI