A New Fast Iterative Blind Deconvolution Algorithm

DOI: 10.4236/jsip.2012.31013   PDF   HTML     7,956 Downloads   13,465 Views   Citations


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.

Share and Cite:

M. Fahmy, G. Raheem, U. Mohamed and O. Fahmy, "A New Fast Iterative Blind Deconvolution Algorithm," Journal of Signal and Information Processing, Vol. 3 No. 1, 2012, pp. 98-108. doi: 10.4236/jsip.2012.31013.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] M. J. T. Smith and A. Docef, “A Study Guide for Digital Image Processing,” Scientific Publishers Inc., Georgia, 1999.
[2] R. C. Gonzalez and R. E. Woods, “Digital Image Processing,” 2nd Edition, Addison-Welsely Publishing Company, Reading, 1987.
[3] R. L. Lagendijk, and J. Biemond, “Iterative Identification and Restoration of Images,” Kluwer Academic Publishers, Boston, 1991. doi:10.1007/978-1-4615-3980-3
[4] G. R. Ayers and G. C. Danty, “Ierative Blind Deconvolution Method and Its applications,” Optics Letters, Vol. 13, No. 7, 1988, pp. 547-549. doi:10.1364/OL.13.000547
[5] D. Kundur and D. Hatzinakios, “Blind Image Deconvolution Revisted,” IEEE Magazine on Signal Processing, Vol. 13, No. 6, 1996, pp. 61-63.
[6] D. A. Fish, A. M. Brinicombe, E. R. Pike and J. G. Walker, “Blind Deconvolution by Means of the Richardson-Lucy Algorithm,” Journal of the Optical Society of America A, Vol. 12, No. 1, 1995, pp. 58-65. doi:10.1364/JOSAA.12.000058
[7] D. S. C. Biggs and M. Andrews, “Acceleration of Iterative Image Restoration Algorithms,” Applied Optics, Vol. 36, No. 8, 1997, pp. 1766-1775. doi:10.1364/AO.36.001766
[8] Ming Jiang and GeWang, “Development of Blind Image Deconvolution and Its Applications,” Journal of X-ray Science and Ology, Vol. 11, 2003, pp. 13-19.
[9] H. Y. Liu, Y. S. Zhang and J. I. Song, “Study on the Methods of Super Resolution Image Reconstruction,” The International Archives of the Photognanmetry, Remote Sensing and Spatial Information Science, Vol. XXVII, Part B2, Beijing, 2008.
[10] D. Kundur and D. Hatzinakios, “Blind Image Deconvolution,” IEEE Magazine on Signal Processing, Vol. 13, No. 3, 1996, pp. 43-64.
[11] S. Mallat, “A Wavelet Tour of Signal Processing, the Sparse Way,” Academic Press, New York, 2009.
[12] M. F. Fahmy, G. M. Fahmy and O. M. Fahmy, “Bspline Wavelets in Signal De-Noising and Image Compression,” Journal of Signal, Image and Video Processing, Vol. 5, No. 2, 2011, pp. 141-153. doi:10.1007/s11760-009-0148-x

comments powered by Disqus

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.