Measure what should be measured: Progress and challenges in compressive sensing

IEEE Signal Processing Letters

Volumn 19, Issue 12, 2012, Pages 887-893

  Strohmer, Thomas ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPRESSIVE SENSING; GALILEO; MATRIX COMPLETION; NEW APPLICATIONS; RECENT PROGRESS; RESEARCH DIRECTIONS; SPARSE REPRESENTATION;

ELECTRICAL ENGINEERING; SIGNAL PROCESSING;

SIGNAL RECONSTRUCTION;

EID: 84869184588     PISSN: 10709908     EISSN: None     Source Type: Journal    
DOI: 10.1109/LSP.2012.2224518     Document Type: Article

References (55)

1. A. Kleinert, "Der messende Luchs. Zwei verbreitete Fehler in der Galilei-Literatur. (The Measuring Lynx. Two Widespread Mistakes in the Galileo Literature)," N.T.M. Zeitschrift für Geschichte der Wissenschaften, Technik und Medizin, vol. 17, pp. 199-206, 2009.
2. E. J. Candès, J. Romberg, and T. Tao, "Robust uncertaitny principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 489-509, 2006. (Pubitemid 43174093)
3. E. J. Candès and T. Tao, "Near-optimal signal recovery from random projections: Universal encoding strategies," IEEE Trans. Inf. Theory, vol. 52, pp. 5406-5425, 2006. (Pubitemid 46445381)
4. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, 2006.
5. M. Elad, "Sparse and redundation representation modeling-What next?," IEEE Signal Process. Lett., 2012.
6. R. Baraniuk, "Compressive sensing," IEEE Signal Process. Mag., vol. 24, no. 4, pp. 118-121, 2007.
7. E. Candès and M. Wakin, "An introduction to compressive sampling," IEEE Signal Process. Mag., vol. 25, no. 2, pp. 21-30, 2008.
8. S. Foucart and H. Rauhut, A Mathematical Introduction to Compressive Sensing. Berlin, Germany: Springer, to appear.
9. M. Elad, Sparse and Redundant Representations: From Theory to Applications in Signal and Image Processing. Berlin, Germany: Springer, 2010.
10. M. Lustig, D. Donoho, J. Santos, and J. Pauly, "Compressed sensing MRI," IEEE Signal Process. Mag., vol. 27, pp. 72-82, 2008.
11. M. Herman and T. Strohmer, "High-resolution radar via compressed sensing," IEEE Trans. Signal Process., vol. 57, no. 6, pp. 2275-2284, 2009.
12. J. Haupt, W. Bajwa, G. Raz, and R. Nowak, "Toeplitz compressed sensing matrices with applications to sparse channel estimation," IEEE Trans. Inf. Theory, vol. 56, no. 11, pp. 5862-5875, 2010.
13. G. Pfander, H. Rauhut, and J. Tropp, "The restricted isometry property for time-frequency structured random matrices," preprint 2011.
14. M. Duarte and Y. Eldar, "Structured compressed sensing: From theory to applications," IEEE Trans. Signal Process., vol. 59, no. 9, pp. 4053-4085, 2011.
15. H. Rauhut, "Compressive sensing and structured random matrices," in Theoretical Foundations and Numerical Methods for Sparse Recovery, M. Fornasier, Ed. Amsterdam, The Netherlands: deGruyter, 2010, vol. 9, Radon Series Comp. Appl. Math., pp. 1-92.
16. J. A. Tropp, "On the conditioning of random subdictionaries," Appl. Comput. Harmon. Anal., vol. 25, pp. 1-24, 2008.
17. E. Candès and Y. Plan, "Near-ideal model selection by minimization," Ann. Statist., vol. 37, no. 5A, pp. 2145-2177, 2009.
18. J. Bourgain, S. Dilworth, K. Ford, S. Konyagin, and D. Kutzarova, "Explicit constructions of RIP matrices and related problems," Duke Math. J., vol. 159, no. 1, pp. 145-185, 2011.
19. Y. Chi, A. Pezeshki, L. Scharf, and R. Calderbank, "Sensitivity to basis mismatch in compressed sensing," in Int. Conf. Acoustics, Speech, and Signal Processing (ICASSP), Dallas, TX, 2010.
20. P. Dragotti, M. Vetterli, and T. Blu, "Sampling moments and reconstructing signals of finite rate of innovation: Shannon meets Strang-Fix," IEEE Trans. Signal Process., vol. 55, no. 5, pp. 1741-1757, 2007. (Pubitemid 46691625)
21. A. Fannjiang and W. Liao, "Coherence pattern-guided compressive sensing with unresolved grids," SIAM J. Imaging Sci., vol. 5, pp. 179-202, 2012.
22. G. Tang, B. Bhaskar, P. Shah, and B. Recht, "Compressed sensing off the grid," Preprint [arvix:1207.6053], 2012.
23. E. Candès and C. Fernandez-Granda, "Towards a mathematical theory of super-resolution," Commun. Pure Appl. Math., to appear.
24. B. Adcock and A. Hansen, Generalized Sampling and Infinite-Dimensional Compressed Sensing DAMTP Tech. Rep. 2011/NA12, 2011.
25. R. Baraniuk, V. Cevher, M. Duarte, and C. Hedge, "Model-based compresssive sensing," IEEE Trans. Inf. Theory, vol. 56, no. 4, pp. 1982-2001, 2010.
26. Y. Eldar, P. Kuppinger, and H. Bölcskei, "Block-sparse signals: Uncertainty relations and efficient recovery," IEEE Trans. Signal Process., vol. 58, no. 6, pp. 3042-3054, 2010.
27. G. Yu, G. Sapiro, and S. Mallat, "Solving inverse problems with piece-wise linear estimators: From Gaussian mixture models to structured sparsity," IEEE Trans. Image Process., vol. 21, no. 5, pp. 2481-2499, 2012.
28. B. Recht, M. Fazel, and P. Parrilo, "Guaranteed minimum rank solutions of matrix equations via nuclear norm minimization," SIAM Rev., to be published.
29. E. Candès and B. Recht, "Exact matrix completion via convex optimization," Found. Comput. Math., vol. 9, no. 6, pp. 717-772, 2009.
30. S. Oymak, K. Mohan, M. Fazel, and B. Hassibi, "A simplified approach to recovery conditions for low rank matrices," preprint [arXiv:1103. 1178], 2011.
31. M. Golbabaee and P. Vandergheynst, "Joint trace/TV norm minimization: A new efficient approach for spectral compressive imaging," in IEEE Int. Conf. Image Processing (ICIP), 2012.
32. E. Candès and M. Soltanolkotabi, "Discussion of "latent variable graphical model selection via convex optimization"," Ann. Statist., to appear.
33. A. Waters, A. Sankaranarayanan, and R. Baraniuk, "SpaRCS: Recovering low-rank and sparse matrices from compressive measurements," in Neural Information Processing Systems (NIPS), Granada, Spain, 2011.
34. V. Chandrasekaran, B. Recht, P. Parrilo, and A. Willsky, "The convex geometry of linear inverse problems," Found. Comput. Math., to appear.
35. Y. Wu and S. Verdú, "Rényi information dimension: Fundamental limits of almost lossless analog compression," IEEE Trans. Inf. Theory, vol. 56, pp. 3721-3748, 2010.
36. D. Donoho, A. Javanmard, and A. Montanari, "Information-theoreti- cally optimal compressed sensing via spatial coupling and approximate message passing," preprint [arXiv:1112.0708], 2011.
37. Y. Wu and S. Verdú, "Optimal phase transitions in compressed sensing," preprint [arXiv:1111.6822], 2012.
38. M. Klibanov, P. Sacks, and A. Tikhonravov, "The phase retrieval problem," Inv. Probl., vol. 11, pp. 1-28, 1995.
39. E. Candès, T. Strohmer, and V. Voroninski, "Phaselift: Exact and stable signal recovery from magnitude measurements via convex programming," Commun. Pure Appl. Math., to appear.
40. E. Candès and X. Li, "Solving quadratic equations via PhaseLift when there are about as many equations as unknowns," preprint [arXiv:1208. 6247], 2012.
41. W. Chan, M. Moravec, R. Baraniuk, and D. Mittleman, "Terahertz imaging with compressed sensing and phase retrieval," Opt. Lett., vol. 33, no. 9, pp. 974-976, 2008.
42. H. Ohlsson, A. Yang, R. Dong, and S. Sastry, "Compressive phase retrieval from squared output measurements via semidefinite programming," preprint [arxiv:1111.6323v3], 2012.
43. L. Jacques, J. Laska, P. Boufounos, and R. Baraniuk, "Robust 1-bit compressive sensing via binary stable embeddings of sparse vectors," Preprint 2011.
44. Y. Plan and R. Vershynin, "One-bit compressed sensing by linear programming," preprint 2011.
45. M. A. T. Figueiredo, R. D. Nowak, and S. Wright, "Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems," IEEE J. Sel. Topics Signal Process., vol. 1, no. 4, pp. 586-598, 2007.
46. E. Hale, W. Yin, and Y. Zhang, "Fixed-point continuation for -minimization: Methodology and convergence," SIAM J. Optim., vol. 19, no. 3, pp. 1107-1130, 2008.
47. M. Burger, M. Moeller, M. Benning, and S. Osher, An Adaptive Inverse Scale Space Method for Compressed Sensing UCLA, Tech. Rep.11-08, 2011.
48. S. Ma, D. Goldfarb, and L. Chen, "Fixed point and bregman iterative methods for matrix rank minimization," Math. Progr., vol. 128, no. 1-2, pp. 321-353, 2011.
49. I. Daubechies, M. Defrise, and C. De Mol, "An iterative thresholding algorithm for linear inverse problems with a sparsity constraint," Commun. Pure Appl. Math., vol. 57, no. 11, pp. 1413-1457, 2004. (Pubitemid 39427442)
50. M. Fornasier and H. Rauhut, "Iterative thresholding algorithms," Appl. Comput. Harmon. Anal., vol. 25, no. 2, pp. 187-208, 2008.
51. A. Beck and M. Teboulle, "A fast iterative shrinkage-thresholding algorithm for linear inverse problems," SIAM J. Imag. Sci., vol. 2, no. 1, pp. 183-202, 2009.
52. D. Donoho, A. Maleki, and A. Montanari, "Message-passing algorithms for compressed sensing," Proc. Nat. Acad. Sci. (PNAS), vol. 106, no. 45, pp. 18914-18919, 2009.
53. S. Som and P. Schniter, "Compressive imaging using approximate message passing and a Markov-tree prior," IEEE Trans. Signal Process., vol. 60, no. 7, pp. 3439-3448, 2012.
54. [Online]. Available: https://sites.google.com/site/igorcarron2/com- pressedsensinghardware
55. R. Baraniuk, "More is less. Signal processing and the data deluge," Science, vol. 331, p. 717, 2011.