Phase retrieval algorithms: a comparison

  • Fienup J
5.4kCitations
Citations of this article
1.9kReaders
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Fienup, J. R. (1982). Phase retrieval algorithms: a comparison. Applied Optics, 21(15), 2758. https://doi.org/10.1364/ao.21.002758

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free