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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call