Non-Convex Phase Retrieval From STFT Measurements

From MaRDI portal
Publication:4566646

DOI10.1109/TIT.2017.2745623zbMATH Open1390.94093arXiv1607.08218OpenAlexW2964201439MaRDI QIDQ4566646FDOQ4566646

Nicolas Boumal, Tamir Bendory, Y. C. Eldar

Publication date: 27 June 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: The problem of recovering a one-dimensional signal from its Fourier transform magnitude, called Fourier phase retrieval, is ill-posed in most cases. We consider the closely-related problem of recovering a signal from its phaseless short-time Fourier transform (STFT) measurements. This problem arises naturally in several applications, such as ultra-short laser pulse characterization and ptychography. The redundancy offered by the STFT enables unique recovery under mild conditions. We show that in some cases the unique solution can be obtained by the principal eigenvector of a matrix, constructed as the solution of a simple least-squares problem. When these conditions are not met, we suggest using the principal eigenvector of this matrix to initialize non-convex local optimization algorithms and propose two such methods. The first is based on minimizing the empirical risk loss function, while the second maximizes a quadratic function on the manifold of phases. We prove that under appropriate conditions, the proposed initialization is close to the underlying signal. We then analyze the geometry of the empirical risk loss function and show numerically that both gradient algorithms converge to the underlying signal even with small redundancy in the measurements. In addition, the algorithms are robust to noise.


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







Cited In (31)





This page was built for publication: Non-Convex Phase Retrieval From STFT Measurements

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