Stagewise weak gradient pursuits

IEEE Transactions on Signal Processing

Volumn 57, Issue 11, 2009, Pages 4333-4346

  Blumensath, Thomas ^a   Davies, Mike E ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Compressed sensing; Gradient pursuit; Orthogonal matching pursuit; Sparse representations approximations; Stagewise selection; Weak matching pursuit

Indexed keywords

COMPRESSED SENSING; GRADIENT PURSUIT; ORTHOGONAL MATCHING PURSUIT; SPARSE REPRESENTATIONS/APPROXIMATIONS; STAGEWISE SELECTION; WEAK MATCHING PURSUIT;

DIFFERENTIAL EQUATIONS; INVERSE PROBLEMS; SIGNAL ANALYSIS; SIGNAL RECONSTRUCTION; STRATEGIC PLANNING;

SIGNAL PROCESSING;

EID: 70350489674     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2009.2025088     Document Type: Article

References (49)

1. M. E. Davies and T. Blumensath, "Faster & greedier: Algorithms for sparse reconstruction of large datasets," presented at the 3rd IEEE Int. Symp. Communications, Control, Signal Processing, St. Julians, Malta, Mar. 2008.
2. N : Analysis, synthesis and algorithms," IEEE Trans. Inf. Theory, vol. 44, no. 1, pp. 16-31, Jan. 1998.
3. C. Fevotte and S. Godsill, "Sparse linear regression in unions of bases via Bayesian variable selection," IEEE Signal Process. Lett., vol. 13, no. 7, pp. 441-444, Jul. 2006.
4. M. Davies and N. Mitianoudis, "A simple mixture model for sparse overcomplete ICA," in Proc. Inst. Electr. Eng. - Vis., Image, Signal Process., Aug. 2004, vol. 151, pp. 35-43.
5. 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, pp. 489-509, Feb. 2006.
6. G. Davis, "Adaptive nonlinear approximations," Ph.D. dissertation, New York Univ., New York, 1994.
7. B. K. Natarajan, "Sparse approximate solutions to linear systems," SIAM J. Comput., vol. 24, pp. 227-234, Apr. 1995.
8. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM J. Scientif. Comput., vol. 20, no. 1, pp. 33-61, 1998.
9. B. Efron, T. Hastie, I. Johnston, and R. Tibshirani, "Least angle regression," Ann. Statist., vol. 32, no. 2, pp. 407-499, 2004.
10. 1 -regularized least squares problems with applications in signal processing and statistics," IEEE J. Sel. Topics Signal Process., vol. 1, no. 4, pp. 606-617, Dec. 2007.
11. M. A. T. Figueiredo, R. D. Nowak, and S. J. 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-597, Dec. 2007.
12. J. Bioucas-Dias and M. Figueiredo, "A new TwIST: Two-step iterative shrinkage/thresholding algorithms for image restoration," IEEE Trans. on Image Process., vol. 16, no. 12, pp. 2992-3004, 2007.
13. E. van den Berg and M. P. Friedlander, "Probing the Pareto frontier for basis pursuit solutions," SIAM J. Scientif. Comput., vol. 31, no. 2, pp. 890-912, 2008.
14. R. Griesse and D. A. Lorenz, "A semismooth Newton method for Tikhonov functionals with sparsity constraints," Inverse Probl., vol. 24, no. 3, 2008.
15. J. F. Murray and K. Kreutz-Delgado, "An improved FOCUSS-based learning algorithm for solving sparse linear inverse problems," in Conf. Rec. 35th Asilomar Conf. Signals, Systems, Computers, 2001, pp. 347-351.
16. E. Candès, M.Wakin, and S. Boyd, "Enhancing sparsity by reweighted l1 minimization," California Instit. Technol., Pasadena, CA, 2007.
17. M. E. Tipping, "Sparse Bayesian learning and the relevance vector machine," J. Mach. Learn. Res., vol. 1, pp. 211-244, 2001.
18. D. Wipf and B. D. Rao, "Sparse Bayesian learning for basis selection," IEEE Trans. Signal Process., vol. 52, no. 8, pp. 2153-2164, Aug. 2004.
19. R. E. McCulloch and E. I. George, "Approaches for Bayesian variable selection," Statist. Sinica, vol. 7, no. 2, pp. 339-374, 1997.
20. R. E. McCulloch and E. I. George, "Variable selection via Gibbs sampling," J. Amer. Statist. Assoc., pp. 881-889, Sep. 1993.
21. J. Geweke, "Variable selection and model comparison in regression," in Bayesian Statistics 5, J.M. Bernardo, J. O. Berger, A. P. Dawid, and A. F. M. Smith, Eds. London, U.K.: Oxford Univ. Press, 1996.
22. S. Mallat and Z. Zhang, "Matching pursuits with time-frequency dictionaries," IEEE Trans. Signal Process., vol. 41, no. 12, pp. 3397-3415, Dec. 1993.
23. Y. C. Pati, R. Rezaifar, and P. S. Krishnaprasad, "Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition," presented at the 27th Asilomar Conf. Signals, Systems, Comput., Nov. 1993.
24. S. Chen, S. A. Billings, and W. Luo, "Orthogonal least squares methods and their application to nonlinear system identification," Int. J. Control, vol. 50, no. 5, pp. 1873-1896, 1989.
25. P. Vincent and Y. Bengio, "Kernel matching pursuit," Mach. Learn. vol. 48, pp. 169-191, 2002.
26. W. Dai and O. Milenkovic, Subspace Pursuit for Compressed Sensing: Closing the Gap Between Performance and Complexity, 2008, submitted for publication.
27. D. Needell and J. Tropp, "COSAMP: Iterative signal recovery from incomplete and inaccurate samples," Appl. Comput. Harmon. Anal., 2008, to be published.
28. T. Blumensath and M. Davies, "Iterative hard thresholding for compressed sensing," Appl. Comput. Harmon. Anal., 2009, to be published.
29. T. Blumensath and M. Davies, "Gradient pursuits," IEEE Trans. Signal Process., vol. 56, no. 6, pp. 2370-2382, Jun. 2008.
30. D. Donoho, Y. Tsaig, I. Drori, and J. Starck, "Sparse solutions of underdetermined linear equations by stagewise orthogonal matching pursuit," IEEE Trans. Inf. Theory, 2006 [Online]. Available: http://www-stat.stanford.edu/~donoho/Reports/2006/StOMP-20060403.pdf, submitted for publication
31. D. Needell and R. Vershynin, "Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit," Found. Comput. Math., vol. 9, no. 3, pp. 317-334, 2009.
32. D. Needell and R. Vershynin, "Signal recovery from incomplete and inaccurate measurements via regularized orthogonal matching pursuit," IEEE J. Sel. Topics Signal Process., 2008, to be published.
33. S. Mallat, A Wavelet Tour of Signal Processing. New York: Academic, 1999.
34. G. H. Golub and F. Van Loan, Matrix Computations, 3rd ed. Baltimore, MD: The Johns Hopkins Univ. Press, 1996.
35. E. J. Candès and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2004.
36. R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge, U.K.: Cambridge Univ. Press, 1985.
37. J. R. Shewchuk, "An Introduction to the conjugate gradient method without the agonizing pain," School of Computer Science, Carnegie Mellon Univ., Pittsburgh, PA, 1994.
38. H. Crowder and P. Wolfe, "Linear convergence of the conjugate gradient method," Numeric. Comput., vol. 16, no. 4, pp. 431-433, 1972.
39. M. Lustig, D. L. Donoho, and J. M. Pauly, "Sparse MRI: The application of compressed sensing for rapid MR imaging," Magn. Resonance Med. vol. 58, no. 6, pp. 1182-1195, Dec. 2007.
40. R. Gribonval and M. Nielsen, "Sparse decompositions in incoherent dictionaries," presented at the IEEE Int. Conf. Image Process. (ICIP), Barcelona, Spain, Sep. 2003.
41. J.-J. Fuchs, "On sparse representations in arbitrary redundant bases," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1341-1344, Jun. 2004.
42. J.-J. Fuchs, "Recovery of exact sparse representations in the presence of bounded noise," IEEE Trans. Inf. Theory, vol. 51, no. 10, pp. 3601-3608, Oct. 2005.
43. D. L. Donoho and M. Elad, "Optimally-sparse representation in general (nonorthogonal) dictionaries via l1 minimization," Proc. Nat. Acad. Sci., vol. 100, pp. 2197-2202, 2003.
44. D. L. Donoho, M. Elad, and V. Temlyakov, "Stable recovery of sparse overcomplete representations in the presence of noise," IEEE Trans. Inf. Theory, Feb. 2004.
45. D. Donoho, "Compressed sensing," IEEE Trans. on Information Theory vol. 52, no. 4, pp. 1289-1306, 2006.
46. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. 50, pp. 2231-2242, 2004.
47. J. A. Tropp and A. C. Gilbert, "Signal recovery from partial information via orthogonal matching pursuit," IEEE Trans. Inf. Theory, vol. 53, pp. 4655-4666, 2006.
48. R. Gribonval and P. Vandergheynst, "On the exponential convergence of matching pursuits in quasi-incoherent dictionaries," IEEE Trans. Inf. Theory, vol. 52, pp. 255-261, 2006.
49. E. Candès, "The restricted isometry property and its implications for compressed sensing," Compte Rendus de l'Academie des Sciences, Paris, France, Serie I, 346, 2008, pp. 589-592.