By Topic

Coherence-Based Performance Guarantees for Estimating a Sparse Vector Under Random Noise

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

3 Author(s)
Ben-Haim, Z. ; Dept. of Electr. Eng., Technion - Israel Inst. of Technol., Haifa, Israel ; Eldar, Y.C. ; Elad, M.

We consider the problem of estimating a deterministic sparse vector x0 from underdetermined measurements A x0 + w, where w represents white Gaussian noise and A is a given deterministic dictionary. We provide theoretical performance guarantees for three sparse estimation algorithms: basis pursuit denoising (BPDN), orthogonal matching pursuit (OMP), and thresholding. The performance of these techniques is quantified as the l2 distance between the estimate and the true value of x0. We demonstrate that, with high probability, the analyzed algorithms come close to the behavior of the oracle estimator, which knows the locations of the nonzero elements in x0. Our results are non-asymptotic and are based only on the coherence of A, so that they are applicable to arbitrary dictionaries. This provides insight on the advantages and drawbacks of l1 relaxation techniques such as BPDN and the Dantzig selector, as opposed to greedy approaches such as OMP and thresholding.

Published in:

Signal Processing, IEEE Transactions on  (Volume:58 ,  Issue: 10 )