Title :
A Probabilistic and RIPless Theory of Compressed Sensing
Author :
Candès, Emmanuel J. ; Plan, Yaniv
Author_Institution :
Depts. of Math. & Stat., Stanford Univ., Stanford, CA, USA
Abstract :
This paper introduces a simple and very general theory of compressive sensing. In this theory, the sensing mechanism simply selects sensing vectors independently at random from a probability distribution F; it includes all standard models-e.g., Gaussian, frequency measurements-discussed in the literature, but also provides a framework for new measurement strategies as well. We prove that if the probability distribution F obeys a simple incoherence property and an isotropy property, one can faithfully recover approximately sparse signals from a minimal number of noisy measurements. The novelty is that our recovery results do not require the restricted isometry property (RIP) to hold near the sparsity level in question, nor a random model for the signal. As an example, the paper shows that a signal with s nonzero entries can be faithfully recovered from about s logn Fourier coefficients that are contaminated with noise.
Keywords :
Fourier analysis; data compression; random processes; signal reconstruction; statistical distributions; Fourier coefficients; Gaussian model; RIPless theory; compressed sensing; frequency measurements; probabilistic theory; probability distribution; restricted isometry property; signal random model; sparse signals; Coherence; Compressed sensing; Convolution; Discrete Fourier transforms; Upper bound; (weak) restricted isometries; $ell_1$ minimization; Compressed sensing; Dantzig selector; Gross\´ golfing scheme; LASSO; operator Bernstein inequalities; random matrices; sparse regression;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2011.2161794