Coherence-Based Performance Guarantees for Estimating a Sparse Vector Under Random Noise - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles IEEE Transactions on Signal Processing Year : 2010

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

Abstract

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.

Dates and versions

inria-00567465 , version 1 (21-02-2011)

Identifiers

Cite

Zvika Ben-Haim, Yonina C. Eldar, Michael Elad. Coherence-Based Performance Guarantees for Estimating a Sparse Vector Under Random Noise. IEEE Transactions on Signal Processing, 2010, 58 (10), pp.5030 -5043. ⟨10.1109/TSP.2010.2052460⟩. ⟨inria-00567465⟩
63 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More