On Fienup Methods for Sparse Phase Retrieval

DOI10.1109/TSP.2017.2780044MaRDI QIDQ4621611zbMATH OpenFDO

Authors Edouard Pauwels, Amir Beck, Y. C. Eldar, Shoham Sabach

Publication date 12 February 2019

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

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

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: Alternating minimization, or Fienup methods, have a long history in phase retrieval. We provide new insights related to the empirical and theoretical analysis of these algorithms when used with Fourier measurements and combined with convex priors. In particular, we show that Fienup methods can be viewed as performing alternating minimization on a regularized nonconvex least-squares problem with respect to amplitude measurements. We then prove that under mild additional structural assumptions on the prior (semi-algebraicity), the sequence of signal estimates has a smooth convergent behaviour towards a critical point of the nonconvex regularized least-squares objective. Finally, we propose an extension to Fienup techniques, based on a projected gradient descent interpretation and acceleration using inertial terms. We demonstrate experimentally that this modification combined with an $el{l}_1$ prior constitutes a competitive approach for sparse phase retrieval.

Cited in

(11)

• Absorption and phase retrieval with Tikhonov and joint sparsity regularizations
• Analytical convergence regions of accelerated gradient descent in nonconvex optimization under regularity condition
• Phase retrieval: a data-driven wavelet frame based approach
• Admissible measurements and robust algorithms for ptychography
• scientific article; zbMATH DE number 7295466 (Why is no real title available?)
• Fienup Algorithm With Sparsity Constraints: Application to Frequency-Domain Optical-Coherence Tomography
• Phase Retrieval Using Feasible Point Pursuit: Algorithms and Cramér–Rao Bound
• Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons
• Phase retrieval with sparse phase constraint
• Sparse phase retrieval via ℓp (0 < p ≤ 1) minimization
• Robust sparse phase retrieval: statistical guarantee, optimality theory and convergent algorithm

This page was built for publication: On Fienup Methods for Sparse Phase Retrieval

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