Phase Retrieval from 1D Fourier Measurements: Convexity, Uniqueness, and Algorithms

From MaRDI portal
Publication:4621067

DOI10.1109/TSP.2016.2601291zbMATH Open1414.94252arXiv1603.05215MaRDI QIDQ4621067FDOQ4621067


Authors: Kejun Huang, Y. C. Eldar, Nicholas D. Sidiropoulos Edit this on Wikidata


Publication date: 8 February 2019

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Abstract: This paper considers phase retrieval from the magnitude of 1D over-sampled Fourier measurements, a classical problem that has challenged researchers in various fields of science and engineering. We show that an optimal vector in a least-squares sense can be found by solving a convex problem, thus establishing a hidden convexity in Fourier phase retrieval. We also show that the standard semidefinite relaxation approach yields the optimal cost function value (albeit not necessarily an optimal solution) in this case. A method is then derived to retrieve an optimal minimum phase solution in polynomial time. Using these results, a new measuring technique is proposed which guarantees uniqueness of the solution, along with an efficient algorithm that can solve large-scale Fourier phase retrieval problems with uniqueness and optimality guarantees.


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







Cited In (14)





This page was built for publication: Phase Retrieval from 1D Fourier Measurements: Convexity, Uniqueness, and Algorithms

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