Paper Info
Title
Ways to sparse representation: An overview.
Abstract
Many algorithms have been proposed to find sparse representations over redundant dictionaries or transforms. This paper gives an overview of these algorithms by classifying them into three categories: greedy pursuit algorithms, l p norm regularization based algorithms, and iterative shrinkage algorithms. We summarize their pros and cons as well as their connections. Based on recent evidence, we conclude that the algorithms of the three categories share the same root: l p norm regularized inverse problem. Finally, several topics that deserve further investigation are also discussed.
Year
DOI
Venue
2009
10.1007/s11432-009-0045-5
Science in China Series F: Information Sciences
Keywords
DocType
Volume
sparse representation,inverse problem
Journal
52
Issue
ISSN
Citations 
4
18622836
9
PageRank 
References 
Authors
0.49
25
4
Name
Order
Citations
PageRank
Jing-yu Yang16061345.83
YiGang Peng245114.87
Wenli Xu3132763.69
Qionghai Dai43904215.66