期刊
PROCEEDINGS OF THE IEEE
卷 98, 期 6, 页码 948-958出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JPROC.2010.2044010
关键词
Compressed sensing; convex optimization; matching pursuit; sparse approximation
资金
- Office of Naval Research (ONR) [N00014-08-1-2065]
- National Science Foundation (NSF) [CCF-0430504, DMS-0427689, CTS-0456694, CNS-0540147, DMS-0914524]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据