Fetching the paper…
Reading the bibliography…
We consider the compressive sensing of a sparse or compressible signal ${\bf x} \in {\mathbb R}^M$.
R. G. Gallager, Low-Density Parity-Check Codes
1963
Earlier work this paper cites.
D. Andrews and C. Mallows, “Scale mixtures of normal distributions,” J. R. Stat. Soc
1974
Earlier work this paper cites.
R. M. Tanner, “ A Recursive Approach to Low Complexity Codes,” IEEE Trans. Inf. Theory
1981
Earlier work this paper cites.
C. C. Paige and M. A. Saunders, “LSQR: Sparse Linear Equations and Least Squares Problems,” ACM Transactions on Mathematical Software (TOMS) , vol. 8, pp.195-209, June 1982
1982
Earlier work this paper cites.
C. Robert, The Bayesian Choice: A Decision Theoretic Motivation
1994
Earlier work this paper cites.
T. K. Moon, “The EM algorithm in signal processing,” IEEE Sig. Proc. Mag
1996
Earlier work this paper cites.
M. Sipser and D. A. Spielman,“Expander codes,” IEEE Trans. Inf. Theory
1996
Earlier work this paper cites.
N. Wiberg, “Codes and decoding on general graphs,” Ph.D. dissertation, Linköping University, Sweden, 1996
1996
Earlier work this paper cites.
G. J. McLachlan and T. Krishnan, The EM Algorithm and Extensions
1997
Earlier work this paper cites.
D. J. C. MacKay, “Good error correcting codes based on very sparse matrices,” IEEE Trans. Inf. Theory
1999
Earlier work this paper cites.
Y. Weiss and W. T. Freeman, “Correctness of belief propagation in Gaussian graphical models of arbitrary topology,” Proc. Adv. Neural Inform. Processing Syst
1999
Earlier work this paper cites.
T. Cormen, C. Lesierson, L. Rivest, and C. Stein, Introduction to Algorithms
2001
Earlier work this paper cites.
M. A. T. Figueiredo and R. Nowak, “Wavelet-based image estimation: An empirical bayes approach using Jeffreys noninformative prior,” IEEE Trans. Image Proc., vol. 10, pp. 1322-1331, Sep. 2001
2001
Earlier work this paper cites.
F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, “Factor Graphs and the Sum-Product Algorithm,” IEEE Trans. Inf. Theory
2001
Earlier work this paper cites.
Y. Mao and A. H. Banihashemi, “Decoding Low-Density Parity-Check Codes With Probabilistic Scheduling,” IEEE Comm. Letters
2001
Earlier work this paper cites.
T. J. Richardson and R.L. Urbanke, “The capacity of low-density parity-check codes under message passing decoding,” IEEE Trans. Inf. Theory
2001
Earlier work this paper cites.
M. E. Tipping, “Sparse Bayesian learning and the relevance vector machine,” Journal of Machine Learning Research, vol. 1, pp. 211-244, 2001
2001
Earlier work this paper cites.
D. J. C. MacKay, Information Theory, Inference, and Learning Algorithms
2002
Cited alongside, same era.
J. Portilla, V. Strela, M. J. Wainwright and E. P. Simoncelli, “Image Denoising Using Scale Mixtures of Gaussians in the Wavelet Domain,” IEEE Trans. Image Proc
2003
Cited alongside, same era.
M. E. Tipping, “Bayesian inference: An introduction to principles and practice in machine learning,” in O. Bousquet, U. von Luxburg, and G. Rätsch (Eds.), Advanced Lectures on Machine Learning, pp. 41-62, Springer, 2004
2004
Cited alongside, same era.
J. A. Tropp, “Topics in Sparse Approximation”, Ph.D. dissertation, Computational and Applied Mathematics, UT-Austin, August 2004
2004
Cited alongside, same era.
H. Xiao and A. H. Banihashemi, “Graph-Based Message-Passing Schedules for Decoding LDPC Codes,” IEEE Trans. on Comm
2004
Cited alongside, same era.
M. J. Wainwright, “Sharp thresholds for noisy and high-dimensional recovery of sparsity using ℓ 1 {\ell}_{1} -constrained quadratic programming,” Technical report, UC Berkeley, Department of Statistics, May 2006
2006
Later among the works it cites.
M. Akçakaya and V. Tarokh, “On Sparsity, Redundancy and Quality of Frame Representations,” IEEE Int. Symposium on Information Theory (ISIT), Nice, France, June 2007
2007
Later among the works it cites.
2007
Later among the works it cites.
E. J. Candès and T. Tao, “The Dantzig selector: statistical estimation when p is much larger than n,” Annals of Statistics, 35, pp. 2313-2351, Dec. 2007
2007
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
E. J. Candès, J. Romberg, “Practical signal recovery from random projections,” presented at the Wavelet Appl. Signal Image Process. XI, SPIE Conf
2005
Cited alongside, same era.
E. J. Candès, T. Tao, “Decoding by Linear Programming,” IEEE Trans. Inf. Theory
2005
Cited alongside, same era.
X.-Y. Hu, E. Eleftheriou and D. M. Arnold, “Regular and irregular progressive edge-growth tanner graphs,” IEEE Trans. Inf. Theory
2005
Cited alongside, same era.
J. M. Bioucas-Dias, “Bayesian Wavelet-Based Image Deconvolution: A GEM Algorithm Exploiting a Class of Heavy-Tailed Priors,” IEEE Trans. Image Proc
2006
Cited alongside, same era.
C. M. Bishop, Pattern Recognition and Machine Learning
2006
Cited alongside, same era.
E. J. Candès, J. Romberg, T. Tao, “Stable signal recovery for incomplete and inaccurate measurements,” Commun. Pure Appl. Math
2006
Cited alongside, same era.
D. L. Donoho, “Compressed Sensing,” IEEE Trans. Inf. Theory
2006
Cited alongside, same era.
M. A. T. Figueiredo, R. D. Nowak and S. J. Wright, “Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems,” IEEE Journal of Selected Topics in Signal Processing , vol. 1, pp. 586-598, Dec. 2007
2007
Later among the works it cites.
J. A. Tropp, A. C. Gilbert, “Signal recovery from partial information via Orthogonal Matching Pursuit”, IEEE Trans. Inf. Theory
2007
Later among the works it cites.
M. J. Wainwright, “Information-Theoretic Limits on Sparsity Recovery in the High-Dimensional and Noisy Setting,” Technical Report, UC Berkeley, Department of Statistics, Jan. 2007
2007
Later among the works it cites.
2007
Later among the works it cites.
M. Akçakaya and V. Tarokh, “A Frame Construction and A Universal Distortion Bound for Sparse Representations,” IEEE Trans. Sig. Proc
2008
Later among the works it cites.
2008
Later among the works it cites.
R. Berinde, A. C. Gilbert, P. Indyk, H. Karloff, and M. J. Strauss, “Combining geometry and combinatorics: A unified approach to sparse signal recovery,” preprint, 2008
2008
Later among the works it cites.
R. Berinde, P. Indyk, and M. Ruz̃ić, “Practical near-optimal sparse recovery in the ell-1 norm,” Proc. Allerton Conference on Communication, Control, and Computing, Monticello, IL, September 2008
2008
Later among the works it cites.
2008
Later among the works it cites.
2008
Later among the works it cites.
S. Ji, Y. Xue and L. Carin, “Bayesian compressive sensing,” IEEE Trans. on Sig. Proc
2008
Later among the works it cites.