The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Probabilistic reconstruction in compressed sensing: algorithms, phase diagrams, and threshold achieving matrices
Open accessAbstract
Compressed sensing is a signal processing method that acquires data directly in a compressed form. This allows one to make fewer measurements than were considered necessary to record a signal, enabling faster or more precise measurement protocols in a wide range of applications. Using an interdisciplinary approach, we have recently proposed in Krzakala et al (2012 Phys. Rev. X 2 021005) a strategy that allows compressed sensing to be performed at acquisition rates approaching the theoretical optimal limits. In this paper, we give a more thorough presentation of our approach, and introduce many new results. We present the probabilistic approach to reconstruction and discuss its optimality and robustness. We detail the derivation of the message passing algorithm for reconstruction and expectation maximization learning of signal-model parameters. We further develop the asymptotic analysis of the corresponding phase diagrams with and without measurement noise, for different distributions of signals, and discuss the best possible reconstruction performances regardless of the algorithm. We also present new efficient seeding matrices, test them on synthetic data and analyze their performance asymptotically.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
An Introduction To Compressive Sampling
Candes, E. J., & Wakin, M. B. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.914731 · Cited by 10,017
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×
“To approximate the expectations we will use a variant of the belief propagation (BP) algorithm [28, 29, 46].”
MethodSpin Glass Theory and Beyond: An Introduction to the Replica Method and Its Applications
Mezard, M., Parisi, G., & Virasoro, M. (1986) · World Scientific Lecture Notes in Physics · doi:10.1142/0271 · Cited by 3,653
Cited by
A high-bias, low-variance introduction to Machine Learning for physicists
Mehta, P., Bukov, M., Wang, C.-H., Day, A. G. R., Richardson, C., Fisher, C. K., & Schwab, D. J. (2019) · Physics Reports · doi:10.1016/j.physrep.2019.03.001 · Cited by 920
Statistical physics of inference: thresholds and algorithms
Zdeborová, L., & Krzakala, F. (2016) · Advances in Physics · doi:10.1080/00018732.2016.1211393 · Cited by 440
Self-citationChannel Estimation for Massive MIMO Using Gaussian-Mixture Bayesian Learning
Wen, C.-K., Jin, S., Wong, K.-K., Chen, J.-C., & Ting, P. (2015) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2014.2365813 · Cited by 310
Compressive Phase Retrieval via Generalized Approximate Message Passing
Schniter, P., & Rangan, S. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2386294 · Cited by 279
Compressed-Sensing-Based Periodic Impulsive Feature Detection for Wind Turbine Systems
Du, Z., Chen, X., Zhang, H., & Yang, B. (2017) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2017.2666840 · Cited by 32
Metadata
- Authors
- Krzakala, F., Mézard, M., Sausset, F., Sun, Y., & Zdeborová, L.
- Venue
- Journal of Statistical Mechanics: Theory and Experiment
- Publisher
- IOP Publishing
- Published
- 2012-08-17
- Volume
- 2012
- Issue
- 08
- Pages
- P08009
- ISSN
- 1742-5468 (ISSN-L)
- OpenAlex
- W2018322127
- Cited by
- 207
- References
- 3
- FWCI
- 14.30
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Probabilistic reconstruction in compressed sensing: algorithms, phase diagrams, and threshold achieving matrices. https://app.cochat.ai/papers/10.1088/1742-5468/2012/08/p08009
- The paper
- Krzakala, F., Mézard, M., Sausset, F., Sun, Y., & Zdeborová, L. (2012). Probabilistic reconstruction in compressed sensing: algorithms, phase diagrams, and threshold achieving matrices. Journal of Statistical Mechanics: Theory and Experiment. https://doi.org/10.1088/1742-5468/2012/08/p08009
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.