.png){kind=icon}
.png){kind=icon}
Return
Computational Methods for Sparse Solution of Linear Inverse Problems
.png){kind=icon}
OA
AI
DOI：10.1109/JPROC.2010.2044010.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Compressed sensing
convex optimization
matching pursuit
sparse approximation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
25.9
Papers:
9.9K
Citations:
4.5W
