Abstract
The Schulz–Snyder iterative algorithm for phase retrieval attempts to recover a nonnegative function from its autocorrelation by minimizing the I-divergence between a measured autocorrelation and the autocorrelation of the estimated image. We illustrate that the Schulz–Snyder algorithm can become trapped in a local minimum of the I-divergence surface. To show that the estimates found are indeed local minima, sufficient conditions involving the gradient and the Hessian matrix of the I-divergence are given. Then we build a brief proof showing how an estimate that satisfies these conditions is a local minimum. The conditions are used to perform numerical tests determining local minimality of estimates. Along with the tests, related numerical issues are examined, and some interesting phenomena are discussed.
© 2006 Optical Society of America
Full Article | PDF ArticleMore Like This
Kerkil Choi and Aaron D. Lanterman
J. Opt. Soc. Am. A 24(1) 34-49 (2007)
Hiroaki Takajo, Tohru Takahashi, Ryuzo Ueda, and Makoto Taninaka
J. Opt. Soc. Am. A 15(11) 2849-2861 (1998)
Hiroaki Takajo, Tohru Takahashi, Hiroaki Kawanami, and Ryuzo Ueda
J. Opt. Soc. Am. A 14(12) 3175-3187 (1997)