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 |
Fingerprint
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Condensed Matter Physics
Cite this
Determination of optimum iteration number for Fourier iterative blind deconvolution algorithm. / Onodera, Takeshi; Komatsu, Shinichi.
Proceedings of SPIE - The International Society for Optical Engineering. ed. / Gy. Akos; T. Lippenyi; G. Lupkovics; A. Podmaniczky. Vol. 1983 pt 1. ed. Bellingham, WA, United States : Publ by Society of Photo-Optical Instrumentation Engineers, 1993. p. 415-416.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Determination of optimum iteration number for Fourier iterative blind deconvolution algorithm
AU - Onodera, Takeshi
AU - Komatsu, Shinichi
PY - 1993
Y1 - 1993
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0027814385&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0027814385&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0027814385
SN - 0819412309
VL - 1983
SP - 415
EP - 416
BT - Proceedings of SPIE - The International Society for Optical Engineering
A2 - Akos, Gy.
A2 - Lippenyi, T.
A2 - Lupkovics, G.
A2 - Podmaniczky, A.
PB - Publ by Society of Photo-Optical Instrumentation Engineers
CY - Bellingham, WA, United States
ER -