Determination of optimum iteration number for Fourier iterative blind deconvolution algorithm

Takeshi Onodera, Shinichi Komatsu

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    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 languageEnglish
    Title of host publicationProceedings of SPIE - The International Society for Optical Engineering
    EditorsGy. Akos, T. Lippenyi, G. Lupkovics, A. Podmaniczky
    Place of PublicationBellingham, WA, United States
    PublisherPubl by Society of Photo-Optical Instrumentation Engineers
    Pages415-416
    Number of pages2
    Volume1983
    Editionpt 1
    ISBN (Print)0819412309
    Publication statusPublished - 1993
    EventProceedings of the 16th Congress of the International Commission for Optics - Budapest, Hung
    Duration: 1993 Aug 91993 Aug 13

    Other

    OtherProceedings of the 16th Congress of the International Commission for Optics
    CityBudapest, Hung
    Period93/8/993/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