Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices

Proceedings of the National Academy of Sciences of the United States of America

Volumn 110, Issue 4, 2013, Pages 1181-1186

  Monajemi, Hatef ^a   Jafarpour, Sina ^b   Gavish, Matan ^c   Donoho, David L ^c  

^a Stanford University   (United States)

^b Bina Technologies Inc   (United States)

^c STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; KERNEL METHOD; MONTE CARLO METHOD; PHASE TRANSITION; PRIORITY JOURNAL; PROBABILITY; PROCESS OPTIMIZATION; RANDOMIZATION;

EID: 84872876101     PISSN: 00278424     EISSN: 10916490     Source Type: Journal    
DOI: 10.1073/pnas.1219540110     Document Type: Article

References (45)

1. Donoho DL (2006) Compressed sensing. IEEE Trans Inf Theory 52(4):1289-1306.
2. Candès EJ, Tao T (2005) Decoding by linear programming. IEEE Trans Inf Theory 51(1): 4203-4215.
3. Donoho D, Tanner J (2009) Observed universality of phase transitions in highdimensional geometry, with implications for modern data analysis and signal processing. Philos Transact A Math Phys Eng Sci 367(1906):4273-4293.
4. Bayati M, Lelarge M, Montanari A (2012) Universality in polytope phase transitions and message passing algorithmsarXiv:1207.7321.
5. Beck A, Teboulle M (2009) Fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J Imaging Sci 2(1):183-202.
6. Donoho DL, Maleki A, Montanari A (2009) Message-passing algorithms for compressed sensing. Proc Natl Acad Sci USA 106(45):18914-18919.
7. Howard S, Calderbank R, Searle S (2008) Fast reconstruction algorithm for deterministic compressive sensing using second order reed-muller codes. Conference on Information Sciences and Systems (CISS) (IEEE, Piscataway, NJ), pp 11-15.
8. Tropp J (2008) On the conditioning of random subdictionaries. Appl Comput Harmon Anal 25(1):1-24.
9. Candès EJ, Plan Y (2009) Near-ideal model selection by l1 minimization. Ann Stat 37(5A):2145-2177.
10. Donoho D, Tanner J (2010) Counting the faces of randomly-projected hypercubes and orthants, with applications. Discrete Comput Geom 43(3):522-541.
11. Donoho DL, Stark PB (1989) Uncertainty principles and signal recovery. SIAM J Appl Math 49(3):906-931.
12. Donoho DL, Huo X (2001) Uncertainty principles and ideal atomic decomposition. IEEE Trans Inf Theory 47(7):2845-2862.
13. Tropp J (2008) On the linear independence of spikes and sines. J Fourier Anal Appl 14(5-6):838-858.
14. Strohmer T, Heath R (2003) Grassmannian frames with applications to coding and communication. Appl Comput Harmon Anal 14(3):257-275.
15. Jafarpour S (2011) Deterministic compressed sensing. PhD thesis (Princeton University, Princeton).
16. Bandeira A, Fickus M, Mixon D, Wong P (2012) The road to deterministic matrices with the restricted isometry property. arXiv:12021234.
17. Chen S, Donoho D, Saunders M (1999) Atomic decomposition by Basis Pursuit. SIAM J Sci Comput 20(1):33-61.
18. Boyd S, Vandenberghe L (2004) Convex Optimization (Cambridge Univ Press, Cambridge, United Kingdom).
19. Donoho D (2006) High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension. Discrete Comput Geom 35(4):617-652.
20. Donoho DL, Tanner J (2005) Neighborliness of randomly projected simplices in high dimensions. Proc Natl Acad Sci USA 102(27):9452-9457.
21. Donoho D, Tanner J (2009) Counting faces of randomly-projected polytopes when the projection radically lowers dimension. J Amer Math Soc 22(1):1-53.
22. Maleki A, Anitoriy L, Yang Z, Baraniuk R (2011) Asymptotic analysis of complex lasso via complex approximate message passing (camp)arXiv:11080477v1.
23. Grant M, Boyd S (2010) CVX: Matlab Software for Disciplined Convex Programming, Version 1.21. Available at http://cvxr.com/cvx. Accessed December 12, 2012.
24. Grant M, Boyd S, Ye Y (2006) Disciplined convex programming. Global Optimization: From Theory to Implementation, Nonconvex Optimization and Its Applications, eds Liberti L, Maculan N (Springer, New York), pp 155-210.
25. Grant M, Boyd S (2012) CVX Users' Guide for CVX Version 1.22. Available at http://cvxr.com/cvx/cvx-usrguide.pdf. Accessed December 12, 2012.
26. Friedlander M, Saunders M (2010) ASP: A Set of Matlab Functions for Solving Basis Pursuit-Type Problems. Available at http://www.cs.ubc.ca/~mpf/asp. Accessed December 14, 2012.
27. Friedlander M, Saunders M (2011) A Dual Active-Set Quadratic Programming Method for Finding Sparse Least-Squares Solutions, Department of Computer Science, University of British Columbia. Available at http://www.cs.ubc.ca/~mpf/ asp. Accessed December 15, 2012.
28. van den Berg E, Friedlander MP (2008) Probing the pareto frontier for basis pursuit solutions. SIAM J Sci Comput 31(4):890-912.
29. van den Berg E, Friedlander MP (2007) SPGL1: A Solver for Large-Scale Sparse Reconstruction. Available at http://www.cs.ubc.ca/labs/scl/spgl1. Accessed December 12, 2012.
30. Mosek APS (2012) Mosek Optimization Software. Available at http://www.mosek. com. Accessed December 12, 2012.
31. Andersen M, Vandeberghe L (2012) CVXOPT. Available at http://abel.ee.ucla.edu/cvxopt/index.html. Accessed December 27, 2012.
32. Monajemi H, Jafarpour S, Gavish, M {Stat 330/CME 362} Collaboration, Donoho DL (2012) Data for the article Deterministic Matrices Matching the Compressed Sensing Phase Transitions of Gaussian Random Matrices. Available at http://purl.stanford.edu/wp335yr5649. Accessed December 14, 2012.
33. Monajemi H, Jafarpour S, {Stat 330/CME 362} Collaboration, Gavish M, Donoho D (2012) RunMyCode Companion Website for Deterministic Matrices Matching the Compressed Sensing Phase Transitions of Gaussian Random Matrices. Available at http://www.runmycode.org/CompanionSite/Site190. Accessed December 27, 2012.
34. Donoho D, Tanner J (2010) Precise undersampling theorems. Proc IEEE 98(6):913-924.
35. Howard S, Calderbank A, Searle S (2008) A fast reconstruction algorithm for deterministic compressive sensing using second order reed-muller codes. Proceedings of 42nd Annual IEEE Conference on Information Sciences and Systems (IEEE, Piscataway NJ), pp 11-15.
36. Calderbank AR, Howard S, Jafarpour S (2010) Construction of a large class of deterministic matrices that satisfy a statistical restricted isometry property. IEEE J Sel Top Signal Process 4(2):358-374.
37. Bourgain J, Dilworth S, Ford K, Konyagin S, Kutzarova D (2011) Explicit constructions of RIP matrices and related problems. Duke Math J 159(1):145-185.
38. Bajwa W, Calderbank R, Jafarpour S (2010) Revisiting model selection and recovery of sparse signals using one-step thresholding. Proceedings of the 48th Annual Allerton Conference on Communication, Control, and Computing (IEEE Piscataway, NJ), pp 977-984.
39. Jafarpour S, Duarte MF, Calderbank AR (2012) Beyond worst-case reconstruction in deterministic compressed sensing. IEEE International Symposium on Information Theory (ISIT) (IEEE, Cambridge, MA), pp 1852-1856.
40. Bajwa W, Calderbank R, Jafarpour S (2010) Why Gabor frames? Two fundamental measures of coherence and their role in model selection. arXiv:1006.0719.
41. Grünbaum B (2003) Convex Polytopes, Graduate Texts in Mathematics, Vol 221 (Springer, New York), 2nd Ed.
42. Donoho DL, Tanner J (2005) Sparse nonnegative solution of underdetermined linear equations by linear programming. Proc Natl Acad Sci USA 102(27):9446-9451.
43. Coifman R, Meyer Y, Geschwind F (2001) Noiselets. Appl Comput Harmon Anal 10(1): 27-44.
44. Applebaum L, Howard S, Searle S, Calderbank R (2009) Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery. Appl Comput Harmon Anal 26(2):283-290.
45. Gurevich S, Hadani R, Sochen N (2008) The finite harmonic oscillator and its associated sequences. Proc Natl Acad Sci USA 105(29):9869-9873.