Abstract

We propose new phase-retrieval algorithms that utilize the nonnegativity and the finite extent of objects. The squared error in the Fourier domain is minimized with an improved conjugate-gradient method that uses the Kuhn–Tucker theorem to estimate the nonnegative object. The squared error outside the finite support of the object is minimized to estimate the phase of the Fourier transform of the object. This phase-estimation method is combined with the improved conjugate-gradient method. The effectiveness of these phase-retrieval algorithms is clearly shown through computer simulations.

© 1987 Optical Society of America

Phase-retrieval error: a lower bound

J. N. Cederquist and C. C. Wackerman
J. Opt. Soc. Am. A 4(9) 1788-1792 (1987)

Numerical investigation of the uniqueness of phase retrieval

J. H. Seldin and J. R. Fienup
J. Opt. Soc. Am. A 7(3) 412-427 (1990)

Reconstruction of a complex-valued object from the modulus of its Fourier transform using a support constraint

J. R. Fienup
J. Opt. Soc. Am. A 4(1) 118-123 (1987)

Study on the convergence property of the hybrid input–output algorithm used for phase retrieval

Hiroaki Takajo, Tohru Takahashi, Ryuzo Ueda, and Makoto Taninaka
J. Opt. Soc. Am. A 15(11) 2849-2861 (1998)

Iterative blind deconvolution algorithm applied to phase retrieval

J. H. Seldin and J. R. Fienup
J. Opt. Soc. Am. A 7(3) 428-433 (1990)