Blind Deconvolution Algorithm for Image Restoration Using Point Spread Function

Amarnath Gaini
#1

M Vijayalaxmi*2
Associate Professor Department of Electronics VITS(N9), Andhra Pradesh

K Sreedhar#3
Assistant Professor Department of Electronics VITS(N9), Andhra Pradesh

Assistant Professor Department of Electronics VITS(N9), Andhra Pradesh

amarnathgaini@gmail.com

vijayamanojgaddam@gmail.com

sreedhar_kallem@yahoo.com

Abstract Blind deconvolution refers to the image processing task of restoring the original image from a blurred version without the knowledge of the blurring function. One approach that has been proposed. Image restoration methods can be considered as direct techniques when their results are produced in a simple one step fashion. Equivalently, indirect techniques can be considered as those in which restoration results are obtained after a number of iterations. Known restoration techniques such as inverse filtering and Wiener Filtering can be considered as simple direct restoration techniques. The problem with such methods is that they require knowledge of the blur function that is point-spread function (PSF), which is, unfortunately, usually not available when dealing with image blurring. In this paper Blind deconvolution for image restoration is discussed which is the recovery of a sharp version of a blurred image when the blur kernel is unknown.

Where: g is the horizontal size blurring direction and f is vertical blurring size direction and R is the radius size of the circular average blurring. 2. The Gaussian Blur effect is a filter that blends a specific number of pixels incrementally, following a bell shaped curve. The blurring is dense in the center and feathers at the edge. Apply Gaussian Blur to an image when we want more control over the Blur effect. 3. The Motion Blur effect is a filter that makes the image appear to be moving by adding a blur in a specific direction. The motion can be controlled by angle or direction (0 to 360 degrees or 90 to +90) and/or by distance or intensity in pixels (0 to 999), based on the software used. 1.2. Deblurring

The Blind Deconvolution Algorithm can be used 1.2.1. Why Deblurring effectively when no information about the distortion (blurring Better looking image and noise) is known. The algorithm restores the image and the Improved identification point-spread function (PSF) simultaneously. The accelerated, Reduces overlap of image structure to more easily damped Richardson-Lucy algorithm is used in each iteration. identify features in the image (needs high SNR) Additional optical system (e.g. camera) characteristics can be used as input parameters that could help to improve the quality PSF calibration of the image restoration. PSF constraints can be passed in Removes artifacts in the image due to the point through a user-specified function spread function (PSF) of the system, i.e. extended Keywords Blind Deconvolution Algorithm, PSF, Image Restoration, Canny Edge Detection, Degradation Model.

I. INTRODUCTION
Blurring is a form of bandwidth reduction of the image due to imperfect image formation process. It can be caused by relative motion between camera and original images. Normally, an image can be degraded using low-pass filters and its noise. This low-pass filter is used to blur/smooth the image using certain functions. There are 3 common types of Blur effects [1]: 1. The Average blur is one of several tools we can use to remove noise and specks in an image. Use it when noise is present over the entire image. This type of blurring can be distribution in horizontal and vertical direction and can be circular averaging by radius R which is evaluated by the formula: R = g2 + f2

halos, lumpy Airy rings etc. Higher resolution In specific cases depending upon algorithms and SNR Better Quantitative Analysis

1.2.2. Deblurring Model A blurred or degraded image can be approximately described by this equation: g = PSF*f + N, Where: g the blurred image, h the distortion operator called Point Spread Function (PSF), f the original true image and N Additive noise, introduced during image acquisition, that corrupts the image[1]. Point Spread Function (PSF)

Point Spread Function (PSF) is the degree to which an optical system blurs (spreads) a point of light. The PSF is the inverse Fourier transform of Optical Transfer Function (OTF).in the frequency domain ,the OTF describes the response of a linear, position-invariant system to an impulse.OTF is the Fourier transfer of the point (PSF). Image deblurring is an inverse problem which is used to recover an image which has suffered from linear degradation. The blurring degradation can be space-invariant or space-invariant [2]. Image deblurring methods can be divided into two classes: non blind, in which the blurring operator is known and blind, in which the blurring operator is unknown.

