Phase retrieval algorithms: a comparison
James R. Fienup · Applied Optics · 1982
Iterative algorithms for phase retrieval from intensity data are compared to gradient search methods. Both the problem of phase retrieval from two intensity measurements (in electron microscopy or wave front sensing) and the problem of phase retrieval from a single intensity measurement plus a non-negativity constraint (in astronomy) are considered, with emphasis on the latter. It is shown that both the error-reduction algorithm for the problem of a single intensity measurement and the Gerchberg-Saxton algorithm for the problem of two intensity measurements converge. The error-reduction algorithm is also shown to be closely related to the steepest-descent method. Other algorithms, including the input-output algorithm and the conjugate-gradient method, are shown to converge in practice much faster than the error-reduction algorithm. Examples are shown.
Cited by 5,596 works. doi:10.1364/ao.21.002758
Authors
References
- The Fourier Transform and Its Applications
- A practical algorithm for the determination of phase from image and diffraction plane pictures
- Reconstruction of an object from the modulus of its Fourier transform
- Attainment of Diffraction Limited Resolution in Large Telescopes by Fourier Analysing Speckle Patterns in Star Images
- A new restoring algorithm for the preferential enhancement of edge gradients
- Method for Computing Kinoforms that Reduces Image Reconstruction Error
- Iterative Method Applied To Image Reconstruction And To Computer-Generated Holograms
- On the ambiguity of the image reconstruction problem
- Phase retrieval from modulus data
- Computer Techniques for Image Processing in Electron Microscopy