Work

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

Year: 2010
Type: article
Abstract: We consider the problem of estimating a deterministic sparse vector x0from 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 l2distance 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 l1relaxation techniques such as BPDN and the Dantzig selector, as opposed to greedy approaches such as OMP and thresholding.
Language: English
Open Access status: green
OpenAlex ID: W2104783034
FWCI: 20.65
Cites: 48
Cited by: 263
Related to: 10