Journal
PROCEEDINGS OF THE IEEE
Volume 98, Issue 6, Pages 948-958Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JPROC.2010.2044010
Keywords
Compressed sensing; convex optimization; matching pursuit; sparse approximation
Categories
Funding
- Office of Naval Research (ONR) [N00014-08-1-2065]
- National Science Foundation (NSF) [CCF-0430504, DMS-0427689, CTS-0456694, CNS-0540147, DMS-0914524]
Ask authors/readers for more resources
The goal of the sparse approximation problem is to approximate a target signal using a linear combination of a few elementary signals drawn from a fixed collection. This paper surveys the major practical algorithms for sparse approximation. Specific attention is paid to computational issues, to the circumstances in which individual methods tend to perform well, and to the theoretical guarantees available. Many fundamental questions in electrical engineering, statistics, and applied mathematics can be posed as sparse approximation problems, making these algorithms versatile and relevant to a plethora of applications.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available