Abstract
We consider the geometry associated to the ambiguities of the one-dimensional Fourier phase retrieval problem for vectors in $\mathbb{C}^{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 nontrivial ambiguities of a signal vary as the signal varies. This is done by describing the incidence variety of pairs of signals with the 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 multivectors played an important role in the author's work with Bendory and Eldar on blind phaseless short-time Fourier transform recovery.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
