The Geometry of Ambiguity in One-Dimensional Phase Retrieval

DOI10.1137/18M1230530MaRDI QIDQ5208887zbMATH OpenWikidataFDO

Authors Dan Edidin

Publication date 22 January 2020

Published in SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1811.06963

zbMATH Keywords

Fourier transformphase retrievalreal algebraic setsroot covering

Mathematics Subject Classification ID

Trigonometric polynomials, inequalities, extremal problems (42A05) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: We consider the geometry associated to the ambiguities of the one-dimensional Fourier phase retrieval problem for vectors in ${mathbbC}^{N+1}$. Our first result states that the space of signals has a finite covering (which we call the root covering) where any two signals in the covering space with the same Fourier intensity function differ by a trivial covering ambiguity. Next we use the root covering to study how the non-trivial ambiguities of a signal vary as the signal varies. This is done by describing of the incidence variety of pairs of signals with same fourier intensity function modulo global phase. As an application we give a criterion for a real subvariety of the space of signals to admit generic phase retrieval. The extension of this result to multi-vectors played an important role in the author's work with Bendory and Eldar on blind phaseless short-time fourier transform recovery.

Recommendations

• Geometry of the phase retrieval problem
• Ambiguities in one-dimensional phase retrieval from Fourier magnitudes
• A geometric analysis of phase retrieval
• Ambiguities in one-dimensional phase retrieval from magnitudes of a linear canonical transform
• Ambiguities in one-dimensional discrete phase retrieval from Fourier magnitudes
• Geometry of the phase retrieval problem. Graveyard of algorithms
• Phase Retrieval from 1D Fourier Measurements: Convexity, Uniqueness, and Algorithms
• One-dimensional phase retrieval: regularization, box relaxation and uniqueness
• Uniqueness of a one-dimensional phase retrieval problem
• Nearly optimal bounds for the global geometric landscape of phase retrieval

Cites work

• Ambiguities in one-dimensional discrete phase retrieval from Fourier magnitudes
• Blind Phaseless Short-Time Fourier Transform Recovery
• Branched coverings and orbit maps
• Enforcing uniqueness in one-dimensional phase retrieval by additional signal information in time domain
• Gram spectrahedra
• scientific article; zbMATH DE number 1194721 (Why is no real title available?)
• scientific article; zbMATH DE number 43706 (Why is no real title available?)
• scientific article; zbMATH DE number 3572315 (Why is no real title available?)
• scientific article; zbMATH DE number 1201576 (Why is no real title available?)
• scientific article; zbMATH DE number 3304649 (Why is no real title available?)
• Ideals, Varieties, and Algorithms
• On the 2D Phase Retrieval Problem

Cited in

(9)

• A geometrical problem arising in a signal restoration algorithm
• Near-optimal bounds for signal recovery from blind phaseless periodic short-time Fourier transform
• Toward a mathematical theory of the crystallographic phase retrieval problem
• Total variation-based reconstruction and phase retrieval for diffraction tomography
• One-dimensional phase retrieval: regularization, box relaxation and uniqueness
• Affine phase retrieval for sparse signals via \(\ell_1\) minimization
• Phase retrieval with semialgebraic and ReLU neural network priors
• Recovery performance of PhaseLift for phase retrieval from coded diffraction patterns
• Ambiguities in one-dimensional discrete phase retrieval from Fourier magnitudes

This page was built for publication: The Geometry of Ambiguity in One-Dimensional Phase Retrieval

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5208887)