##### Personal tools
You are here: Home :: Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies
• Access your Committee/ Chapter directory
• Submit news and events
• And more (coming soon)

New user?

# Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies

 Author(s):

Creation Date: Jan 27, 2009

Published In: Nov 2006

Paper Type: Journal Article

Book Title: IEEE Trans. Inform. Theory

Abstract:

Suppose we are given a vector f in a class FsubeRopf, e.g., a class of digital signals or digital images. How many linear measurements do we need to make about f to be able to recover f to within precision epsi in the Euclidean (lscr2) metric? This paper shows that if the objects of interest are sparse in a fixed basis or compressible, then it is possible to reconstruct f to within very high accuracy from a small number of random measurements by solving a simple linear program. More precisely, suppose that the nth largest entry of the vector |f| (or of its coefficients in a fixed basis) obeys |f|(n)lesRmiddotn-1p/, where R>0 and p>0. Suppose that we take measurements yk=langf,Xkrang,k=1,...,K, where the Xk are N-dimensional Gaussian vectors with independent standard normal entries. Then for each f obeying the decay estimate above for some 0<p<1 and with overwhelming probability, our reconstruction ft, defined as the solution to the constraints yk=langf,Xkrang with minimal lscr1 norm, obeys parf-f#parlscr2lesCpmiddotRmiddot(K/logN)-r, r=1/p-1/2. There is a sense in which this result is optimal; it is generally impossible to obtain a higher accuracy from any set of K measurements whatsoever. The methodology extends to various other random measurement ensembles; for example, we show that similar results hold if one observes a few randomly sampled Fourier coefficients of f. In fact, the results are quite general and require only two hypotheses on the measurement ensemble which are detailed

 Award(s) Received: Information Theory Society Paper Award (2008)