Fetching the paper…
Reading the bibliography…
When recovering a sparse signal from noisy compressive linear measurements, the distribution of the signal's non-zero coefficients can have a profound effect on recovery mean-squared error (MSE).
A. Dempster, N. M. Laird, and D. B. Rubin, “Maximum-likelihood from incomplete data via the EM algorithm,” J. Roy. Statist. Soc
1977
Earlier work this paper cites.
C. F. J. Wu, “On the convergence properties of the EM algorithm,” Ann. Statist
1983
Earlier work this paper cites.
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
1993
Earlier work this paper cites.
R. Tibshirani, “Regression shrinkage and selection via the lasso,” J. Roy. Statist. Soc. B
1996
Earlier work this paper cites.
S. S. Chen, D. L. Donoho, and M. A. Saunders, “Atomic decomposition by basis pursuit,” SIAM J. Scientific Comput
1998
Earlier work this paper cites.
R. Neal and G. Hinton, “A view of the EM algorithm that justifies incremental, sparse, and other variants,” in Learning in Graphical Models
1999
Earlier work this paper cites.
Providence, RI: Americal Mathematical Society, 2000
V. V. Buldygin and Y. V. Kozachenko, Metric Characterization of Random Variables and Random Processes · 2000
Earlier work this paper cites.
M. E. Tipping, “Sparse Bayesian learning and the relevance vector machine,” J. Mach. Learn. Res
2001
Earlier work this paper cites.
D. P. Wipf and B. D. Rao, “Sparse Bayesian learning for basis selection,” IEEE Trans. Signal Process
2004
Earlier work this paper cites.
P. Stoica and Y. Selén, “Model-order selection: A review of information criterion rules,” IEEE Signal Process. Mag
2004
Earlier work this paper cites.
New York: Springer, 2007
C. M. Bishop, Pattern Recognition and Machine Learning · 2007
Earlier work this paper cites.
S. Ji, Y. Xue, and L. Carin, “Bayesian compressive sensing,” IEEE Trans. Signal Process
2008
Earlier work this paper cites.
E. van den Berg and M. P. Friedlander, “Probing the Pareto frontier for basis pursuit solutions,” SIAM J. Scientific Comput
2008
Earlier work this paper cites.
D. L. Donoho and J. Tanner, “Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing,” Phil. Trans. Royal Soc. A
2009
Cited alongside, same era.
D. L. Donoho, A. Maleki, and A. Montanari, “Message passing algorithms for compressed sensing,” Proc. Nat. Acad. Sci
2009
Cited alongside, same era.
A. Beck and M. Teboulle, “A fast iterative shrinkage-thresholding algorithm for linear inverse problems,” SIAM J. Imag. Sci
2009
Cited alongside, same era.
W. Dai and O. Milenkovic, “Subspace pursuit for compressive sensing reconstruction,” IEEE Trans. Inform. Theory
2009
Cited alongside, same era.
H. Mohimani, M. Babaie-Zadeh, and C. Jutten, “A fast approach for overcomplete sparse decomposition based on smoothed norm,” IEEE Trans. Signal Process
2009
M. Bayati and A. Montanari, “The dynamics of message passing on dense graphs, with applications to compressed sensing,” IEEE Trans. Inform. Theory
2011
Later among the works it cites.
(Full version at arXiv:1010.5141 )
S. Rangan, “Generalized approximate message passing for estimation with random linear mixing,” in Proc. IEEE Int. Symp. Inform. Thy · 2011
Later among the works it cites.
Z. Zhang and B. D. Rao, “Sparse signal recovery with temporally correlated source vectors using sparse Bayesian learning,” IEEE J. Sel. Topics Signal Process
2011
Later among the works it cites.
Z. Zhang, “Master the usage of T-MSBL in 3 minutes,” tech. rep., Univ. of California, San Diego, Nov. 2011
2011
Later among the works it cites.
J. P. Vila and P. Schniter, “Expectation-maximization Gaussian-mixture approximate message passing,” in Proc. Conf. Inform. Science & Syst
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
V. Cevher, “Learning with compressible priors,” in Proc. Neural Inform. Process. Syst. Conf
2009
Cited alongside, same era.
2010
Cited alongside, same era.
D. L. Donoho, A. Maleki, and A. Montanari, “Message passing algorithms for compressed sensing: I. Motivation and construction,” in Proc. Inform. Theory Workshop
2010
Cited alongside, same era.
New York: Cambridge University Press, 2010
B. Efron, Large-Scale Inference: Empirical Bayes Methods for Estimation, Testing, and Prediction · 2010
Cited alongside, same era.
http://dsp.rice.edu/cs
“Compressive sensing resources: References and software,” · 2010
Cited alongside, same era.
J. P. Vila and P. Schniter, “An empirical-Bayes approach to compressive sensing via approximate message passing.” presented at the Duke Workshop on Sensing and Analysis of High-Dimensional Data , (Durham, NC), July 2011
2011
Cited alongside, same era.
J. P. Vila and P. Schniter, “Expectation-maximization Bernoulli-Gaussian approximate message passing,” in Proc. Asilomar Conf. Signals Syst. Comput
2011
Cited alongside, same era.
2012
Closest in time.
New York: Cambridge Univ. Press, 2012
Y. C. Eldar and G. Kutyniok, Compressed Sensing: Theory and Applications · 2012
Closest in time.
M. Bayati, M. Lelarge, and A. Montanari, “Universality in polytope phase transitions and iterative algorithms,” in Proc. IEEE Int. Symp. Inform. Thy · 2012
Closest in time.
Y. Wu and S. Verdú, “Optimal phase transitions in compressed sensing,” IEEE Trans. Inform. Theory
2012
Closest in time.
(Full version at arXiv:1207.3859 )
U. S. Kamilov, S. Rangan, A. K. Fletcher, and M. Unser, “Approximate message passing with consistent parameter estimation and applications to sparse learning,” in Proc. Neural Inform. Process. Syst. Conf · 2012
Closest in time.
U. S. Kamilov, A. Bourquard, A. Amini, and M. Unser, “One-bit measurements with adaptive thresholds,” IEEE Signal Process. Lett
2012
Closest in time.
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
2012
Closest in time.
H. Monajemi, S. Jafarpour, M. Gavish, Stat 330/CME 362 Collaboration, and D. L. Donoho, “Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices,” Proc. Nat. Acad. Sci
2013
Closest in time.