Near-optimal signal recovery from random projections: Universal encoding strategies?

IEEE Transactions on Information Theory

Volumn 52, Issue 12, 2006, Pages 5406-5425

  Candes, Emmanuel J ^a   Tao, Terence ^b  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Concentration of measure; Convex optimization; Duality in optimization; Linear programming; Random matrices; Random projections; Signal recovery; Singular values of random matrices; Sparsity; Trigonometric expansions; Uncertainty principle

Indexed keywords

IMAGE PROCESSING; LINEAR PROGRAMMING; OPTIMIZATION; RANDOM PROCESSES; SIGNAL ENCODING;

CONCENTRATION OF MEASURE; CONVEX OPTIMIZATION; DUALITY IN OPTIMIZATION; RANDOM MATRICES; RANDOM PROJECTIONS; SIGNAL RECOVERY; SINGULAR VALUES OF RANDOM MATRICES; SPARSITY; TRIGONOMETRIC EXPANSIONS; UNCERTAINTY PRINCIPLE;

SIGNAL RECONSTRUCTION;

EID: 33947416035     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.885507     Document Type: Article

References (47)

1. J. Bourgain, "Bounded orthogonal systems and the A(p)-set problem," Acta Math., vol. 162, no. 3-4, pp. 227-245, 1989.
2. J. Bourgain, "Remarks on Halasz-Montgomery type inequalities," in Geometric Aspects of Functional Analysis (Israel, 1992-1994), ser. Oper. Theory Adv. Appl., Cambridge, MA: Birkhäuser, vol. 77, pp. 25-39.
3. E. Candès, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inf. Theory, no. 2, pp. 489-509, Feb. 2006.
4. E. J. Candès and J. Romberg, The Role of Sparsity and Incoherence for Exactly Reconstructing a Signal from Limited Measurements California Inst. Technol., Pasadena, Tech. Rep., 2004.
5. 1-norm solution is also the sparsest solution," Commun. Pure Appl. Math., vol. 59, no. 6, pp. 797-829, 2006.
6. R. A. DeVore, "Nonlinear approximation," in Acta Numerica, 1998. Cambridge, U.K.: Cambridge Univ. Press, 1998, vol. 7, pp. 51-150, ser. Acta Numer.
7. D. L. Donoho, M. Vetterli, R. A. DeVore, and I. Daubechies, "Data compression and harmonic analysis," IEEE Trans. Inf. Theory, vol. 44, no. 6, pp. 2435-2476, 1998.
8. 2)," Amer. J. Math., vol. 121, no. 3, pp. 587-628, 1999.
9. S. Mallat, A Wavelet Tour of Signal Processing. San Diego, CA: Academic, 1998.
10. H. G. Feichtinger, "Atomic characterizations of modulation spaces through Gabor-type representations," Rocky Mountain J. Math., vol. 19, no. 1, pp. 113-125, 1989.
11. 2 singularities," Commun. Pure Appl. Math., vol. 57, no. 2, pp. 219-266, 2004.
12. A. Pinkus, n-Widths in Approximation Theory, ser. Ergebnisse der Mathematik und ihrer Grenzgebiete (3) [Results in Mathematics and Related Areas (3)]. Berlin, Germany: Springer-Verlag, 1985, vol. 7.
13. B. Kashin, "The widths of certain finite dimensional sets and classes of smooth functions," Izvestia, vol. 41, pp. 334-351, 1977.
14. A. Garnaev and E. Gluskin, "The widths of a Euclidean ball," Dokl. A. N. USSR, vol. 277, pp. 1048-1052, 1984, in Russian.
15. K. Ball, "An elementary introduction to modem convex geometry," in Flavors of Geometry, ser. Math. Sci. Res. Inst. Publ., Cambridge, U.K.: Cambridge Univ. Press, 1997, vol. 31, pp. 1-58.
16. E. J. Candès and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-1215, 2005.
17. N. Alon, Y. Matias, and M. Szegedy, "The space complexity of approximating the frequency moments," J. Comput. Syst. Sci., vol. 58, no. 1, pt. 2, pp. 137-147, 1999.
18. 2 Bottleneck in Estimating B-Term Fourier Representations. May 2004.
19. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, 2006.
20. D. L. Donoho and P. B. Stark, "Uncertainty principles and signal recovery," SIAM J. Appl. Math., vol. 49, no. 3, pp. 906-931, 1989.
21. W. B. Johnson and J. Lindenstrauss, "Extensions of Lipschitz mappings into a Hilbert space," in Proc. Conf. Modern Anal. Prob., Providence, RI, 1984, vol. 26, pp. 189-206.
22. J.-J. Fuchs, "On sparse representations in arbitrary redundant bases," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1341-1344, 2004.
23. F. Santosa and W. W. Symes, "Linear inversion of band-limited reflection seismograms," SIAM J. Sci. Statist. Comput., vol. 7, no. 4, pp. 1307-1330, 1986.
24. D. C. Dobson and F. Santosa, "Recovery of blocky images from noisy and blurred data," SIAM J. Appl. Math., vol. 56, no. 4, pp. 1181-1198, 1996.
25. L. I. Rudin, S. Osher, and E. Fatemi, "Nonlinear total variation based noise removal algorithm," Physica D, pp. 259-268, 1992.
26. S.S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM J. Sci. Comput., vol. 20, no. 1, pp. 33-61, 1998.
27. S. S. Chen, "Basis Pursuit," Ph.D. dissertation, Stanford University, Stanford, CA, 1995.
28. D. L. Donoho and X. Huo, "Uncertainty principles and ideal atomic decomposition," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2845-2862, 2001.
29. 1 minimization," Proc. Nat. Acad. Sci., vol. 100, no. 5, pp. 2197-2202, 2003.
30. R. Gribonval and M. Nielsen, "Sparse representations in unions of bases," IEEE Trans. Inf. Theory, vol. 49, no. 12, pp. 3320-3325, 2003.
31. E. J. Candès and J. Romberg, "Quantitative robust uncertainty principles and optimally sparse decompositions," Found. Comput. Math., vol. 6, no. 2, pp. 227-254, 2006.
32. P. Bloomfield and W. L. Steiger, Least Absolute Deviations. Cambridge, MA: Birkhäuser, 1983, vol. 6, ser. Progress in Probability and Statistics, theory, applications, and algorithms.
33. V. A. Marcenko and L. A. Pastur, "Distribution of eigenvalues in certain sets of random matrices," Mat. Sb. (N.S.), vol. 72, no. 114, pp. 507-536, 1967.
34. J. W. Silverstein, "The smallest eigenvalue of a large-dimensional Wishart matrix," Ann. Probab., vol. 13, no. 4, pp. 1364-1368, 1985.
35. I. M. Johnstone, "On the distribution of the largest eigenvalue in principal components analysis," Ann. Statist., vol. 29, no. 2, pp. 295-327, 2001.
36. S. J. Szarek, "Condition numbers of random matrices," J. Complexity, vol. 7, no. 2, pp. 131-149, 1991.
37. K. R. Davidson and S. J. Szarek, "Addenda and corrigenda to: "Local operator theory, random matrices and Banach spaces" [in it Handbook of the geometry of Banach Spaces, vol. I, 317-366, North-Holland, Amsterdam, 2001; MR 1863696 (2004f:47002a)]," in Handbook of the Geometry of Banach spaces. Amsterdam, The Netherlands: North-Holland, 2003, vol. 2, pp. 1819-1820.
38. M. Ledoux, The Concentration of Measure Phenomenon, ser. Mathematical Surveys and Monographs. Providence, RI: American Mathematical Society, 2001, vol. 89.
39. N. El Karoui, "New Results About Random Covariance Matrices and Statistical Applications," Ph.D. dissertation, Stanford University, Stanford, CA, 2004.
40. Z. D. Bai and Y. Q. Yin, "Limit of the smallest eigenvalue of a large-dimensional sample covariance matrix," Ann. Probab., vol. 21, no. 3, pp. 1275-1294, 1993.
41. A. E. Litvak, A. Pajor, M. Rudelson, and N. Tomczak-Jaegermann, "Smallest singular value of random matrices and geometry of random polytopes," Adv. Math., vol. 195, no. 2, pp. 491-523, 2005.
42. M. Rudelson and R. Vershynin, Sparse Reconstruction by Convex Relaxation: Fourier and Gaussian Measurements 2005.
43. S. Boucheron, G. Lugosi, and P. Massart, "A sharp concentration inequality with applications," Random Struct. Algor., vol. 16, no. 3, pp. 277-292, 2000.
44. G. Mockenhaupt and W. Schlag, On the Hardy-Littlewood Problem for Random Sets 2003, available on the arxiv preprint server.
45. A. C. Gilbert, S. Guha, P. Indyk, S. Muthukrishnan, and M. J. Strauss, "Near-optimal sparse Fourier representations via sampling," in Proc. 34th ACM Symp. Theory Comput., Montreal, QC, Canada, May 2002.
46. A. Pajor and N. Tomczak-Jaegermann, "Subspaces of small codimension of finite-dimensional Banach spaces," in Proc. Amer. Math. Soc., 1986, vol. 97, no. 4, pp. 637-642.
47. J. Bourgain, J. Lindenstrauss, and V. Milman, "Approximation of zonoids by zonotopes," Acta Math., vol. 162, no. 1-2, pp. 73-141, 1989.