Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Sparse Recovery With Orthogonal Matching Pursuit Under RIP

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
$31 $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

1 Author(s)
Tong Zhang ; Stat. Dept., Rutgers Univ., New Brunswick, NJ, USA

This paper presents a new analysis for the orthogonal matching pursuit (OMP) algorithm. It is shown that if the restricted isometry property (RIP) is satisfied at sparsity level O(k̅), then OMP can stably recover a -sparse signal in 2-norm under measurement noise. For compressed sensing applications, this result implies that in order to uniformly recover a -sparse signal in Rd, only O( lnd) random projections are needed. This analysis improves some earlier results on OMP depending on stronger conditions that can only be satisfied with Ω(2 lnd) or Ω(1.6 lnd) random projections.

Published in:

Information Theory, IEEE Transactions on  (Volume:57 ,  Issue: 9 )