Efficient high-dimensional inference in the multiple measurement vector problem

IEEE Transactions on Signal Processing

Volumn 61, Issue 2, 2013, Pages 340-354

  Ziniel, Justin ^a   Schniter, Philip ^a  

^a Ohio State University   (United States)

Author keywords

Approximate message passing (AMP); belief propagation; compressed sensing; expectation maximization algorithms; joint sparsity; Kalman filters; multiple measurement vector problem; statistical signal processing

Indexed keywords

APPROXIMATE MESSAGE PASSING (AMP); BELIEF PROPAGATION; COMPRESSIVE SENSING; EXPECTATION-MAXIMIZATION ALGORITHMS; JOINT SPARSITY; MULTIPLE MEASUREMENT VECTORS; STATISTICAL SIGNAL PROCESSING;

ALGORITHMS; KALMAN FILTERS; POSITRON EMISSION TOMOGRAPHY; SIGNAL RECONSTRUCTION;

VECTORS;

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

References (46)

1. E. J. Candes, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency infor mation," IEEE Trans. Inf. Theory, vol. 52, pp. 489-509, Feb. 2006. (Pubitemid 43174093)
2. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, pp. 1289-1306, Apr. 2006.
3. E. J. Candes and M. B. Wakin, "An introduction to compressive sampling," IEEE Signal Process. Mag., vol. 25, pp. 21-30, Mar. 2008.
4. B. D. Rao and K. Kreutz-Delgado, "Sparse solutions to linear inverse problems with multiple measurement vectors," in Proc. IEEE Digital Signal Process. Workshop, Bryce Canyon, UT, Jun. 1998, pp. 1-4.
5. 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, pp. 2477-2488, July 2005. (Pubitemid 41174440)
6. G. Tzagkarakis, D. Milioris, and P. Tsakalides, "Multiple- measurement Bayesian compressed sensing using GSM priors for DOA estimation," in Proc. IEEE Int. Conf. Acoust., Speech Signal Process. (ICASSP), Dallas, TX, Mar. 2010, pp. 2610-2613.
7. D. Liang, L. Ying, and F. Liang, "Parallel MRI acceleration using M-FOCUSS," in Proc. Int. Conf. Bioinform. Biomed. Eng. (ICBBE), Beijing, China, Jun. 2009, pp. 1-4.
8. Y. Eldar and H. Rauhut, "Average case analysis of multichannel sparse recovery using convex relaxation," IEEE Trans. Inf. Theory, vol. 56, pp. 505-519, Jan. 2010.
9. Y. Eldar and M. Mishali, "Robust recovery of signals from a structured union of subspaces," IEEE Trans. Inf. Theory, vol. 55, pp. 5302-5316, Nov. 2009.
10. J. A. Tropp, A. C. Gilbert, and M. J. Strauss, "Algorithms for simultaneous sparse approximation. Part II: Convex relaxation," Signal Process., vol. 86, pp. 589-602, Apr. 2006. (Pubitemid 43106573)
11. M. M. Hyder and K. Mahata, "A robust algorithm for joint sparse recovery," IEEE Signal Process. Lett., vol. 16, pp. 1091-1094, Dec. 2009.
12. Z. Zhang and B. D. Rao, "Iterative reweighted algorithms for sparse signal recovery with temporally correlated source vectors," in Proc. IEEE Int. Conf. Acoust., Speech Signal Process. (ICASSP), Prague, Czech Republic, May 2011, pp. 3932-3935.
13. 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, Apr. 2006. (Pubitemid 43106572)
14. K. Lee, Y. Bresler, and M. Junge, "Subspace methods for joint sparse recovery," IEEE Trans. Inf. Theory, vol. 58, pp. 3613-3641, Jun. 2012.
15. D. P. Wipf and B. D. Rao, "An empirical Bayesian strategy for solving the simultaneous sparse approximation problem," IEEE Trans. Signal Process., vol. 55, pp. 3704-3716, Jul. 2007. (Pubitemid 47018850)
16. J. Kim, W. Chang, B. Jung, D. Baron, and J. C. Ye, "Belief propagation for joint sparse recovery," Feb. 2011 [Online]. Available: http://arxiv. org/abs/1102.3289, arXiv:1102.3289v1 [cs.IT]
17. S. Shedthikere and A. Chockalingam, "Bayesian framework and message passing for joint support and signal recovery of approximately sparse signals," in Proc. IEEE Int. Conf. Acoust., Speech Signal Process. (ICASSP), Prague, Czech Republic, May 2011, pp. 4032-4035.
18. Z. Zhang and B. D. Rao, "Sparse signal recovery with temporally correlated source vectors using sparse Bayesian learning," IEEE J. Sel. Topics Signal Process., vol. 5, pp. 912-926, Sep. 2011.
19. N. Vaswani, "Kalman filtered compressed sensing," in Proc. IEEE Int. Conf. Image Process. (ICIP), 12-15, 2008, pp. 893-896.
20. D. Angelosante, G. B. Giannakis, and E. Grossi, "Compressed sensing of time-varying signals," in Proc. Int. Conf. Digital Signal Process., Jul. 2009, pp. 1-8.
21. D. Angelosante, S. Roumeliotis, and G. Giannakis, "Lasso-Kalman smoother for tracking sparse signals," in Proc. Asilomar Conf. Signals, Syst., Comput., Pacific Grove, CA, Nov. 2009, pp. 181-185.
22. N. Vaswani and W. Lu, "Modified-CS: Modifying compressive sensing for problems with partially known support," IEEE Trans. Signal Process., vol. 58, pp. 4595-4607, Sep. 2010.
23. J. Ziniel, L. C. Potter, and P. Schniter, "Tracking and smoothing of time-varying sparse signals via approximate belief propagation," in Asilomar Conf. Signals, Syst., Comput., Pacific Grove, CA, Nov. 2010, pp. 808-812.
24. E. van den Berg and M. P. Friedlander, "Theoretical and empirical results for recovery from multiple measurements," IEEE Trans. Inf. Theory, vol. 56, pp. 2516-2527, May 2010.
25. D. L. Donoho, A. Maleki, and A. Montanari, "Message passing algorithms for compressed sensing," in Proc. Nat. Acad. Sci., Nov. 2009, vol. 106, pp. 18914-18919.
26. D. L. Donoho, A. Maleki, and A. Montanari, "Message passing algorithms for compressed sensing: I. Motivation and construction," in Proc. Inf. Theory Workshop, Jan. 2010, pp. 1-5.
27. D. L. Donoho, I. Johnstone, and A. Montanari, "Accurate prediction of phase transitions in compressed sensing via a connection to minimax denoising," Nov. 2011 [Online]. Available: http://arxiv.org/abs/1111. 1041, arXiv:1111.1041v1 [cs.IT]
28. W. U. Bajwa, J. Haupt, A. M. Sayeed, and R. Nowak, "Compressed channel sensing: A new approach to estimating sparse multipath channels," Proc. IEEE, vol. 98, pp. 1058-1076, Jun. 2010.
29. M. A. Ohliger and D. K. Sodickson, "An introduction to coil array design for parallel MRI," NMR in Biomed., vol. 19, pp. 300-315, May 2006. (Pubitemid 43811104)
30. P. Schniter, "Turbo reconstruction of structured sparse signals," in Proc. Conf. Inf. Sci. Syst. (CISS), Mar. 2010.
31. R. L. Eubank, A Kalman Filter Primer. Boca Raton, FL: Chapman & Hall/CRC, 2006.
32. F. R. Kschischang, B. J. Frey, and H. A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, pp. 498-519, Feb. 2001. (Pubitemid 32318087)
33. J. Pearl, Probabilistic Reasoning in Intelligent Systems. San Mateo, CA: Morgan Kaufman, 1988.
34. B. J. Frey and D. J. C. MacKay, "A revolution: Belief propagation in graphs with cycles," in Adv. in Neural Inf. Process. Syst., M. Jordan, M. S. Kearns, and S. A. Solla, Eds. Cambridge, MA: MIT Press, 1998.
35. W. T. Freeman, E. C. Pasztor, and O. T. Carmichael, "Learning low-level vision," Int. J. Comput. Vision, vol. 40, pp. 25-47, Oct. 2000. (Pubitemid 32083682)
36. D. J. C. MacKay, Information Theory, Inference, and Learning Algorithms. New York: Cambridge Univ. Press, 2003.
37. D. Baron, S. Sarvotham, and R. G. Baraniuk, "Bayesian compressive sensing via belief propagation," IEEE Trans. Signal Process., vol. 58, pp. 269-280, Jan. 2010.
38. S. Rangan, "Estimation with random linear mixing, belief propagation, and compressed sensing," presented at the 44th Conf. Inf. Sci., Syst. (CISS), Princeton, NJ, Mar. 2010.
39. S. Rangan, "Generalized approximate message passing for estimation with random linear mixing," in Proc. Int. Symp. Inf. Theory (ISIT), St. Petersburg, Russia, Jul. 2011, pp. 2168-2172.
40. M. Bayati and A. Montanari, "The dynamics of message passing on dense graphs, with applications to compressed sensing," IEEE Trans. Inf. Theory, vol. 57, pp. 764-785, Feb. 2011.
41. D. L. Alspach and H. W. Sorenson, "Nonlinear Bayesian estimation using Gaussian sum approximations," IEEE Trans. Autom. Control, vol. 17, pp. 439-448, Aug. 1972.
42. D. Barber and A. T. Cemgil, "Graphical models for time series," IEEE Signal Process. Mag., vol. 27, pp. 18-28, Nov. 2010.
43. A. P. Dempster, N. M. Laird, and D. B. Rubin, "Maximum likelihood from incomplete data via the EM algorithm," J. Roy. Statist. Soc., B, vol. 39, pp. 1-38, 1977.
44. T. K. Moon, "The expectation-maximization algorithm," IEEE Signal Process. Mag., vol. 13, pp. 47-60, Nov. 1996. (Pubitemid 126518983)
45. C. M. Bishop, Pattern Recognition and Machine Learning. New York: Springer-Verlag, 2006.
46. Y. Weiss and W. T. Freeman, "Correctness of belief propagation in Gaussian graphical models of arbitrary topology," Neural Computat., vol. 13, pp. 2173-2200, Oct. 2001. (Pubitemid 33676880)