be an input to the deblurring algorithm. Various algorithms are available for deblurring. In this paper, we are going to use blind deconvolution algorithm. The result of this algorithm produces the deblurring image which can be compared with our original image. Flow Chart of Deblurring the Image

II IMAGE DEGRADATION MODEL

In the model of image degradation [2] fig. 1, the observed image g(x, y) is modeled as the output of a 2-D linear system and can be characterized by its degradation function h(x, y). The noise n(x, y) is assumed to be a Gaussian white noise with zero mean. If the degradation function h(x, y) is linear and space invariant function, then the observed blurred/noisy image in spatial domain is given by G(x, y) =h(x, y)*f(x, y) + n(x, y)
Fig. 2: Overall Flow Chart

III BLIND DECONVOLUTION ALGORITHM

The Blind Deconvolution Algorithm can be used effectively when no information about the distortion (blurring and noise) is known. The algorithm restores the image and the pointspread function (PSF) simultaneously. The accelerated, damped Richardson-Lucy algorithm is used in each iteration. Additional optical system (e.g. camera) characteristics can be used as input parameters that could help to improve the quality of the image restoration. PSF constraints can be passed in through a user-specified function. Algorithm for Deblurring Input: Blurred image g Initialize number of iterations i Initial PSF h Weight of an image w % pixels considered for restoration a=0 (default) % Array corresponding to additive noise

Fig. 1: Image Degradation Model

Algorithm for Degradation Model Input Input: Load and input image f Initialize blur length I Initialize blur angle theta Assign The type of noise n PSF (Point Spread Function), h Procedure- I H=create (f, 1, theta) % Creation of PSF Blurred image (g) =f*h + n G=filter (f, h, n, convolution) If g contains ringing at its edge then Remove ringing effect using edge taper function Else Go to Procedure II End Procedure I

Procedure-II If PSF is not known then Guess initial values of PSF The original image is degraded or blurred using degradation Else model to produce the blurred image. The blurred image should Specify the PSF of degraded image

Restored Image f= Deconvolution (g, h, i, w, a) End Procedure- II

Simulate a real-life image that could be blurred (e.g., due to camera motion or lack of focus). The example simulates the blur by convolving a Gaussian filter with the true image (using IV. PROBLEM FORMULATION & RESULTS imfilter). The Gaussian filter then represents a point-spread The objective of blind image deconvolution is to construct a function, PSF. reliable estimate of the imaged scene from a blurred version. PSF = fspecial('gaussian',7,10); Blurred = imfilter (I,PSF,'symmetric','conv'); Figure; imshow(Blurred); title('Blurred Image');

Fig.3 Example of a finite support image. The support of the true image is different from the support of the blurred image. This task is achieved by using partial information about the imaging process as a reference to deconvolve the true image and PSF from the blurred image. Restore the blurred image using PSFs of various sizes In this paper, we make the following procedures about the imaging process, the true image, and the PSF. To illustrate the importance of knowing the size of the true PSF, this example performs three restorations. Each time the Read image PSF reconstruction starts from a uniform array--an array of ones. The example reads in an intensity image. The deconvblind function can handle arrays of any dimension. The first restoration, J1 and P1, uses an undersized array, UNDERPSF, for an initial guess of the PSF. The size of the I = imread('cameraman.tif'); UNDERPSF array is 4 pixels shorter in each dimension than figure; the true PSF. imshow(I); title('Original Image'); UNDERPSF = ones (size (PSF)-4); text(size(I,2),size(I,1)+15, ... [J1 P1] = deconvblind (Blurred, UNDERPSF); 'Photographer', ... figure; 'FontSize',7,'HorizontalAlignment','right'); imshow (J1); title('Deblurring with Undersized PSF');

Simulate a blur

The second restoration, J2 and P2, uses an array of ones, OVERPSF, for an initial PSF that is 4 pixels longer in each dimension than the true PSF. Analyzing the restored PSF All three restorations also produce a PSF. The following pictures show how the analysis of the reconstructed PSF might help in guessing the right size for the initial PSF. In the true PSF, a Gaussian filter, the maximum values are at the center (white) and diminish at the borders (black). The PSF reconstructed in the second restoration, P2, becomes very smooth at the edges. This implies that the restoration can handle a PSF of a smaller size. The corresponding image, J2, shows some deblurring but it is strongly corrupted by the ringing.

