Precise undersampling theorems

Proceedings of the IEEE

Volumn 98, Issue 6, 2010, Pages 913-924

  Donoho, David L ^a   Tanner, Jared ^b  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Bandlimited measurements; Compressed sensing; L1 minimization; Random measurements; Random polytopes; Superresolution; Undersampling; Universality of matrix ensembles

Indexed keywords

ELECTRICAL ENGINEERING;

BANDLIMITED; L1 MINIMIZATIONS; MATRIX ENSEMBLES; RANDOM MEASUREMENT; RANDOM POLYTOPES; SUPER RESOLUTION; UNDER-SAMPLING;

COMPRESSED SENSING;

EID: 77953126052     PISSN: 00189219     EISSN: None     Source Type: Journal    
DOI: 10.1109/JPROC.2010.2045630     Document Type: Article

References (45)

1. SparseLab. "Seeking sparse solutions to linear systems of equations." [Online]. Available: http://sparselab.stanford.edu
2. D. Lustig, M. Donoho, and J. M. Pauly, "Sparse MRI: The application of compressed sensing for rapid MR imaging," Magn. Reson. Med., vol.58, no.6, pp. 1182-1195, 2007.
3. M. Lustig, D. Donoho, J. Santos, and J. Pauly, "Compressed sensing MRI," IEEE Signal Process. Mag., vol.25, no.2, pp. 72-82, Mar. 2008.
4. E. J. Candès, J. K. Romberg, and T. Tao, "Stable signal recovery from incomplete and inaccurate measurements," Commun. Pure Appl. Math., vol.59, no.8, pp. 1207-1223, 2006. (Pubitemid 43988295)
5. D. L. Donoho and J. Tanner, "Counting faces of randomly projected polytopes when the projection radically lowers dimension," J. Amer. Math. Soc., vol.22, no.1, pp. 1-53, 2009.
6. D. L. Donoho, I. M. Johnstone, J. C. Hoch, and A. S. Stern, "Maximum entropy and the nearly black object," J. R. Stat. Soc. B, vol.54, no.1, pp. 41-81, 1992.
7. D. L. Donoho and J. Tanner, "Sparse nonnegative solution of underdetermined linear equations by linear programming," Proc. Nat. Acad. Sci. USA, vol.102, no.27, pp. 9446-9451, 2005. (Pubitemid 40981701)
8. J.-J. Fuchs, "Sparsity and uniqueness for some specific underdetermined linear systems," in Proc. IEEE Int. Conf. Acoust. Speech Signal Process., Philadelphia, PA, 2005, vol.5, pp. v/729-v/732.
9. P. A. Jansson, Deconvolution of Images and Spectra. New York: Academic, 1997.
10. D. L. Donoho and J. Tanner, "Counting the faces of randomly-projected hypercubes and orthants, with applications," Discrete Comput. Geometry, vol.43, no.3, pp. 522-541, 2010.
11. D. L. Donoho, "High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension," Discrete Comput. Geometry, vol.35, no.4, pp. 617-652, 2006.
12. D. L. Donoho, "Neighborly polytopes and sparse solution of underdetermined linear equations," Dept. Stat., Stanford Univ., Stanford, CA, Tech. Rep., 2004.
13. D. L. Donoho and J. Tanner, "Neighborliness of randomly projected simplices in high dimensions," Proc. Nat. Acad. Sci. USA, vol.102, no.27, pp. 9452-9457, 2005. (Pubitemid 40981702)
14. F. Affentranger and R. Schneider, "Random projections of regular simplices," Discrete Comput. Geometry, vol.7, no.3, pp. 219-226, 1992.
15. A. M. Vershik and P. V. Sporyshev, "Asymptotic behavior of the number of faces of random polyhedra and the neighborliness problem," Selecta Math. Soviet., vol.11, no.2, pp. 181-201, 1992.
16. D. L. Donoho and J. Tanner, "Exponential bounds implying construction of compressed sensing matrices, error-correcting codes and neighborly polytopes by random sampling," IEEE Trans. Inf. Theory, vol.56, no.4, pp. 2002-2016, Apr. 2010.
17. D. Donoho and J. Tanner, "Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing," Phil. Trans. R. Soc. A, vol.367, no.1906, pp. 4273-4293, 2009.
18. R. Adamczak, A. E. Litvak, and A. P. N. Tomczak-Jaegermann, "Compressed sensing matrices with independent columns and neighborly polytopes by random sampling," Dept. Math. Stat. Sci., Univ. Alberta, Edmonton, AB Canada, Tech. Rep., 2009.
19. A. Barvinok and I. Novik, "A centrally symmetric version of the cyclic polytope," Discrete Comput. Geometry, vol.39, no.1, pp. 76-99, 2008.
20. W. Xu and B. Hassibi, "Compressed sensing over the Grassmann manifold: A unified analytical framework," in Proc. 46th Annu. Allerton Conf. Commun. Control Comput., 2008, pp. 562-567.
21. 1-optimization in compressed sensing," 2009. [Online]. Available: arXiv:0907.3666
22. 1-constrained quadratic programming," IEEE Trans. Inf. Theory, vol.55, no.5, pp. 2183-2202, May 2009.
23. 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. (Pubitemid 33053488)
24. 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. (Pubitemid 35032680)
25. R. Gribonval and M. Nielsen, "Sparse representations in unions of bases," IEEE Trans. Inf. Theory, vol.49, no.12, pp. 3320-3325, Dec. 2003.
26. 1 minimization," Proc. Nat. Acad. Sci. USA, vol.100, no.5, pp. 2197-2202, 2003. (Pubitemid 36297476)
27. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol.50, no.10, pp. 2231-2242, Oct. 2004.
28. E. J. Cand̀es, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inf. Theory, vol.52, no.2, pp. 489-509, Feb. 2006. (Pubitemid 43174093)
29. 1-norm near-solution approximates the sparsest near-solution," Commun. Pure Appl. Math., vol.59, no.7, pp. 907-934, 2006.
30. E. J. Candes and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol.51, no.12, pp. 4203-4215, Dec. 2005. (Pubitemid 41800353)
31. M. Rudelson and R. Vershynin, "On sparse reconstruction from Fourier and Gaussian measurements," Commun. Pure Appl. Math., vol.61, no.8, pp. 1025-1045, 2008.
32. J. D. Blanchard, C. Cartis, and J. Tanner, "Compressed sensing: How sharp is the restricted isometry property," SIAM Rev., to be published.
33. D. L. Donoho, Y. Tsaig, I. Drori, and J.-L. Stark, "Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit," Dept. Stat., Stanford Univ., Stanford, CA, Tech. Rep. 2006-02, 2008.
34. 1-norm minimization problems when the solution may be sparse," IEEE. Trans. Inf. Theory, vol.54, no.11, pp. 4789-4812, Nov. 2008.
35. A. Maleki and D. L. Donoho, "Optimally tuned iterative reconstruction algorithms for compressed sensing," IEEE J. Sel. Topics Signal Process., vol.4, no.2, pp. 330-341, Apr. 2010.
36. D. Needell and J. Tropp, "Cosamp: Iterative signal recovery from incomplete and inaccurate samples," Appl. Comput. Harmon. Anal., vol.26, no.3, pp. 301-321, 2009.
37. W. Dai and O. Milenkovic, "Subspace pursuit for compressive sensing signal reconstruction," IEEE Trans. Inf. Theory, vol.55, no.5, pp. 2230-2249, May 2009.
38. T. Blumensath and M. E. Davies, "Iterative hard thresholding for compressed sensing," Appl. Comput. Harmon. Anal., vol.27, no.3, pp. 265-274, 2009.
39. S. Jafarpour, W. Xu, B. Hassibi, and R. Calderbank, "Efficient and robust compressed sensing using high-quality expander graphs," 2008. [Online]. Available: arXiv:0806.3802v1
40. R. Berinde, A. C. Gilbert, P. Indyk, H. Karloff, and M. J. Strauss, "Combining geometry and combinatorics: A unified approach to sparse signal recovery," 2008. [Online]. Available: arXiv:0804.4666v1
41. G. Obozinski, M. J. Wainwright, and M. I. Jordan, "Support union recovery in high-dimensional multivariate regression," Ann. Stat, to be published.
42. J. D. Blanchard, C. Cartis, J. Tanner, and A. Thompson, "Phase transitions for greedy sparse approximation algorithms," Appl. Comput. Harmon. Anal., 2009, submitted for publication.
43. q-minimization for 0 > q > 1," Appl. Comput. Harmon. Anal., vol.26, no.3, pp. 395-407, 2009.
44. Edinburgh Compressed Sensing. [Online]. Available: http://ecos.maths.ed. ac.uk/polytopes.shtml
45. D. L. Donoho, A. Maleki, and A. Montanari, "Message passing algorithms for compressed sensing," Proc. Nat. Acad. Sci. USA, vol.106, no.45, pp. 18914-18919, 2009.