The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Bayesian Compressive Sensing Using Laplace Priors
Abstract
In this paper, we model the components of the compressive sensing (CS) problem, i.e., the signal acquisition process, the unknown signal coefficients and the model parameters for the signal and noise using the Bayesian framework. We utilize a hierarchical form of the Laplace prior to model the sparsity of the unknown signal. We describe the relationship among a number of sparsity priors proposed in the literature, and show the advantages of the proposed model including its high degree of sparsity. Moreover, we show that some of the existing models are special cases of the proposed model. Using our model, we develop a constructive (greedy) algorithm designed for fast reconstruction useful in practical settings. Unlike most existing CS reconstruction methods, the proposed algorithm is fully automated, i.e., the unknown signal coefficients and all necessary parameters are estimated solely from the observation, and, therefore, no user-intervention is needed. Additionally, the proposed algorithm provides estimates of the uncertainty of the reconstructions. We provide experimental results with synthetic 1-D signals and images, and compare with the state-of-the-art CS reconstruction algorithms demonstrating the superior performance of the proposed approach.
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
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Book Review: Pattern Recognition and Machine Learning
Nasrabadi, N. M. (2007) · Journal of Electronic Imaging · doi:10.1117/1.2819119 · Cited by 22,066
Donoho, D. L. (2004) · Cited by 16,703
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
Advances in Neural Information Processing Systems 19
(2007) · The MIT Press eBooks · doi:10.52202/085713 · Cited by 15,539
Pattern Recognition and Machine Learning
(2006) · doi:10.1007/978-0-387-45528-0 · Cited by 9,824
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
(2006) · Springer eBooks · Cited by 8,123
Sparse MRI: The application of compressed sensing for rapid MR imaging
Lustig, M., Donoho, D., & Pauly, J. M. (2007) · Magnetic Resonance in Medicine · doi:10.1002/mrm.21391 · Cited by 6,952
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
MacKay, D. J. C. (1992) · Neural Computation · doi:10.1162/neco.1992.4.3.415 · Cited by 4,388
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
Ji, S., Xue, Y., & Carin, L. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.914345 · Cited by 2,406
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/15324430152748236 · Cited by 1,819
Sparse Bayesian Learning for Basis Selection
Wipf, D. P., & Rao, B. D. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.831016 · Cited by 1,559
Extensions of compressed sensing
Tsaig, Y., & Donoho, D. L. (2006) · Signal Processing · doi:10.1016/j.sigpro.2005.05.029 · Cited by 947
Fast Marginal Likelihood Maximisation for Sparse Bayesian Models
Tipping, M. E., & Faul, A. (2003) · Cited by 775
Deterministic constructions of compressed sensing matrices
DeVore, R. (2007) · Journal of Complexity · doi:10.1016/j.jco.2007.04.002 · Cited by 591
Sparse nonnegative solution of underdetermined linear equations by linear programming
Donoho, D. L., & Tanner, J. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0502269102 · Cited by 577
Adaptive sparseness for supervised learning
Figueiredo, M. A. T. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1227989 · Cited by 536
Compressed Sensing for Networked Data
Haupt, J., Bajwa, W. U., Rabbat, M., & Nowak, R. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.914732 · Cited by 530
Ji, S., Dunson, D., & Carin, L. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.2005866 · Cited by 502
Blumensath, T., & Davies, M. E. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.916124 · Cited by 461
Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit
Donoho, D. L., Tsaig, Y., Drori, I., & Starck, J. (2006) · Cited by 419
Bayesian and regularization methods for hyperparameter estimation in image restoration
Molina, R., Katsaggelos, A. K., & Mateos, J. (1999) · IEEE Transactions on Image Processing · doi:10.1109/83.743857 · Cited by 206
Self-citationA Variational Method for Learning Sparse and Overcomplete Representations
Girolami, M. (2001) · Neural Computation · doi:10.1162/089976601753196003 · Cited by 192
Parameter Estimation in TV Image Restoration Using Variational Distribution Approximation
Babacan, S. D., Molina, R., & Katsaggelos, A. K. (2008) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.916051 · Cited by 175
Self-citationVariational EM algorithms for non-Gaussian latent variable models
Palmer, J. A., Kreutz-Delgado, K., Wipf, D. R., & Rao, B. D. (2006) · Cited by 170
Perspectives on Sparse Bayesian Learning
Palmer, J. A., Rao, B. D., & Wipf, D. (2003) · Cited by 103
On Some Deterministic Dictionaries Supporting Sparsity
Gurevich, S., Hadani, R., & Sochen, N. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9043-z · Cited by 19
Performance Analysis of Latent Variable Models with Sparse Priors
Wipf, D., Palmer, J. A., Rao, B. D., & Kreutz-Delgado, K. (2007) · IEEE International Conference on Acoustics Speech and Signal Processing · Cited by 9
Cited by
Off-Grid Direction of Arrival Estimation Using Sparse Bayesian Inference
Yang, Z., Xie, L., & Zhang, C. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2222378 · Cited by 968
Arjoune, Y., & Kaabouch, N. (2019) · Sensors · doi:10.3390/s19010126 · Cited by 442
Compressive Sensing in Electromagnetics - A Review
Massa, A., Rocca, P., & Oliveri, G. (2015) · IEEE Antennas and Propagation Magazine · doi:10.1109/map.2015.2397092 · Cited by 360
Chaotic Time Series Prediction Based on a Novel Robust Echo State Network
Li, D., Han, M., & Wang, J. (2012) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2012.2188414 · Cited by 341
Sparse methods for direction-of-arrival estimation
Yang, Z., Li, J., Stoica, P., & Xie, L. (2018) · Academic Press Library in Signal Processing, Volume 7 · doi:10.1016/b978-0-12-811887-0.00011-0 · Cited by 332
Metadata
- Authors
- Babacan, S. D., Molina, R., & Katsaggelos, A. K.
- Venue
- IEEE Transactions on Image Processing
- Published
- 2010-01
- Volume
- 19
- Issue
- 1
- Pages
- 53-63
- ISSN
- 1057-7149 (ISSN-L)
- 1941-0042
- OpenAlex
- W2065513175
- Cited by
- 804
- References
- 31
- FWCI
- 26.31
- Type
- journal article
- Language
- en
- Open access
- closed
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.