By Topic

Signal Recovery From Incomplete and Inaccurate Measurements Via Regularized Orthogonal Matching Pursuit

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Deanna Needell ; Dept. of Mathematics, University of California, Davis, CA, USA ; Roman Vershynin

We demonstrate a simple greedy algorithm that can reliably recover a vector v ?? ??d from incomplete and inaccurate measurements x = ??v + e. Here, ?? is a N x d measurement matrix with N<<d, and e 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 ?? that satisfies a quantitative restricted isometry principle, ROMP recovers a signal v 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 ??{logn} ||e||2. In particular, if the error term e vanishes the reconstruction is exact.

Published in:

IEEE Journal of Selected Topics in Signal Processing  (Volume:4 ,  Issue: 2 )