Sparse signal recovery with temporally correlated source vectors using sparse Bayesian learning

IEEE Journal on Selected Topics in Signal Processing

Volumn 5, Issue 5, 2011, Pages 912-926

  Zhang, Zhilin ^a   Rao, Bhaskar D ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Compressed sensing; multiple measurement vectors (MMV); sparse Bayesian learning (SBL); sparse signal recovery; temporal correlation

Indexed keywords

COMPRESSED SENSING; MULTIPLE MEASUREMENT VECTORS; SPARSE BAYESIAN LEARNING; SPARSE SIGNALS; TEMPORAL CORRELATIONS;

ALGORITHMS; CORRELATION METHODS; COST BENEFIT ANALYSIS; COST FUNCTIONS; SIGNAL RECONSTRUCTION;

RECOVERY;

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

References (61)

1. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, 2006.
2. E. J. Candes, 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. (Pubitemid 43174093)
3. R. G. Baraniuk, "Compressive sensing," IEEE Signal Process. Mag., vol. 24, no. 4, pp. 118-124, Jul. 2007.
4. M. Elad, Sparse and Redundant Representations: From Theory to Applications in Signal and Image Processing. New York: Springer, 2010.
5. I. F. 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. (Pubitemid 127765947)
6. D. L. Donoho and M. Elad, "Optimally sparse representation in general (nonorthogonal) dictionaries via minimization," PNAS, vol. 100, no. 5, pp. 2197-2202, 2003. (Pubitemid 36297476)
7. I. F. Gorodnitsky, J. S. George, and B. D. Rao, "Neuromagnetic source imaging with FOCUSS: A recursive weighted minimum norm algorithm," Electroencephalogr. Clinical Neurophysiol., vol. 95, pp. 231-251, 1995.
8. D. Malioutov, M. Cetin, and A. S. Willsky, "A sparse signal reconstruction perspective for source localization with sensor arrays," IEEE Trans. Signal Process., vol. 53, no. 8, pp. 3010-3022, Aug. 2005. (Pubitemid 41372811)
9. J. H. G. Ender, "On compressive sensing applied to radar," Signal Process., vol. 90, pp. 1402-1414, 2010.
10. U. Gamper, P. Boesiger, and S. Kozerke, "Compressed sensing in dynamic MRI," Magn. Reson. in Med., vol. 59, pp. 365-373, 2008. (Pubitemid 351220100)
11. B. D. Rao and K. Kreutz-Delgado, "Sparse solutions to linear inverse problems with multiple measurement vectors," in Proc. IEEE Digital Signal Processing Workshop, Bryce Canyon, UT, 1998.
12. S. F. Cotter, B. D. Rao, K. Engan, and K. Kreutz-Delgado, "Sparse solutions to linear inverse problems with multiple measurement vectors," IEEE Trans. Signal Process., vol. 53, no. 7, pp. 2477-2488, Jul. 2005. (Pubitemid 41174440)
13. Y. C. Eldar and M. Mishali, "Robust recovery of signals from a structured union of subspaces," IEEE Trans. Inf. Theory, vol. 55, no. 11, pp. 5302-5316, Nov. 2009.
14. Y. C. Eldar and H. Rauhut, "Average case analysis of multichannel sparse recovery using convex relaxation," IEEE Trans. Inf. Theory, vol. 56, no. 1, pp. 505-519, Jan. 2010.
15. Y. Jin and B. D. Rao, "Insights into the stable recovery of sparse solutions in overcomplete representations using network information theory," in Proc. 33th Int. Conf. Acoust., Speech, Signal Process. (ICASSP'08), Las Vegas, NV, pp. 3921-3924.
16. G. Tang and A. Nehorai, "Performance analysis for sparse support recovery," IEEE Trans. Inf. Theory, vol. 56, no. 3, pp. 1383-1399, Mar. 2010.
17. Y. Jin and B. D. Rao, "On the role of the properties of the nonzero entries on sparse signal recovery," in Proc. 44th Asilomar Conf. Signals, Syst., Comput., 2010, pp. 753-757.
18. C. M. Michel et al., Electrical Neuroimaging, 1st ed. Cambridge, U.K.: Cambridge Univ. Press, 2009.
19. S. F. Cotter, "Multiple snapshot matching pursuit for direction of arrival (DOA) estimation," in Proc. 15th Eur. Signal Process. Conf. (EUSIPCO' 07), Poznan, Poland, 2007.
20. J. A. Tropp, A. C. Gilbert, and M. J. Strauss, "Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit," Signal Process., vol. 86, pp. 572-588, 2006. (Pubitemid 43106572)
21. K. Lee and Y. Bresler, "Subspace-augmented MUSIC for joint sparse recovery," 2011 [Online]. Available: http://arxiv.org/abs/1004.3071v3
22. S. Negahban and M. J.Wainwright, "Simultaneous support recovery in high dimensions: Benefits and perils of block-regularization," IEEE Trans. Inf. Theory, vol. 57, no. 6, pp. 3841-3863, Jun. 2011.
23. J. A. Tropp, "Algorithms for simultaneous sparse approximation. Part II: Convex relaxation," Signal Process., vol. 86, pp. 589-602, 2006. (Pubitemid 43106573)
24. F. R. Bach, "Consistency of the group lasso and multiple kernel learning," J. Mach. Learn. Res., vol. 9, pp. 1179-1225, 2008.
25. D.Wipf and S. Nagarajan, "Iterative reweighted-and-methods for finding sparse solutions," IEEE J. Sel. Topics Signal Process., vol. 4, no. 2, pp. 317-329, Apr. 2010.
26. D. P.Wipf and B. D. Rao, "An empirical Bayesian strategy for solving the simultaneous sparse approximation problem," IEEE Trans. Signal Process., vol. 55, no. 7, pp. 3704-3716, Jul. 2007. (Pubitemid 47018850)
27. D. Wipf, B. D. Rao, and S. Nagarajan, "Latent variable Bayesian models for promoting sparsity," IEEE Trans. Inf. Theory, 2010, to be published.
28. M. E. Tipping, "Sparse Bayesian learning and the relevance vector machine," J. Mach. Learn. Res., vol. 1, pp. 211-244, 2001. (Pubitemid 33687203)
29. A. C. Faul and M. E. Tipping, "Analysis of sparse Bayesian learning," in Advances in Neural Information Processing Systems. New York: Springer, 2002, vol. 14, pp. 383-389.
30. D. P. Wipf and B. D. Rao, "Sparse Bayesian learning for basis selection," IEEE Trans. Signal Process., vol. 52, no. 8, pp. 2153-2164, Aug. 2004.
31. Z. Zhang and B. D. Rao, "Sparse signal recovery in the presence of correlated multiple measurement vectors," in Proc. 35th Int. Conf. Acoust., Speech, Signal Process. (ICASSP 2010), Dallas, TX, 2010, pp. 3986-3989.
32. Z. Zhang and B. D. Rao, "Iterative reweighted algorithms for sparse signal recovery with temporally correlated source vectors," in Proc. 36th Int. Conf. Acoust., Speech, Signal Process. (ICASSP'11), Prague, The Czech Republic, 2011.
33. Z. Zhang and B. D. Rao, "Exploiting correlation in sparse signal recovery problems: Multiple measurement vectors, block sparsity, and time-varying sparsity," in Proc. ICML'11 Workshop Structured Sparsity: Learning and Inference, Washington, DC, 2011.
34. K. Qiu and A. Dogandzic, "Variance-component based sparse signal reconstruction and model selection," IEEE Trans. Signal Process., vol. 58, no. 6, pp. 2935-2952, Jun. 2010.
35. S. Ji, Y. Xue, and L. Carin, "Bayesian compressive sensing," IEEE Trans. Signal Process., vol. 56, no. 6, pp. 2346-2356, Jun. 2008. (Pubitemid 351795888)
36. G. Tzagkarakis, D. Milioris, and P. Tsakalides, "Multiple- measurement Bayesian compressed sensing using GSM priors for DOA estimation," in Proc. 35th Int. Conf. Acoust., Speech, Signal Process. (ICASSP 2010), Dallas, TX, 2010, pp. 2610-2613.
37. R. Tibshirani, "Regression shrinkage and selection via the Lasso," J. R. Statist. Soc. B, vol. 58, no. 1, pp. 267-288, 1996.
38. 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. (Pubitemid 128689501)
39. E. J. Candes, M. B. Wakin, and S. P. Boyd, "Enhancing sparsity by reweighted-minimization," J. Fourier Anal. Appl., vol. 14, pp. 877-905, 2008.
40. R. G. Baraniuk, V. Cevher,M. F. Duarte, and C. Hegde, "Model-based compressive sensing," IEEE Trans. Inf. Theory, vol. 56, no. 4, pp. 1982-2001, Apr. 2010.
41. M. Yuan and Y. Lin, "Model selection and estimation in regression with grouped variables," J. R. Statist. Soc. B, vol. 68, pp. 49-67, 2006. (Pubitemid 43415335)
42. P. Zhao, G. Rocha, and B. Yu, "The composite absolute penalties family for grouped and hierarchical variable selection," Ann. Statist., vol. 37, no. 6A, pp. 3468-3497, 2009.
43. R. Zdunek and A. Cichocki, "Improved M-FOCUSS algorithm with overlapping blocks for locally smooth sparse signals," IEEE Trans. Signal Process., vol. 56, no. 10, pp. 4752-4761, Oct. 2008.
44. Y. Cho and L. K. Saul, "Sparse decomposition of mixed audio signals by basis pursuit with autoregressive models," in Proc. 34th Int. Conf. Acoust., Speech, Signal Process. (ICASSP'09), Taipei, pp. 1705-1708.
45. A. Hyvärinen, "Optimal approximation of signal priors," Neural Comput., vol. 20, no. 12, pp. 3087-3110, 2008.
46. G. C. Cawley and N. L. C. Talbot, "Preventing over-fitting during model selection via Bayesian regularization of the hyper-parameters," J. Mach. Learn. Res., vol. 8, pp. 841-861, 2007. (Pubitemid 46677044)
47. I. Guyon, A. Saffari, G. Dror, and G. Cawley, "Model selection: Beyond the Bayesian/frequentist divide," J. Mach. Learn. Res., vol. 11, pp. 61-87, 2010.
48. M. Elad, "Sparse representations are most likely to be the sparsest possible," EUROSIP J. Appl. Signal Process., vol. 2006, pp. 1-12, 2006.
49. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.
50. D. G. Luenberger, Linear and Nonlinear Programming, 2nd ed. New York: Springer, 2005.
51. D. L. Donoho, "For most large underdetermined systems of linear equations the minimal norm solution is also the sparsest solution," Stanford Univ., Tech. Rep., 2004.
52. M. M. Hyder and K. Mahata, "A robust algorithm for joint-sparse recovery," IEEE Signal Process. Lett., vol. 16, no. 12, pp. 1091-1094, Dec. 2009.
53. D. Wipf et al., "Robust Bayesian estimation of the location, orientation, and time course of multiple correlated neural sources using MEG," NeuroImage, vol. 49, pp. 641-655, 2010.
54. D. Wipf and S. Nagarajan, "A new view of automatic relevance determination," in Advances in Neural Information Processing Systems, J. Platt, D. Koller, Y. Singer, and S. Roweis, Eds. Cambridge, MA: MIT Press, 2008, vol. 20, pp. 1625-1632.
55. B. D. Rao, K. Engan, S. F. Cotter, J. Palmer, and K. Kreutz-Delgado, "Subset selection in noise based on diversity measure minimization," IEEE Trans. Signal Process., vol. 51, no. 3, pp. 760-770, Mar. 2003.
56. S. Becker, J. Bobin, and E. J. Candes, "NESTA: A fast and accurate first-order method for sparse recovery," SIAM J. Imag. Sci., vol. 4, no. 1, pp. 1-39, 2011.
57. E. T. Hale, W. Yin, and Y. Zhang, A fixed-point continuation method for regularized minimization with applications to compressed sensing Rice Univ., Houston, TX, 2007, CAAM Technical Report TR07-07.
58. J. Wright et al., "Robust face recognition via sparse representation," IEEE Trans. Pattern Anal. Mach. Intell., vol. 31, no. 2, pp. 210-227, Feb. 2009.
59. Y. C. Eldar, P. Kuppinger, and H. Bolcskei, "Block-sparse signals: Uncertainty relations and efficient recovery," IEEE Trans. Signal Process., vol. 58, no. 6, pp. 3042-3054, Jun. 2010.
60. N. Vaswani, "Kalman filtered compressed sensing," in Proc. 15th IEEE Int. Conf. Image Process. (ICIP'08), San Diego, CA, 2008, pp. 893-896.
61. J. Ziniel, L. C. Potter, and P. Schniter, "Tracking and smoothing of time-varying sparse signals via approximate belief propagation," in Proc. 44th Asilomar Conf. Signals, Syst., Comput., 2010, pp. 808-812.