Random projections and the optimization of an algorithm for phase retrieval

DOI10.1088/0305-4470/36/12/309MaRDI QIDQ4443880zbMATH OpenOpenAlexFDO

Authors Veit Elser

Publication date 19 January 2004

Published in Journal of Physics A: Mathematical and General (Search for Journal in Brave)

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

zbMATH Keywords

difference mapIterative phase retrieval algorithms

Mathematics Subject Classification ID

Diffraction, scattering (78A45) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Statistical mechanics of crystals (82D25) Optimization problems in optics and electromagnetic theory (78M50)

Abstract: Iterative phase retrieval algorithms typically employ projections onto constraint subspaces to recover the unknown phases in the Fourier transform of an image, or, in the case of x-ray crystallography, the electron density of a molecule. For a general class of algorithms, where the basic iteration is specified by the difference map, solutions are associated with fixed points of the map, the attractive character of which determines the effectiveness of the algorithm. The behavior of the difference map near fixed points is controlled by the relative orientation of the tangent spaces of the two constraint subspaces employed by the map. Since the dimensionalities involved are always large in practical applications, it is appropriate to use random matrix theory ideas to analyze the average-case convergence at fixed points. Optimal values of the gamma parameters of the difference map are found which differ somewhat from the values previously obtained on the assumption of orthogonal tangent spaces.

Recommendations

• Relaxed averaged alternating reflections for diffraction imaging
• Phase retrieval: theory, model and algorithms
• Phase retrieval with one or two diffraction patterns by alternating projections with the null initialization
• Phase retrieval via matrix completion
• Phase retrieval via matrix completion

Cited in

(9)

• Improved transmission design algorithms by utilizing variable-strength projections
• Relaxed averaged alternating reflections for diffraction imaging
• Norm retrieval and phase retrieval by projections
• Iterative projection algorithms in protein crystallography. I: Theory
• Searching with iterated maps
• A fast Newton algorithm for entropy maximization in phase determination
• Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
• Projection methods for high numerical aperture phase retrieval
• Phase Retrieval Using Feasible Point Pursuit: Algorithms and Cramér–Rao Bound

This page was built for publication: Random projections and the optimization of an algorithm for phase retrieval

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