Expectation-Maximization gaussian-mixture approximate message passing

IEEE Transactions on Signal Processing

Volumn 61, Issue 19, 2013, Pages 4658-4672

  Vila, Jeremy P ^a   Schniter, Philip ^a  

^a Ohio State University   (United States)

Author keywords

belief propagation; Compressed sensing; expectation maximization algorithms; Gaussian mixture model

Indexed keywords

BELIEF PROPAGATION; COMPUTATIONALLY EFFICIENT; EXPECTATION - MAXIMIZATIONS; EXPECTATION MAXIMIZATION; EXPECTATION-MAXIMIZATION ALGORITHMS; GAUSSIAN MIXTURE MODEL; NUMERICAL EXPERIMENTS; STATE-OF-THE-ART PERFORMANCE;

COMPRESSED SENSING; IMAGE SEGMENTATION; MAXIMUM PRINCIPLE; SIGNAL RECONSTRUCTION;

RECOVERY;

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

References (37)

1. J. P. Vila and P. Schniter, "An empirical-Bayes approach to compressive sensing via approximate message passing, " presented at the Duke Workshop Sens. Analy. High-Dimensional Data, Durham, NC, USA, Jul. 2011.
2. J. P. Vila and P. Schniter, "Expectation-maximization Bernoulli- Gaussian approximate message passing, " in Proc. Asilomar Conf. Signals Syst. Comput., Pacific Grove, CA, USA, Nov. 2011, pp. 799-803.
3. J. P. Vila and P. Schniter, "Expectation-maximization Gaussian-mixture approximate message passing, " in Proc. Conf. Inf. Sci. Syst., Princeton, NJ, USA, Mar. 2012, pp. 1-6.
4. Y. C. Eldar and G. Kutyniok, Compressed Sensing: Theory and Applications. New York, NY, USA: Cambridge Univ. Press, 2012.
5. M. Bayati, M. Lelarge, and A. Montanari, "Universality in polytope phase transitions and iterative algorithms, " in Proc. IEEE Int. Symp. Inf. Theory, Boston, MA, USA, Jun. 2012, pp. 1-5.
6. R. Tibshirani, "Regression shrinkage and selection via the lasso, " J. Roy. Statist. Soc. B, vol. 58, no. 1, pp. 267-288, 1996.
7. S. S. Chen, D. L. Donoho, andM.A. Saunders, "Atomic decomposition by basis pursuit, " SIAM J. Scientif. Comput., vol. 20, no. 1, pp. 33-61, 1998.
8. D. L. Donoho and J. Tanner, "Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing, " Philos. Trans. Roy. Soc. A, vol. 367, no. 1906, pp. 4273-4293, 2009.
9. D. L. Donoho, A. Maleki, and A. Montanari, "The noise-sensitivity phase transition in compressed sensing, " IEEE Trans. Inf. Theory, vol. 57, no. 10, pp. 6920-6941, Oct. 2011.
10. D. L. Donoho, A. Maleki, and A. Montanari, "Message passing algorithms for compressed sensing, " in Proc. Natl. Acad. Sci., Nov. 2009, vol. 106, pp. 18914-18919.
11. Y. Wu and S. Verdú, "Optimal phase transitions in compressed sensing, " IEEE Trans. Inf. Theory, vol. 58, pp. 6241-6263, Oct. 2012.
12. D. L. Donoho, A. Maleki, and A. Montanari, "Message passing algorithms for compressed sensing: I. Motivation and construction, " in Proc. Inf. Theory Workshop, Cairo, Egypt, Jan. 2010, pp. 1-5.
13. 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.
14. S. Rangan, "Generalized approximate message passing for estimation with random linear mixing, " in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Saint Petersburg, Russia, Aug. 2011, pp. 2168-2172.
15. A. Dempster, N. M. Laird, and D. B. Rubin, "Maximum-likelihood from incomplete data via the EM algorithm, " J. Roy. Statist. Soc., vol. 39, pp. 1-17, 1977.
16. B. Efron, Large-Scale Inference: Empirical Bayes Methods for Estimation, Testing, and Prediction. New York, NY, USA: Cambridge Univ. Press, 2010.
17. M. E. Tipping, "Sparse Bayesian learning and the relevance vector machine, " J. Mach. Learn. Res., vol. 1, pp. 211-244, 2001.
18. D. P. Wipf and B. D. Rao, "Sparse Bayesian learning for basis selection, " IEEE Trans. Signal Process., vol. 52, pp. 2153-2164, Aug. 2004.
19. S. Ji, Y. Xue, and L. Carin, "Bayesian compressive sensing, " IEEE Trans. Signal Process., vol. 56, pp. 2346-2356, Jun. 2008.
20. U. S.Kamilov, S.Rangan, A. K. Fletcher, andM. Unser, "Approximate message passing with consistent parameter estimation and applications to sparse learning, " in Proc. Neural Inf. Process. Syst. Conf. (NIPS), Lake Tahoe, NV, USA, Dec. 2012, pp. 2447-2455.
21. U. S. Kamilov, A. Bourquard, A.Amini, and M. Unser, "One-bit measurements with adaptive thresholds, " IEEE Signal Process. Lett., vol. 19, pp. 607-610, Oct. 2012.
22. C. F. J. Wu, "On the convergence properties of the EM algorithm, " Ann. Statist., vol. 11, no. 1, pp. 95-103, 1983.
23. R. Neal and G. Hinton, , M. I. Jordan, Ed., "A view of the EM algorithm that justifies incremental, sparse, and other variants, " in Learning in Graphical Models. Cambridge, MA, USA: MIT Press, 1999, pp. 355-368.
24. C. M. Bishop, Pattern Recognition and Machine Learning. New York, NY, USA: Springer, 2007.
25. P. Stoica and Y. Selén, "Model-order selection: A review of information criterion rules, " IEEE Signal Process. Mag., vol. 21, pp. 36-47, Jul. 2004.
26. A. Beck and M. Teboulle, "A fast iterative shrinkage-thresholding algorithm for linear inverse problems, " SIAM J. Imag. Sci., vol. 2, no. 1, pp. 183-202, 2009.
27. H. Monajemi, S. Jafarpour, M. Gavish, and D. L. Donoho, "Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices, " in Proc. Natl. Acad. Sci., Jan. 2013, vol. 110, pp. 1181-1186, Stat 330/CME 362 Collaboration.
28. V. V. Buldygin and Y. V. Kozachenko, Metric Characterization of Random Variables and Random Processes. Providence, RI, USA: Amer. Math. Soc., 2000.
29. Y. C. Pati, R. Rezaiifar, and P. S.Krishnaprasad, "Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition, " in Proc. Asilomar Conf. Signals Syst. Comput., Pacific Grove, CA, USA, 1993, pp. 40-44.
30. W. Dai and O. Milenkovic, "Subspace pursuit for compressive sensing reconstruction, " IEEE Trans. Inf. Theory, vol. 55, pp. 2230-2249, Mar. 2009.
31. 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.
32. E. van den Berg andM. P. Friedlander, "Probing the Pareto frontier for basis pursuit solutions, " SIAM J. Scientif. Comput., vol. 31, no. 2, pp. 890-912, 2008.
33. H. Mohimani, M. Babaie-Zadeh, and C. Jutten, "A fast approach for overcomplete sparse decomposition based on smoothed norm, " IEEE Trans. Signal Process., vol. 57, pp. 289-301, Jan. 2009.
34. Z. Zhang, "Master the usage of T-MSBL in 3 minutes, " Univ. of California, San Diego, CA, USA, Tech. Rep., Nov. 2011.
35. V. Cevher, "Learning with compressible priors, " in Proc. Neural Inf. Process. Syst. Conf., Vancouver, BC, Canada, Dec. 2009, pp. 261-269.
36. J. Ziniel, S. Rangan, and P. Schniter, "A generalized framework for learning and recovery of structured sparse signals, " in Proc. IEEE Workshop Statist. Signal Process., Ann Arbor, MI, USA, Aug. 2012, pp. 325-328.
37. Compressive Sensing Resources: References and Software [Online]. Available: http://dsp.rice.edu/cs