Computer Science – Information Theory
Scientific paper
2010-11-16
Computer Science
Information Theory
36 pages
Scientific paper
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 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) - they make use of a much weaker notion - or 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 log n Fourier coefficients that are contaminated with noise.
Candes Emmanuel J.
Plan Yaniv
No associations
LandOfFree
A probabilistic and RIPless theory of compressed sensing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A probabilistic and RIPless theory of compressed sensing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A probabilistic and RIPless theory of compressed sensing will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-110552