Abstract
The Fourier iterative algorithm for blind deconvolution, originally by Ayers and Dainty, has the advantage of simple structure which allows easy incorporation effective for the blind deconvolution of rather simple computer-simulated convolved 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.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of SPIE - The International Society for Optical Engineering |
| Editors | Gy. Akos, T. Lippenyi, G. Lupkovics, A. Podmaniczky |
| Place of Publication | Bellingham, WA, United States |
| Publisher | Publ by Society of Photo-Optical Instrumentation Engineers |
| Pages | 415-416 |
| Number of pages | 2 |
| Volume | 1983 |
| Edition | pt 1 |
| ISBN (Print) | 0819412309 |
| Publication status | Published - 1993 |
| Event | Proceedings of the 16th Congress of the International Commission for Optics - Budapest, Hung Duration: 1993 Aug 9 → 1993 Aug 13 |
Other
| Other | Proceedings of the 16th Congress of the International Commission for Optics |
|---|---|
| City | Budapest, Hung |
| Period | 93/8/9 → 93/8/13 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Condensed Matter Physics
Fingerprint Dive into the research topics of 'Determination of optimum iteration number for Fourier iterative blind deconvolution algorithm'. Together they form a unique fingerprint.
Cite this
Onodera, T., & Komatsu, S. (1993). Determination of optimum iteration number for Fourier iterative blind deconvolution algorithm. In G. Akos, T. Lippenyi, G. Lupkovics, & A. Podmaniczky (Eds.), Proceedings of SPIE - The International Society for Optical Engineering (pt 1 ed., Vol. 1983, pp. 415-416). Publ by Society of Photo-Optical Instrumentation Engineers.