Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information

IEEE Transactions on Information Theory

Volumn 52, Issue 2, 2006, Pages 489-509

  Candès, Emmanuel J ^a   Romberg, Justin ^a   Tao, Terence ^b  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Convex optimization; Duality in optimization; Free probability; Image reconstruction; Linear programming; Random matrices; Sparsity; Total variation minimization; Trigonometric expansions; Uncertainty principle

Indexed keywords

ALGORITHMS; FINITE DIFFERENCE METHOD; FOURIER TRANSFORMS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; MATRIX ALGEBRA; OPTIMIZATION; POLYNOMIALS; PROBABILITY; RANDOM PROCESSES;

CONVEX OPTIMIZATION; DUALITY IN OPTIMIZATION; EXACT SIGNAL RECONSTRUCTION; FREE PROBABILITY; INCOMPLETE FREQUENCY SAMPLES; RANDOM MATRICES; SPARSITY; TOTAL-VARIATION MINIMIZATION; TRIGONOMETRIC EXPANSIONS; UNCERTAINTY PRINCIPLE;

IMAGE RECONSTRUCTION;

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

References (31)

1. A. H. Delaney and Y. Bresler, "A fast and accurate iterative reconstruction algorithm for parallel-beam tomography," IEEE Trans. Image Process., vol. 5, no. 5, pp. 740-753, May 1996.
2. C. Mistretta, private communication, 2004.
3. T. Tao, "An uncertainty principle for cyclic groups of prime order," Math. Res. Lett., vol. 12, no. 1, pp. 121-127, 2005.
4. D. L. Donoho and P. B. Stark, "Uncertainty principles and signal recovery," SIAM J. Appl. Math., vol. 49, no. 3, pp. 906-931, 1989.
5. D. L. Donoho and X. Huo, "Uncertainty principles and ideal atomic decomposition," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2845-2862, Nov. 2001.
6. J. Nocedal and S. J. Wright, Numerical Optimization, ser. Springer Series in Operations Research. New York: Springer-Verlag, 1999.
7. D. L. Donoho and B. F. Logan, "Signal recovery and the large sieve," SIAM J. Appl. Math., vol. 52, no. 2, pp. 577-591, 1992.
8. 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.
9. 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.
10. 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.
11. D. W. Oldenburg, T. Scheuer, and S. Levy, "Recovery of the acoustic impedance from reflection seismograms," Geophys., vol. 48, pp. 1318-1337, 1983.
12. S. Levy and P. K. Fullagar, "Reconstruction of a sparse spike train from a portion of its spectrum and application to high-resolution deconvolution," Geophys., vol. 46, pp. 1235-1243, 1981.
13. 1 minimization," Proc. Nat. Acad. Sci. USA, vol. 100, no. 5, pp. 2197-2202, 2003.
14. M. Elad and A. M. Bruckstein, "A generalized uncertainty principle and sparse representation in pairs of bases," IEEE Trans. Inf. Theory, vol. 48, no. 9, pp. 2558-2567, Sep. 2002.
15. A. Feuer and A. Nemirovski, "On sparse representation in pairs of bases," IEEE Trans. Inf. Theory, vol. 49, no. 6, pp. 1579-1581, Jun. 2003.
16. R. Gribonval and M. Nielsen, "Sparse representations in unions of bases," IEEE Trans. Inf. Theory, vol. 49, no. 12, pp. 3320-3325, Dec. 2003.
17. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2231-2242, Oct. 2004.
18. J. A. Tropp, "Just relax: Convex programming methods for subset selection and sparse approximation," IEEE Trans. Inf. Theory, submitted for publication.
19. P. Feng and Y. Bresler, "Spectrum-blind minimum-rate sampling and reconstruction of multiband signals," in Proc. IEEE Int. Conf. Acoustics, Speech and Signal Processing, vol. 2, Atlanta, GA, 1996, pp. 1689-1692.
20. P. Feng, S. Yau, and Y. Bresler, "A multicoset sampling approach to the missing cone problem in computer aided tomography," in Proc. IEEE Int. Conf. Acoustics, Speech and Signal Processing, vol. 2, Atlanta, GA, 1996, pp. 734-737.
21. M. Vetterli, P. Marziliano, and T. Blu, "Sampling signals with finite rate of innovation," IEEE Trans. Signal Process., vol. 50, no. 6, pp. 1417-1428, Jun. 2002.
22. 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 of Computing, Montreal, QC, Canada, May 2002, pp. 152-161.
23. 2 Bottleneck in Estimating B-Term Fourier Representations," unpublished manuscript, May 2004.
24. J.-J. Fuchs, "On sparse representations in arbitrary redundant bases," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1341-1344, Jun. 2004.
25. K. Jogdeo and S. M. Samuels, "Monotone convergence of binomial probabilities and a generalization of Ramanujan's equation;' Ann. Math. Statist., vol. 39, pp. 1191-1195, 1968.
26. S. Boucheron, G. Lugosi, and P. Massart, "A sharp concentration inequality with applications," Random Structures Algorithms, vol. 16, no 3, pp. 277-292, 2000.
27. H. J. Landau and H. O. Pollak, "Prolate spheroidal wave functions, Fourier analysis and uncertainty. II," Bell Syst. Tech. J., vol. 40, pp. 65-84, 1961.
28. H. J. Landau, "The eigenvalue behavior of certain convolution equations," Trans. Amer. Math. Soc., vol. 115, pp. 242-256, 1965.
29. H. J. Landau and H. Widom, "Eigenvalue distribution of time and frequency limiting," J. Math. Anal. Appl., vol. 77, no. 2, pp. 469-481, 1980.
30. E. J. Candes and P. S. Loh, "Image Reconstruction With Ridgelets," Calif. Inst. Technology, SURF Tech. Rep., 2002.
31. L. I. Rudin, S. Osher, and E. Fatemi, "Nonlinear total variation noise removal algorithm," Physica D., vol. 60, no. 1-4, pp. 259-268, 1992.