The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Compressive Phase Retrieval via Generalized Approximate Message Passing
Open accessAbstract
In phase retrieval, the goal is to recover a signal x ∈ CNfrom the magnitudes of linear measurements Ax ∈ CM. While recent theory has established that M ≈ 4N intensity measurements are necessary and sufficient to recover generic x, there is great interest in reducing the number of measurements through the exploitation of sparse \mbi x, which is known as compressive phase retrieval. In this work, we detail a novel, probabilistic approach to compressive phase retrieval based on the generalized approximate message passing (GAMP) algorithm. We then present a numerical study of the proposed PR-GAMP algorithm, demonstrating its excellent phase-transition behavior, robustness to noise, and runtime. Our experiments suggest that approximately M ≥ 2 Klog2(N/K) intensity measurements suffice to recover K-sparse Bernoulli-Gaussian signals for \mbi A with i.i.d Gaussian entries and K ≪ N. Meanwhile, when recovering a 6678-sparse 65536-pixel grayscale image from 32768 randomly masked and blurred Fourier intensity measurements at 30 dB measurement SNR, PR-GAMP achieved an output SNR of no less than 28 dB in all of 100 random trials, with a median runtime of only 7.3 seconds. Compared to the recently proposed CPRL, sparse-Fienup, and GESPAR algorithms, our experiments suggest that PR-GAMP has a superior phase transition and orders-of-magnitude faster runtimes as the sparsity and problem dimensions increase.
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
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
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
Phase retrieval algorithms: a comparison
Fienup, J. R. (1982) · Applied Optics · doi:10.1364/ao.21.002758 · Cited by 5,596
Mathematical Analysis of Random Noise
Rice, S. O. (1944) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1944.tb00874.x · Cited by 5,480
Maximum likelihood estimation from incomplete data via the EM algorithm
Dempster, A. P. (1977) · Journal of the Royal Statistical Society Series A (Statistics in Society) · Cited by 4,543
Probabilistic Reasoning in Intelligent Systems
(1988) · Elsevier eBooks · doi:10.1016/c2009-0-27609-4 · Cited by 3,321
Mathematical Analysis of Random Noise
Rice, S. O. (1945) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1945.tb00453.x · Cited by 2,898
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
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
Cited by
Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
Chen, Y., & Candès, E. J. (2017) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.21638 · Cited by 477
AMP-Inspired Deep Networks for Sparse Linear Inverse Problems
Borgerding, M., Schniter, P., & Rangan, S. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2708040 · Cited by 455
Self-citationStatistical physics of inference: thresholds and algorithms
Zdeborová, L., & Krzakala, F. (2016) · Advances in Physics · doi:10.1080/00018732.2016.1211393 · Cited by 440
Bilinear Generalized Approximate Message Passing—Part I: Derivation
Parker, J. T., Schniter, P., & Cevher, V. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2357776 · Cited by 281
Self-citationOn the convergence of approximate message passing with arbitrary matrices
Rangan, S., Schniter, P., & Fletcher, A. (2014) · 2014 IEEE International Symposium on Information Theory · doi:10.1109/isit.2014.6874830 · Cited by 279
Self-citation
Metadata
- Authors
- Schniter, P., & Rangan, S.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2015-02
- Volume
- 63
- Issue
- 4
- Pages
- 1043-1055
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2761315682
- Cited by
- 279
- References
- 36
- FWCI
- 17.27
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Compressive Phase Retrieval via Generalized Approximate Message Passing. https://app.cochat.ai/papers/10.1109/tsp.2014.2386294
- The paper
- Schniter, P., & Rangan, S. (2015). Compressive Phase Retrieval via Generalized Approximate Message Passing. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2014.2386294
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.