Non-Convex Phase Retrieval From STFT Measurements
From MaRDI portal
Publication:4566646
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.
Cited in
(31)- The Condition Number of Riemannian Approximation Problems
- Phase retrieval from local measurements: improved robustness via eigenvector-based angular synchronization
- Uniqueness of STFT Phase Retrieval for Bandlimited Vector Functions
- Phase retrieval from short-time fractional Fourier measurements using alternating direction method of multipliers
- Polarimetric Fourier phase retrieval
- A generalization of Wirtinger flow for exact interferometric inversion
- Solving phase retrieval with random initial guess is nearly as good as by spectral initialization
- On signal reconstruction from FROG measurements
- Cholesky QR-based retraction on the generalized Stiefel manifold
- Sensor calibration for off-the-grid spectral estimation
- No existence of a linear algorithm for the one-dimensional Fourier phase retrieval
- Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval
- Near-optimal bounds for signal recovery from blind phaseless periodic short-time Fourier transform
- A geometric analysis of phase retrieval
- Lower Lipschitz bounds for phase retrieval from locally supported measurements
- Phaseless reconstruction from space-time samples
- Nonconvex phase synchronization
- The Estimation Performance of Nonlinear Least Squares for Phase Retrieval
- Nonsmooth optimization over the Stiefel manifold and beyond: proximal gradient method and recent variants
- Proximal gradient method for nonsmooth optimization over the Stiefel manifold
- Adaptive trust-region method on Riemannian manifold
- Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
- On connections between amplitude flow and error reduction for phase retrieval and ptychography
- Admissible measurements and robust algorithms for ptychography
- Riemannian trust region methods for \(\mathrm{SC}^1\) minimization
- Toward a mathematical theory of the crystallographic phase retrieval problem
- Benchmark problems for phase retrieval
- Background removal for ptychography via Wigner distribution deconvolution
- Linear Convergence of Randomized Kaczmarz Method for Solving Complex-Valued Phaseless Equations
- Uniqueness of phase retrieval with short-time linear canonical transform
- S-transform based on optimally concentrated time-limited and band-limited windows
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)
