Document Type

Conference Proceeding


Mathematics (CMC)

Publication Date



This paper seeks to bridge the two major algorithmic approaches to sparse signal recovery from an incomplete set of linear measurements – L1-minimization methods and iterative methods (Matching Pursuits). We find a simple regularized version of the Orthogonal Matching Pursuit (ROMP) which has advantages of both approaches: the speed and transparency of OMP and the strong uniform guarantees of the L1-minimization. Our algorithm ROMP reconstructs a sparse signal in a number of iterations linear in the sparsity, and the reconstruction is exact provided the linear measurements satisfy the Uniform Uncertainty Principle. In the case of inaccurate measurements and approximately sparse signals, the noise level of the recovery is proportional to √ log nkek2 where e is the error vector.

Rights Information

© 2008 SPIE

Terms of Use & License Information

Terms of Use for work posted in Scholarship@Claremont.