Optimally tuned iterative reconstruction algorithms for compressed sensing

IEEE Journal on Selected Topics in Signal Processing

Volumn 4, Issue 2, 2010, Pages 330-341

  Maleki, Arian ^a   Donoho, David L ^b  

^a Stanford University   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Compressed sensing; Iterative algorithms; Phase transition; Random matrices; Thresholding

Indexed keywords

COMPRESSED SENSING; ITERATIVE ALGORITHM; ITERATIVE ALGORITHMS; RANDOM MATRICES; THRESHOLDING;

ALGORITHMS; ITERATIVE METHODS; LINEAR SYSTEMS; MATRIX ALGEBRA; SIGNAL RECONSTRUCTION; TUNING;

PHASE TRANSITIONS;

EID: 77949685085     PISSN: 19324553     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSTSP.2009.2039176     Document Type: Article

References (53)

1. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM J. Sci. Comput., vol.20, pp. 33-61, 1998.
2. D. L. Donoho, M. Elad, and V. Temlyakov, "Stable recovery of sparse overcomplete representations in the presence of noise," IEEE Trans. Inf. Theory, vol.52, no.1, pp. 6-18, Jan. 2006.
3. J. A. Tropp, "Just relax: Convex programming methods for identifying sparse signals," IEEE Trans. Inf. Theory, vol.51, no.3, pp. 1030-1051, Mar. 2006.
4. B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani, "Least angle regression," Ann. Statist., vol.32, pp. 407-499, 2004.
5. S. J. Kim, K. Koh, M. Lustig, S. Boyd, and D. Gorinevsky, "A method for large-scale l1-regularized least squares," IEEE J. Sel. Topics Signal Process., vol.1, no.6, pp. 606-617, Dec. 2007.
6. D. L. Donoho and Y. Tsaig, "Fast solution of l-norm minimization problems when the solution may be sparse," IEEE Trans. Inf. Theory, vol.54, no.11, pp. 4789-4812, Nov. 2008.
7. S. Mallat and S. Zhang, "Matching pursuits with time-frequency dictionaries," IEEE Trans. Signal Process., vol.41, no.12, pp. 3397-4015, Dec. 1993.
8. Y. C. Pati, R. Rezaiifar, and P. S. Krishnaprasad, "Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition," in Proc. 27th Asilomar Conf. Signals, Syst., Comput., 1993.
9. J. A. Tropp and A. C. Gilbert, "Signal recovery from random measurements via orthogonal matching pursuit," IEEE Trans. Inf. Theory, vol.53, no.12, pp. 4655-4666, Dec. 2007.
10. D. L. Donoho, I. Drori, Y. Tsaig, and J. L. Starck, "Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit," 2006, Stanford Univ. Statist. Dept. Tech. Rep..
11. S. Sardy, A. G. Bruce, and P. Tseng, "Block coordinate relaxation methods for nonparametric wavelet denoising," J. Comput. Graphical Statist., vol.9, pp. 361-379, 2000.
12. I. Daubechies, M. Defrise, and C. D. Mol, "An iterative thresholding algorithm for linear inverse problems with a sparsity constraint," Commun. Pure Appl. Math., vol.75, pp. 1412-1457, 2004.
13. J. L. Starck, M. Elad, and D. L. Donoho, "Redundant multiscale transforms and their application for morphological component analysis," J. Adv. Imaging Electron Phys., vol.132, pp. 287-348, 2004.
14. J. L. Starck, M. Elad, and D. L. Donoho, "Image decomposition via the combination of sparse representations and a variational approach," IEEE Trans. Image Process., vol.14, no.10, pp. 1570-1582, Oct. 2005.
15. M. Elad, J. L. Starck, P. Querre, and D. L. Donoho, "Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)," Appl. Comput. Harmonic Anal., vol.19, pp. 340-358, Nov. 2005.
16. K. K. Herrity, A. C. Gilbert, and J. A. Tropp, "Sparse approximation via iterative thresholding," in Proc. ICASSP, May 2006, vol.3, pp. 624-627.
17. M. Elad, B. Matalon, J. Shtok, and M. Zibulevsky, "A wide-angle view at iterated shrinkage algorithms," in Proc. SPIE (Wavelet XII), Aug. 2007.
18. T. Blumensath and M. E. Davies, "Iterative thresholding for sparse approximations," J. Fourier Anal. Applicat., Special Iss. Sparsity, vol.14, no.5, pp. 629-654, 2008.
19. M. Fornasier and H. Rauhut, "Iterative thresholding algorithms," Appl. Comput. Harmonic Anal., vol.25, no.2, pp. 187-208, 2008.
20. D. Needell and J. A. Tropp, "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples," Appl. Comput. Harmonic Anal., vol.26, no.3, pp. 301-321, 2008.
21. T. Blumensath and M. E. Davies, "How to use the iterative hard thresholding algorithm," in Proc. SPARS, 2009.
22. T. Blumensath and M. E. Davies, "Iterative hard thresholding for compressed sensing," Appl. Comput. Harmonic Anal., vol.27, no.3, pp. 265-274, 2009.
23. D. Needell and R. Vershynin, "Signal recovery from incomplete and inaccurate measurements via regularized orthogonal matching pursuit," Found. Comput. Math., vol.9, no.3, pp. 317-334, Jun. 2009.
24. 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.
25. P. L. Combettes and V. R. Wajs, "Signal recovery by proximal forward- backward splitting," Multiscale Modeling Simul., vol.4, no.4, pp. 1168-1200, 2005.
26. W. Yin, S. Osher, D. Goldfarb, and J. Darbon, "Bregman iterative algorithms for l -minimization with applications to compressed sensing," SIAM J. Imaging Sci., vol.1, no.1, pp. 143-168, 2008.
27. I. Gorodnitsky and B. D. Rao, "Sparse signal reconstruction from limited data using FOCUSS: A re-weighted minimum norm algorithm," IEEE Trans. Signal Process., vol.45, no.3, pp. 600-616, Mar. 1997.
28. J. Fan and R. Li, "Variable selection via nonconcave penalized likelihood and its oracle properties," J. Amer. Statist. Assoc., vol.96, no.456, pp. 1348-1360, 2001.
29. R. Chartrand, "Exact reconstructions of sparse signals via nonconvex minimization," IEEE Signal Process. Lett., vol.14, no.10, pp. 707-710, Oct. 2007.
30. A. C. Gilbert, M. J. Strauss, J. A. Tropp, and R. Vershynin, "One sketch for all: Fast algorithms for compressed sensing," in Proc. STOC, 2007, pp. 237-246.
31. M. Lustig, D. L. Donoho, and J. Pauly, "Sparse MRI: The application of compressed sensing for rapid MR imaging," Magn. Resonance . Med., vol.58, pp. 1182-1195, Dec. 2007.
32. J. Bobin, J. L. Starck, and R. Ottensamer, "Compressed sensing in astronomy," IEEE J. Sel. Topics Signal Process., vol.2, no.5, pp. 718-726, May 2008.
33. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol.52, no.4, pp. 489-509, Apr. 2006.
34. E. Candès, 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.
35. J. Bobin, J. L. Starck, J. Fadili, Y. Moudden, and D. L. Donoho, "Morphological component analysis: An adaptive thresholding strategy," IEEE Trans. Image Process., vol.16, no.11, pp. 2675-2681, Nov. 2007.
36. K. Schnass and P. Vandergheynst, "Average performance analysis for thresholding," IEEE Signal Process. Lett., vol.14, no.11, pp. 828-831, Nov. 2007.
37. D. L. Donoho, "High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension," Discrete Comput. Geometry, vol.35, no.4, pp. 617-652, 2006.
38. D. L. Donoho and J. Tanner, "Counting faces of randomly projected polytopes when the projection radically lowers dimension," J. Amer. Math. Soc., vol.22, pp. 1-53, 2009.
39. D. L. Donoho and J. Tanner, "Precise undersampling theorems," IEEE Trans. Inf. Theory, submitted for publication.
40. D. L. Donoho and J. Tanner, "Neighborliness of randomly-projected simplices in high dimensions," Proc. National Acad. Sci., vol.102, no.27, pp. 9452-9457, 2005.
41. D. L. Donoho and J. Tanner, "Counting the faces of randomly projected hypercubes and orthants with applications," Discrete Comput. Geometry, to be published.
42. R. Berinde, A. C. Gilbert, P. Indyk, H. Karloff, and M. J. Strauss, "Combining geometry with combinatorics: A unified approach to sparse signal recovery," in Proc Allerton Conf. Commun., Control, Comput.., 2008, .
43. E. Candès, "The restricted isometry property and its implications for compressed sensing," Compte Rendus de l'Academie des Sci., vol.346, pp. 589-592, 2008.
44. J. D. Blanchard, C. Cartis, and J. Tanner, The restricted isometry property and- -regularization: Phase transitions for sparse approximation Univ. of Edinburgh, Dept. of Math., Tech. Rep., 2008.
45. D. L. Donoho and J. Tanner, "Observed universality of phase transitions in high-dimensional geometry, with applications in modern signal processing and data analysis," Philosophical Trans. R. Soc. A, vol.367, no.1906, pp. 4273-4293, 2009.
46. M. Figueiredo, R. 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, Aug. 2007.
47. E. van den Berg and M. P. Friedlander, "Probing the pareto frontier for basis pursuit solutions," SIAM J. Sci. Comput., vol.31, no.2, pp. 890-912, 2008.
48. S. Wright, R. Nowak, and M. Figueiredo, "Sparse reconstruction by separable approximation," in Proc. ICASSP, 2009.
49. [Online]. Available: http://www.frvt.org/FRGC/
50. [Online]. Available: http://www.itl.nist.gov/iad/894.03/fing/fing.html/
51. [Online]. Available: http://predictioncenter.org/
52. D. Haussler, Personal Communication..
53. D. L. Donoho, A. Maleki, I. U. Rahman, M. Shahram, and V. Stodden, "Reproducible research in computational harmonic analysis," Comput. Sci. Eng., vol.11, pp. 8-18, Jan./Feb. 2009.