The third restoration, J3 and P3, uses an array of ones, INITPSF, for an initial PSF that is exactly of the same size as the true PSF.

Finally, the PSF reconstructed in the third restoration, P3, is somewhat intermediate between P1 and P2. The array, P3, resembles the true PSF very well. The corresponding image, J3, shows significant improvement; however it is still corrupted by the ringing.

Mysa Vijayalaxmi received the Bachelors. degree in Electronics and Communication Engineering from JNTUH, Hyderabad, India in 1999 and Masters degree in Digital Systems and Computer Electronics We have presented a method for blind image deblurring. The Design from JNTUH, Hyderabad, India in 2009. She is currently method differs from most other existing methods by only working as an Associate professor in Electronics and Communication imposing weak restrictions on the blurring filter, being able to Engineering department in VITS (N9) Karimnagar, Andhra Pradesh, recover images which have suffered a wide range of India. She has a Life Member ship in ISTE.

V CONCLUSIONS

degradations. Good estimates of both the image and the blurring operator are reached K.Sreedhar received the B.Tech. degree in By initially considering the main image edges. The restoration Electronics and Communication Engineering from quality of our method was visually and quantitatively better JNTUH University, Hyderabad, India in 2005 and than those of the other algorithms such as wiener Filter M.Tech degree in Communication Systems from algorithms, Regularization algorithm and Lucy Richardson with which it was JNTUH University, Hyderabad, India in 2009. He compared. The advantage of our attended the National Conference at Coimbatore, proposed Blind Deconvoultion algorithm Tamilnadu, India on INNOVATIVE WIRELESS is used to deblur the degraded image TECHNOLOGY. He is currently working as an without prior knowledge of PSF and Assistant professor in Electronics and Communication Engineering additive noise. But in other algorithms, department in VITS SET Karimnagar, Andhra Pradesh, India. He has we should have the knowledge over the a Life Member ship in ISTE. blurring parameters. The future work of this paper is to increase the speed of the deblurring process that is reducing the number of iteration using for deblurring the image for achieving better quality image. REFERENCES
[1] Salem Saleh Al-amri et. al. A Comparative Study for Deblurred Average Blurred Images ,journal Vol. 02, No. 03, 2010, 731-733. [2] D. Kundur and D. Hatziankos, Blind Image deconvolution IEEE sig. process. Mag., pp. 43-64, May 1996. [3] A. K. Katsaggelos, Ed., Digital Image Restoration. New York: SpringerVerlag,1991. [4] R. H. T. Bates, Astronomical speckle imaging, Phys. Rep., vol. 90, no. 4, pp. 203297, Oct. 1982. [5] P. Nisenson and R. Barakat, Partial Atmospheric correction with adaptive optics, J. Opt. Soc. Amer. A, vol. 4, pp. 22492253, 1991. [6] D. Kundur and D. Hatzinakos, Blind image restoration via recursive filtering, in Proc. IEEE Int. Conf. Acoust., Speech,Signal Processing, 1996, vol. 4, pp. 2283 2286. [7] Rafael C. Gonzalex, Richard E. Woods, Steven L. Eddins, Digital Image Processing Using MATLAB (Persona Education, Inc) [8] Mariana S.C. Almeida and Luis B. Almeida., Blind and Semi-Blind Deblurring of Natural Images, IEEE Transaction on Image processing, Vol 19, pp.36-52, No.1, January 2010. [9] http://en.wikipedia.org/wiki/PSF.

Amarnath Gaini received the Bachelors. degree in Electronics and Communication Engineering from JNTUH, Hyderabad, India in 2007 and Masters degree in VLSI System Design from JNTUH, Hyderabad, India in 2009. He is currently working as an Assistant professor in Electronics and Communication Engineering department in VITS(N9) Karimnagar, Andhra Pradesh, India . He has a Life Member ship in ISTE. His research interests in digital systems platform