The DOI matches its Crossref record; 55 of the 55 references it cites were found in a registry or an index.
Bayesian Compressive Sensing Via Belief Propagation
Open accessAbstract
Compressive sensing (CS) is an emerging field based on the revelation that a small collection of linear projections of a sparse signal contains enough information for stable, sub-Nyquist signal acquisition. When a statistical characterization of the signal is available, Bayesian inference can complement conventional CS methods based on linear programming or greedy algorithms. We perform asymptotically optimal Bayesian inference using belief propagation (BP) decoding, which represents the CS encoding matrix as a graphical model. Fast computation is obtained by reducing the size of the graphical model with sparse encoding matrices. To decode a length-N signal containingKlarge coefficients, our CS-BP decoding algorithm uses O(K log(N)) measurements and O(N log2(N)) computation. Finally, although we focus on a two-state mixture Gaussian model, CS-BP is easily adapted to other signal models.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Donoho, D. L. (2004) · Cited by 16,703
(1988) · Cited by 16,582
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
Low-density parity-check codes
Gallager, R. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057683 · Cited by 10,602
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
Tropp, J. A., & Gilbert, A. C. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.909108 · Cited by 9,653
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486 · cited 1×
“BP relies on factor graphs, which enable fast computation of global multivariate functions by exploiting the way in which the global function factors into a product of simpler local functions, each of which depends on a subset of variables [51].”
BackgroundInformation theory, inference, and learning algorithms
(2004) · Choice Reviews Online · doi:10.5860/choice.41-5949 · Cited by 6,362
Information Theory, Inference, and Learning Algorithms
(2004) · Kybernetes · doi:10.1108/03684920410534506 · Cited by 4,937
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
Needell, D., & Tropp, J. A. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2008.07.002 · Cited by 4,326
Compressive Sensing [Lecture Notes]
Baraniuk, R. (2007) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.4286571 · Cited by 4,177
Self-citationBayesian Networks and Decision Graphs
Jensen, F. V., & Nielsen, T. D. (2007) · Information Science and Statistics · doi:10.1007/978-0-387-68282-2 · Cited by 4,129
Good error-correcting codes based on very sparse matrices
MacKay, D. J. C. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.748992 · Cited by 3,684
Greed is Good: Algorithmic Results for Sparse Approximation
Tropp, J. A. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834793 · Cited by 3,635
Figueiredo, M. A. T., Nowak, R. D., & Wright, S. J. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910281 · Cited by 3,524
Design of capacity-approaching irregular low-density parity-check codes
Richardson, T. J., Shokrollahi, M. A., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910578 · Cited by 3,335
Variable Selection via Gibbs Sampling
George, E. I., & McCulloch, R. E. (1993) · Journal of the American Statistical Association · doi:10.1080/01621459.1993.10476353 · Cited by 2,828
Introduction to Bayesian Networks
(2019) · Operational Risk Modelling in Financial Services · doi:10.1002/9781119508557.ch12 · Cited by 2,569
Ji, S., Xue, Y., & Carin, L. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.914345 · Cited by 2,406
Subspace Pursuit for Compressive Sensing Signal Reconstruction
Dai, W., & Milenkovic, O. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2016006 · Cited by 2,388
Iterative hard thresholding for compressed sensing
Blumensath, T., & Davies, M. E. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2009.04.002 · Cited by 2,275
Probing the Pareto Frontier for Basis Pursuit Solutions
van den Berg, E., & Friedlander, M. P. (2009) · SIAM Journal on Scientific Computing · doi:10.1137/080714488 · Cited by 1,939
The computational complexity of probabilistic inference using bayesian belief networks
Cooper, G. F. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90060-d · Cited by 1,937
Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm
Gorodnitsky, I. F., & Rao, B. D. (1997) · IEEE Transactions on Signal Processing · doi:10.1109/78.558475 · Cited by 1,834
Probabilistic Networks and Expert Systems
(1999) · Information Science and Statistics · doi:10.1007/b97670 · Cited by 1,727
Wavelet-based statistical signal processing using hidden Markov models
Crouse, M. S., Nowak, R. D., & Baraniuk, R. G. (1998) · IEEE Transactions on Signal Processing · doi:10.1109/78.668544 · Cited by 1,643
Self-citationUnderstanding belief propagation and its generalizations
Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2003) · Cited by 1,594
Recursive bayesian estimation using gaussian sums
Sorenson, H. W., & Alspach, D. L. (1971) · Automatica · doi:10.1016/0005-1098(71)90097-5 · Cited by 952
Image compression through wavelet transform coding
DeVore, R. A., Jawerth, B., & Lucier, B. J. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.119733 · Cited by 910
Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
Hale, E. T., Yin, W., & Zhang, Y. (2008) · SIAM Journal on Optimization · doi:10.1137/070698920 · Cited by 909
A digital fountain approach to asynchronous reliable multicast
Byers, J. W., Luby, M., & Mitzenmacher, M. (2002) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.803996 · Cited by 580
An Introduction to Bayesian Networks
Yakowitz, S. J. (1997) · Technometrics · doi:10.1080/00401706.1997.10485130 · Cited by 564
Adaptive Bayesian Wavelet Shrinkage
Chipman, H. A., Kolaczyk, E. D., & McCulloch, R. E. (1997) · Journal of the American Statistical Association · doi:10.1080/01621459.1997.10473662 · Cited by 553
大西, 仁. (1994) · Medical Entomology and Zoology · doi:10.11225/jcss.1.2_100 · Cited by 549
Exploiting Structure in Wavelet-Based Bayesian Compressive Sensing
He, L., & Carin, L. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2022003 · Cited by 506
Graphical models for machine learning and digital communication
(1999) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(99)90253-5 · Cited by 454
An Introduction to Bayesian Networks
Neil, M., & p, S. (2006) · Cited by 453
Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit
Donoho, D. L., Tsaig, Y., Drori, I., & Starck, J. (2006) · Cited by 419
Nonparametric belief propagation
Sudderth, E. B., Ihler, A. T., Freeman, W. T., & Willsky, A. S. (2003) · 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings. · doi:10.1109/cvpr.2003.1211409 · Cited by 413
High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension
Donoho, D. L. (2006) · Discrete & Computational Geometry · doi:10.1007/s00454-005-1220-0 · Cited by 370
Graphical Models for Machine Learning and Digital Communication
Frey, B. J. (1998) · The MIT Press eBooks · doi:10.7551/mitpress/3348.001.0001 · Cited by 352
A Revolution: Belief Propagation in Graphs with Cycles
Frey, B. J., & Mackay, D. (1997) · Cited by 291
Loopy Belief Propagation: Convergence and Effects of Message Errors
Ihler, A., Fischer, J. W., & Willsky, A. S. (2005) · doi:10.5555/1046920.1088703 · Cited by 286
Error correction via linear programming
Candes, E., Rudelson, M., Tao, T., & Vershynin, R. (2005) · 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05) · doi:10.1109/sfcs.2005.5464411 · Cited by 251
Variable Selection and Model Comparison in Regression
Geweke, J. (1996) · Bayesian Statistics 5 · doi:10.1093/oso/9780198523567.003.0039 · Cited by 227
Sommer, N., Feder, M., & Shalvi, O. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.917684 · Cited by 189
Multiuser Detection of Sparsely Spread CDMA
Guo, D., & Wang, C.-C. (2008) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2008.080402 · Cited by 173
Nonparametric belief propagation
Sudderth, E. B., Ihler, A., Isard, M., Freeman, W. T., & Willsky, A. S. (2010) · Communications of the ACM · doi:10.1145/1831407.1831431 · Cited by 149
A message-passing algorithm with damping
Pretti, M. (2005) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2005/11/p11008 · Cited by 117
A single-letter characterization of optimal noisy compressed sensing
Guo, D., Baron, D., & Shamai, S. S. (2009) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2009.5394838 · Cited by 113
Self-citationScott, D. W., & Szewczyk, W. (2001) · Technometrics · doi:10.1198/004017001316975916 · Cited by 78
Fast Bayesian Matching Pursuit: Model Uncertainty and Parameter Estimation for Sparse Linear Models
Schniter, P., & Ziniel, J. (2009) · Cited by 59
Bayesian approach to best basis selection
Pesquet, J.-C., Krim, H., Leporini, D., & Hamman, E. (2002) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1996.548005 · Cited by 56
Cited by
Message-passing algorithms for compressed sensing
Donoho, D. L., Maleki, A., & Montanari, A. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0909892106 · Cited by 2,416
Subspace Pursuit for Compressive Sensing Signal Reconstruction
Dai, W., & Milenkovic, O. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2016006 · Cited by 2,388
Structured Compressed Sensing: From Theory to Applications
Duarte, M. F., & Eldar, Y. C. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2161982 · Cited by 1,128
Computational Methods for Sparse Solution of Linear Inverse Problems
Tropp, J. A., & Wright, S. J. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2044010 · Cited by 1,046
Message passing algorithms for compressed sensing: I. motivation and construction
Donoho, D. L., Maleki, A., & Montanari, A. (2010) · IEEE Information Theory Workshop 2010 (ITW 2010) · doi:10.1109/itwksps.2010.5503193 · Cited by 542
Metadata
- Authors
- Baron, D., Sarvotham, S., & Baraniuk, R. G.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2010-01
- Volume
- 58
- Issue
- 1
- Pages
- 269-280
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2135859872
- Cited by
- 498
- References
- 55
- FWCI
- 56.32
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.