Abstract
The iterative blind deconvolution algorithm proposed by Ayers and Dainty [ Opt. Lett. 13, 547 ( 1988)] and improved on by Davey et al. [ Opt. Commun. 69, 353 ( 1989)] is applied to the problem of phase retrieval, which is a special case of the blind deconvolution problem. A close relationship between this algorithm and the error-reduction version of the iterative Fourier-transform phase-retrieval algorithm is shown analytically. The performance of the blind deconvolution algorithm is compared with the error-reduction and hybrid input–output versions of the iterative Fourier-transform algorithm by reconstruction experiments on real-valued, nonnegative images with and without noise.
© 1990 Optical Society of America
Full Article | PDF ArticleMore Like This
R. G. Lane
J. Opt. Soc. Am. A 9(9) 1508-1514 (1992)
D. A. Fish, A. M. Brinicombe, E. R. Pike, and J. G. Walker
J. Opt. Soc. Am. A 12(1) 58-65 (1995)
R. H. T. Bates, B. K. Quek, and C. R. Parker
J. Opt. Soc. Am. A 7(3) 468-479 (1990)