Abstract

Abstract—Suppose is an unknown vector in (a digital image or signal); we plan to measure general linear functionals of and then reconstruct. If is known to be compressible by transform coding with a known transform, and we reconstruct via the nonlinear procedure defined here, the number of measurements can be dramatically smaller than the size. Thus, certain natural classes of images with pixels need only = ( 1 4 log 5 2 ()) nonadaptive nonpixel samples for faithful recovery, as opposed to the usual pixel samples. More specifically, suppose has a sparse representation in some orthonormal basis (e.g., wavelet, Fourier) or tight frame (e.g., curvelet, Gabor)—so the coefficients belong to an ball for 0 1. The most important coefficients in that expansion allow reconstruction with 2 error ( 1 2 1

Citations

1468	A Wavelet Tour of Signal Processing - Mallat - 1998
1089	Atomic decomposition by basis pursuit - Chen, Donoho, et al. - 1998
714	Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information - Candes, Romberg, et al. - 2006
699	Matching Pursuits with Time-Frequency Dictionaries - 27Mallat, Zhang - 1993
488	Near optimal signal recovery from random projections: Universal encoding strategies - Candès, Tao - 2006
327	Greed is good: Algorithmic results for sparse approximation - Tropp - 2004
283	Interpolation Spaces, An Introduction - Bergh, Löfstrom - 1976
243	Uncertainty principles and ideal atomic decomposition - Donoho, Huo - 2001
238	Wavelets and Operators - Meyer - 1993
231	The concentration of measure phenomenon - Ledoux - 2001
220	The Volume of Convex Bodies and Banach Space Geometry, Cambridge Tracts - Pisier - 1989
218	For most large underdetermined systems of linear equations the minimal 1-norm solution is also the sparsest solution - Donoho - 2006
207	Sparse approximate solutions to linear systems - Natarajan - 1995
204	Curvelets: A surprisingly effective nonadaptive representation for objects with edges - Candès, Donoho
194	Stable recovery of sparse overcomplete representations in the presence of noise - Donoho, Elad, et al.
185	Just relax: Convex programming methods for identifying sparse signals in noise - Tropp
173	Translation-invariant de-noising - Coifman, Donoho - 1995
152	Sparse representations in unions of bases - Gribonval, Nielsen - 2003
142	A generalized uncertainty principle and sparse representation in pairs of bases - Elad, Bruckstein - 1997
122	Unconditional bases are optimal bases for data compression and for statistical estimation - Donoho - 1994
119	Data compression and harmonic analysis - Donoho, Vetterli, et al. - 1998
108	On sparse representations in arbitrary redundant bases - Fuchs - 2004
106	n-Widths in Approximation Theory - Pinkus - 1985
106	Asymptotic theory of finite-dimensional normed spaces, volume 1200 - Milman, Schechtman - 1986
83	Empirical processes: theory and applications - Pollard - 1990
71	Just relax: Convex programming methods for subset selection and sparse approximation,” UT-Austin, ICES - Tropp - 2004
69	D: WaveLab and Reproducible Research - Buckheit, Donoho
57	Nearoptimal sparse Fourier representations via sampling - Gilbert, Guha, et al. - 2002
50	A general theory of optimal algorithms - Traub, Wo´zniakowski - 1980
39	On widths of the euclidean ball - Garnaev, Gluskin - 1984
38	Sparse components of images and optimal atomic decompositions - Donoho - 2001
37	Highly sparse representations from dictionaries are unique and independent of the sparseness measure - Gribonval, Nielsen
35	A survey of optimal recovery - Micchelli, Rivlin - 1977
26	The widths of certain finite-dimensional sets and classes of smooth functions - Kashin - 1977
21	Nonlinear approximation and the space - COHEN, DeVORE, et al. - 1999
20	Unconditional bases and bit-level compression - Donoho - 1996
18	Entropy numbers of diagonal operators between symmetric Banach spaces - Schütt - 1984
15	Optimally sparse representation from overcomplete distionaries via l1 norm minimization, Proc - Donoho, Elad
12	On the power of adaption - Novak - 1996
12	Entropy numbers, s-numbers, and eigenvalue problems - Carl - 1981
8	A survey of optimal recovery. Optimal estimation in approximation theory 1 - Micchelli, Rivlin - 1977
7	Spaces with large distance to ℓ n ∞ and random matrices - Szarek - 1990
6	For most underdetermined systems of linear equations, the minimal ℓ1-norm near-solution approximates the sparsest near-solution - Donoho - 2006
6	Daubechies, “Data compression and harmonic analysis - Donoho, Vetterli, et al. - 1998
6	Interpolation of normed abelian groups - Peetre, Sparr - 1972
6	tight frames of curvelets and optimal representations of objects with C2 singularities - New
5	Some results on convex bodies and Banach spaces - Dvoretsky - 1961
5	2002) A generalized uncertainty principle and sparse representations in pairs of bases - Elad, Bruckstein
5	A lower estimate for entropy numbers - Kühn
4	Xiaoming (2001) Uncertainty Principles and Ideal Atomic Decomposition - Donoho, Huo - 2001