Academic Journals Database
Disseminating quality controlled scientific knowledge

A New Fast Iterative Blind Deconvolution Algorithm

ADD TO MY LIST
 
Author(s): Mamdouh F. Fahmy | Gamal M. Abdel Raheem | Usama S. Mohamed | Omar F. Fahmy

Journal: Journal of Signal and Information Processing
ISSN 2159-4465

Volume: 03;
Issue: 01;
Start page: 98;
Date: 2012;
Original page

Keywords: Blind Image Deconvolution | Image Enhancement

ABSTRACT
Successful blind image deconvolution algorithms require the exact estimation of the Point Spread Function size, PSF. In the absence of any priori information about the imagery system and the true image, this estimation is normally done by trial and error experimentation, until an acceptable restored image quality is obtained. This paper, presents an exact estimation of the PSF size, which yields the optimum restored image quality for both noisy and noiseless images. It is based on evaluating the detail energy of the wave packet decomposition of the blurred image. The minimum detail energies occur at the optimum PSF size. Having accurately estimated the PSF, the paper also proposes a fast double updating algorithm for improving the quality of the restored image. This is achieved by the least squares minimization of a system of linear equations that minimizes some error functions derived from the blurred image. Moreover, a technique is also proposed to improve the sharpness of the deconvolved images, by constrained maximization of some of the detail wavelet packet energies. Simulation results of several examples have verified that the proposed technique manages to yield a sharper image with higher PSNR than classical approaches.
Why do you need a reservation system?      Affiliate Program