The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Saving phase: Injectivity and stability for phase retrieval
Open accessAbstract
Abstract Recent advances in convex optimization have led to new strides in the phase retrieval problem over finite-dimensional vector spaces. However, certain fundamental questions remain: What sorts of measurement vectors uniquely determine every signal up to a global phase factor, and how many are needed to do so? Furthermore, which measurement ensembles yield stability? This paper presents several results that address each of these questions. We begin by characterizing injectivity, and we identify that the complement property is indeed a necessary condition in the complex case. We then pose a conjecture that 4 M − 4 generic measurement vectors are both necessary and sufficient for injectivity in M dimensions, and we prove this conjecture in the special cases where M = 2 , 3 . Next, we shift our attention to stability, both in the worst and average cases. Here, we characterize worst-case stability in the real case by introducing a numerical version of the complement property. This new property bears some resemblance to the restricted isometry property of compressed sensing and can be used to derive a sharp lower Lipschitz bound on the intensity measurement mapping. Localized frames are shown to lack this property (suggesting instability), whereas Gaussian random measurements are shown to satisfy this property with high probability. We conclude by presenting results that use a stochastic noise model in both the real and complex cases, and we leverage Cramer–Rao lower bounds to identify stability with stronger versions of the injectivity characterizations.
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
Handbook of Mathematical Functions
McQuarrie, D. A. (1966) · American Journal of Physics · doi:10.1119/1.1972842 · Cited by 40,433
Fundamentals of Statistical Signal Processing: Estimation Theory
Sengijpta, S. K. (1995) · Technometrics · doi:10.1080/00401706.1995.10484391 · Cited by 11,076
Fundamentals of statistical signal processing: Estimation theory
Prasad, K. V. (1994) · Control Engineering Practice · doi:10.1016/0967-0661(94)90195-3 · Cited by 7,902
Hartshorne, R. (1977) · Graduate texts in mathematics · doi:10.1007/978-1-4757-3849-0 · Cited by 6,960
Ziegel, E. R., Lehmann, E. L., & Casella, G. (1999) · Technometrics · doi:10.2307/1270597 · Cited by 4,203
The restricted isometry property and its implications for compressed sensing
Candès, E. J. (2008) · Comptes Rendus. Mathématique · doi:10.1016/j.crma.2008.03.014 · Cited by 3,686
(1998) · Springer Texts in Statistics · doi:10.1007/b98854 · Cited by 1,719
PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
Candès, E. J., Strohmer, T., & Voroninski, V. (2013) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.21432 · Cited by 1,197
The discrete fractional Fourier transform
Candan, C., Kutay, M. A., & Ozaktas, H. M. (2000) · IEEE Transactions on Signal Processing · doi:10.1109/78.839980 · Cited by 683
Phase recovery, MaxCut and complex semidefinite programming
Waldspurger, I., d’Aspremont, A., & Mallat, S. (2015) · Mathematical Programming · doi:10.1007/s10107-013-0738-9 · Cited by 573
Phase Retrieval via Matrix Completion
Candès, E. J., Eldar, Y. C., Strohmer, T., & Voroninski, V. (2015) · SIAM Review · doi:10.1137/151005099 · Cited by 481
Local Operator Theory, Random Matrices and Banach Spaces
(2001) · Handbook of the Geometry of Banach Spaces · doi:10.1016/s1874-5849(01)80010-3 · Cited by 432
Solving Quadratic Equations via PhaseLift When There Are About as Many Equations as Unknowns
Candès, E. J., & Li, X. (2014) · Foundations of Computational Mathematics · doi:10.1007/s10208-013-9162-z · Cited by 292
Phase Retrieval: Stability and Recovery GuaranteesPreprint
(n.d.) · Cited by 207
Mathematical Foundations of Quantum Theory
Kibble, T. W. B. (1979) · Physics Bulletin · doi:10.1088/0031-9112/30/5/034 · Cited by 175
Quantum tomography under prior informationPreprint
Heinosaari, T., Mazzarella, L., Michael, et al. (2016) · Cited by 175
Painless Reconstruction from Magnitudes of Frame Coefficients
Balan, R., Bodmann, B. G., Casazza, P. G., & Edidin, D. (2009) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-009-9065-1 · Cited by 169
Alexeev, B., Cahill, J., & Mixon, D. G. (2012) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-012-9235-4 · Cited by 138
Self-citationPhase Retrieval with Polarization
Alexeev, B., Bandeira, A. S., Fickus, M. C., & Mixon, D. G. (2014) · SIAM Journal on Imaging Sciences · doi:10.1137/12089939x · Cited by 135
Self-citationStable Optimizationless Recovery from Phaseless Linear Measurements
Demanet, L., & Hand, P. (2013) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-013-9305-2 · Cited by 124
Uniqueness results in an extension of Pauli's phase retrieval problem
Jaming, P. (2014) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2014.01.003 · Cited by 96
Pure-state informationally complete and “really” complete measurements
Finkelstein, J. (2004) · Physical Review A · doi:10.1103/physreva.70.052107 · Cited by 80
Real, Tight Frames with Maximal Robustness to Erasures
Püschel, M., & Kovačević, J. (2005) · DCC · doi:10.1109/dcc.2005.77 · Cited by 80
Milgram, R. J. (1967) · Annals of Mathematics · doi:10.2307/1970353 · Cited by 48
Numerically erasure-robust frames
Fickus, M. C., & Mixon, D. G. (2012) · Linear Algebra and its Applications · doi:10.1016/j.laa.2012.04.034 · Cited by 37
Self-citationReconstruction of Signals from Magnitudes of Redundant RepresentationsPreprint
Balan, R. V. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.1134 · Cited by 21
Cited by
Phase Retrieval with Application to Optical Imaging: A contemporary overview
Shechtman, Y., Eldar, Y. C., Cohen, O., Chapman, H. N., Miao, J., & Segev, M. (2015) · IEEE Signal Processing Magazine · doi:10.1109/msp.2014.2352673 · Cited by 1,131
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
Solving Systems of Random Quadratic Equations via Truncated Amplitude Flow
Wang, G., Giannakis, G. B., & Eldar, Y. C. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2756858 · Cited by 330
Metadata
- Authors
- Bandeira, A. S., Cahill, J., Mixon, D. G., & Nelson, A. A.
- Venue
- Applied and Computational Harmonic Analysis
- Publisher
- Elsevier BV
- Published
- 2014-07
- Volume
- 37
- Issue
- 1
- Pages
- 106-125
- ISSN
- 1063-5203 (ISSN-L)
- OpenAlex
- W2040192961
- Cited by
- 301
- References
- 26
- FWCI
- 24.47
- 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
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.