Phase retrieval with complexity guidance
Mansi Butola, Sunaina, Kedar Khare

TL;DR
This paper introduces a complexity-guided phase retrieval method that reduces iterations and overcomes stagnation by controlling solution complexity, improving convergence in iterative Fourier phase retrieval tasks.
Contribution
It proposes a novel complexity parameter and a modified Fienup algorithm that explicitly controls solution complexity to enhance convergence and mitigate stagnation issues.
Findings
Significantly reduces phase retrieval iterations.
Automatically addresses stagnation problems.
Enables practical applications with large iteration requirements.
Abstract
Iterative phase retrieval methods based on the Gerchberg-Saxton (GS) or Fienup algorithm require a large number of iterations to converge to a meaningful solution. For complex-valued or phase objects, these approaches also suffer from stagnation problems where the solution does not change much from iteration to iteration but the resultant solution shows artifacts such as presence of a twin. We introduce a complexity parameter that can be computed directly from the Fourier magnitude data and provides a measure of fluctuations in the desired phase retrieval solution. It is observed that when initiated with a uniformly random phase map, the complexity of the Fienup solution containing stagnation artifacts stabilizes at a numerical value that is much higher than . We propose a modified Fienup algorithm that uses a controlled sparsity enhancing step such that in every…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
