Recovery of sparse signals via generalized orthogonal matching pursuit: A new analysis

IEEE Transactions on Signal Processing

Volumn 64, Issue 4, 2016, Pages 1076-1089

  Wang, Jian ^a   Kwon, Suhyuk ^b   Li, Ping ^c   Shim, Byonghyo ^d  

^a NANJING UNIVERSITY OF INFORMATION SCIENCE AND TECHNOLOGY   (China)

^b Samsung Display   (South Korea)

^c RUTGERS UNIVERSITY   (United States)

^d Seoul National University   (South Korea)

Author keywords

Compressed Sensing (CS); Generalized Orthogonal Matching Pursuit (gOMP); Mean Square Error (MSE); Restricted Isometry Property (RIP); sparse recovery; stability

Indexed keywords

COMPRESSED SENSING; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; MATRIX ALGEBRA; MEAN SQUARE ERROR;

COMPRESSIVE SENSING; GENERALIZED ORTHOGONAL; NOISY MEASUREMENTS; ORTHOGONAL MATCHING PURSUIT; RANDOM MEASUREMENT; RECOVERY PERFORMANCE; RESTRICTED ISOMETRY PROPERTIES (RIP); SPARSE RECOVERY;

RECOVERY;

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

References (40)

1. Y. C. Pati, R. Rezaiifar, and P. S. Krishnaprasad, "Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition," in Proc. 27th Annu. Asilomar Conf. Signals, Systems, Computers, Pacific Grove, CA, Nov. 1993, vol. 1, pp. 40-44.
2. S. G. Mallat and Z. Zhang, "Matching pursuits with time-frequency dictionaries," IEEE Trans. Signal Process., vol. 41, no. 12, pp. 3397-3415, Dec. 1993.
3. 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.
4. M. A. Davenport and M. B. Wakin, "Analysis of orthogonal matching pursuit using the restricted isometry property," IEEE Trans. Inf. Theory, vol. 56, no. 9, pp. 4395-4401, Sep. 2010.
5. T. T. Cai and L. Wang, "Orthogonal matching pursuit for sparse signal recovery with noise," IEEE Trans. Inf. Theory, vol. 57, no. 7, pp. 4680-4688, Jul. 2011.
6. J. Wang and B. Shim, "On the recovery limit of sparse signals using orthogonal matching pursuit," IEEE Trans. Signal Process., vol. 60, no. 9, pp. 4973-4976, Sep. 2012.
7. J. Ding, L. Chen, and Y. Gu, "Perturbation analysis of orthogonal matching pursuit," IEEE Trans. Signal Process., vol. 61, no. 2, pp. 398-410, Jan. 2013.
8. S. Kwon, J. Wang, and B. Shim, "Multipath matching pursuit," IEEE Trans. Inf. Theory, vol. 60, no. 5, pp. 2986-3001, May 2014.
9. J. Wang, "Support recovery with orthogonal matching pursuit in the presence of noise," IEEE Trans. Signal Process., vol. 63, no. 21, pp. 5868-5877, Nov. 2015.
10. E. D. Livshits, "On the efficiency of the orthogonal matching pursuit in compressed sensing," Sbornik: Mathematics, vol. 203, no. 2, p. 183, 2012.
11. T. Zhang, "Sparse recovery with orthogonal matching pursuit under RIP," IEEE Trans. Inf. Theory, vol. 57, no. 9, pp. 6215-6221, Sep. 2011.
12. S. Foucart, "Stability and robustness of weak orthogonal matching pursuits," in Proc. Recent Adv. Harmon. Anal. Appl., 2013, pp. 395-405.
13. D. L. Donoho, I. Drori, Y. Tsaig, and J. L. Starck, "Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit," IEEE Trans. Inf. Theory, vol. 58, no. 2, pp. 1094-1121, Feb. 2012.
14. D. Needell and R. Vershynin, "Signal recovery from incomplete and inaccurate measurements via regularized orthogonal matching pursuit," IEEE J. Sel. Topics Signal Process., vol. 4, no. 2, pp. 310-316, Apr. 2010.
15. D. Needell and J. A. Tropp, "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples," Appl. Computational Harmonic Analysis, vol. 26, no. 3, pp. 301-321, Mar. 2009.
16. 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.
17. J. Wang, S. Kwon, and B. Shim, "Generalized orthogonal matching pursuit," IEEE Trans. Signal Process., vol. 60, no. 12, pp. 6202-6216, Dec. 2012.
18. E. Liu and V. N. Temlyakov, "The orthogonal super greedy algorithm and applications in compressed sensing," IEEE Trans. Inf. Theory, vol. 58, no. 4, pp. 2040-2047, Apr. 2012.
19. E. Liu and V. N. Temlyakov, "Super greedy type algorithms," Adv. Comput. Math., vol. 37, no. 4, pp. 493-504, 2012.
20. S. Huang and J. Zhu, "Recovery of sparse signals using OMP and its variants: Convergence analysis based on RIP," Inverse Problems, vol. 27, no. 3, p. 035003, 2011.
21. R. Maleh, "Improved rip analysis of orthogonal matching pursuit," arXiv preprint arXiv:1102.4311, 2011.
22. S. Satpathi, R. L. Das, and M. Chakraborty, "Improving the bound on the RIP constant in generalized orthogonal matching pursuit," IEEE Signal Process. Lett., vol. 20, no. 11, pp. 1074-1077, Nov. 2013.
23. Y. Shen, B. Li, W. Pan, and J. Li, "Analysis of generalised orthogonal matching pursuit using restricted isometry constant," Electron. Lett., vol. 50, no. 14, pp. 1020-1022, Jul. 2014.
24. W. Dan, "Analysis of orthogonal multi-matching pursuit under restricted isometry property," Science China Mathematics, vol. 57, no. 10, pp. 2179-2188, Oct. 2014.
25. B. Li, Y. Shen, Z. Wu, and J. Li, "Sufficient conditions for generalized orthogonal matching pursuit in noisy case," Signal Process., vol. 108, pp. 111-123, Mar. 2015.
26. E. J. Candès and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005.
27. S. S. Chen, D. L. Donoho, and M. A. Saunders, "Atomic decomposition by basis pursuit," SIAM J. Sci. Comput., vol. 20, no. 1, pp. 33-61, 1998.
28. E. J. Candès, "The restricted isometry property and its implications for compressed sensing," Comptes Rendus Mathematique, Ser. I, vol. 346, no. 9-10, pp. 589-592, May 2008.
29. R. Baraniuk, M. Davenport, R. DeVore, and M. Wakin, "A simple proof of the restricted isometry property for random matrices," Construct. Approx., vol. 28, no. 3, pp. 253-263, Dec. 2008.
30. S. Rangan, V. Goyal, and A. K. Fletcher, "Asymptotic analysis of map estimation via the replica method and compressed sensing," in Proc. Adv. Neural Inf. Process. Syst., 2009, pp. 1545-1553.
31. D. Guo, D. Baron, and S. Shamai, "A single-letter characterization of optimal noisy compressed sensing," in Proc. IEEE 47th Ann. Allerton Conf. Commun., Contr. Comp., Monticello, IL, Oct. 2009, pp. 52-59.
32. D. L. Donoho, A. Maleki, and A. Montanari, "Message-passing algorithms for compressed sensing," Proc. Nat. Acad. Sci., vol. 106, no. 45, pp. 18914-18919, Nov. 2009.
33. T. Blumensath and M. E. Davies, "Iterative hard thresholding for compressed sensing," Appl. Comput. Harmon. Anal., vol. 27, no. 3, pp. 265-274, Dec. 2009.
34. S. Foucart, "Hard thresholding pursuit: An algorithm for compressive sensing," SIAM J. Numer. Anal., vol. 49, no. 6, pp. 2543-2563, 2011.
35. X. Yuan and S. Yan, "Forward basis selection for sparse approximation over dictionary," in Proc. AISTATS, 2012, pp. 1377-1388.
36. X. Yuan and T. Zhang, "Truncated power method for sparse eigenvalue problems," J. Mach. Learn. Res., vol. 14, no. 1, pp. 899-925, Apr. 2013.
37. Y. Dong, P. Fan, and K. B. Letaief, "High-speed railway wireless communications: Efficiency versus fairness," IEEE Trans. Veh. Technol., vol. 63, no. 2, pp. 925-930, Feb. 2014.
38. S. Rangan, "Generalized approximate message passing for estimation with random linear mixing," in Proc. IEEE Int. Symp. Inf. Theory, Aug. 2011, pp. 2168-2172.
39. J. Vila and P. Schniter, "Expectation-maximization bernoulli-gaussian approximate message passing," in Proc. 45th Annu. Asilomar Conf. Signals, Systems, Computers, Pacific Grove, CA, USA, Nov. 2011, pp. 799-803.
40. Y. Nesterov and A. Nemirovskii, Interior-Point Polynomial Algorithms in Convex Programming. Philadelphia, PA, USA: SIAM, 1994.