Abstract
Both a new iterative grid-search technique and the iterative Fourier-transform algorithm are used to illuminate the relationships among the ambiguous images nearest a given object, error metric minima, and stagnation points of phase-retrieval algorithms. Analytic expressions for the subspace of ambiguous solutions to the phase-retrieval problem are derived for 2 × 2 and 3 × 2 objects. Monte Carlo digital experiments using a reduced-gradient search of these subspaces are used to estimate the probability that the worst-case nearest ambiguous image to a given object has a Fourier modulus error of less than a prescribed amount. Probability distributions for nearest ambiguities are estimated for different object-domain constraints.
© 1990 Optical Society of America
Full Article | PDF ArticleMore Like This
Hiroaki Takajo, Tohru Takahashi, Hiroaki Kawanami, and Ryuzo Ueda
J. Opt. Soc. Am. A 14(12) 3175-3187 (1997)
J. R. Fienup and C. C. Wackerman
J. Opt. Soc. Am. A 3(11) 1897-1907 (1986)
T. R. Crimmins, J. R. Fienup, and B. J. Thelen
J. Opt. Soc. Am. A 7(1) 3-13 (1990)