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.
Type de document :
Article dans une revue
IEEE Transactions on Signal Processing, Institute of Electrical and Electronics Engineers, 2010, 58 (10), pp.5030 -5043. 〈10.1109/TSP.2010.2052460〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00567465
Contributeur : Jules Espiau de Lamaestre <>
Soumis le : lundi 21 février 2011 - 12:03:11
Dernière modification le : samedi 14 avril 2018 - 23:58:03

Lien texte intégral

Identifiants

Collections

Citation

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, Institute of Electrical and Electronics Engineers, 2010, 58 (10), pp.5030 -5043. 〈10.1109/TSP.2010.2052460〉. 〈inria-00567465〉

Partager

Métriques

Consultations de la notice

37