期刊
IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING
卷 4, 期 2, 页码 310-316出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JSTSP.2010.2042412
关键词
Compressed sensing (CS); sparse approximation problem; orthogonal matching pursuit; uncertainty principle
资金
- NSF [0652617]
- Direct For Mathematical & Physical Scien
- Division Of Mathematical Sciences [0918623, 0652617] Funding Source: National Science Foundation
We demonstrate a simple greedy algorithm that can reliably recover a vector upsilon is an element of R-d from incomplete and inaccurate measurements x =Phi upsilon + e. Here, Phi is a N x d measurement matrix with N << d and is an error vector. Our algorithm, Regularized Orthogonal Matching Pursuit (ROMP), seeks to provide the benefits of the two major approaches to sparse recovery. It combines the speed and ease of implementation of the greedy methods with the strong guarantees of the convex programming methods. For any measurement matrix Phi that satisfies a quantitative restricted isometry principle, ROMP recovers a signal upsilon with O(n) nonzeros from its inaccurate measurements x in at most n iterations, where each iteration amounts to solving a least squares problem. The noise level of the recovery is proportional to root logn parallel to e parallel to(2). In particular, if the error term e vanishes the reconstruction is exact. This stability result extends naturally to the very accurate recovery of approximately sparse signals.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据