26 July 1993 Determination of optimum iteration number for Fourier iterative blind deconvolution algorithm
Author Affiliations +
Proceedings Volume 1983, 16th Congress of the International Commission for Optics: Optics as a Key to High Technology; 19834O (1993) https://doi.org/10.1117/12.2308587
Event: 16th Congress of the International Commission for Optics: Optics as a Key to High Technology, 1993, Budapest, Hungary
Abstract
The Fourier iterative algorithm for blind deconvolution, originally proposed by Ayers and Dainty [1], has the advantage of simple structure which allows easy incorporation of various kinds of constraint conditions.Although the algorithm has been shown to be effective for the blind deconvolution of rather simple computer-simulatedconvolved patterns, when it is applied to more complicated patterns such as real blurred pictures, the convergence properties lose stability and it becomes necessary to find the optimum iteration number at which the algorithm is terminated. It is empirically known that EN(psf), the sum of negative values, which are contained in an estimated point spread function for blurring, can be used as an appropriate cost function for determining the optimum iteration number [2].
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Takeshi Onodera, Takeshi Onodera, } "Determination of optimum iteration number for Fourier iterative blind deconvolution algorithm", Proc. SPIE 1983, 16th Congress of the International Commission for Optics: Optics as a Key to High Technology, 19834O (26 July 1993); doi: 10.1117/12.2308587; https://doi.org/10.1117/12.2308587
PROCEEDINGS
2 PAGES


SHARE
Back to Top