Robust parametric blur identification for motion blurred image under noisy conditions
by Saurabh Mishra; R.S. Sengar; R.K. Puri; D.N. Badodkar
International Journal of Image Mining (IJIM), Vol. 1, No. 4, 2015

Abstract: Identification of blur parameters is the key problem towards restoration of noisy motion blurred image. This paper presents a novel algorithm to estimate linear motion blur parameters such as motion direction and blur length under noisy conditions. The blurred image is pre-processed, dual Fourier transformed and bit-plane sliced subsequently. The blur angle is estimated accurately by radon transform of a specific bit plane selected through criteria based on image entropy. To mitigate the effect of noise on blur length estimation, the image is processed in bispectrum domain as the bispectrum has a characteristic to suppress additive Gaussian noise. A robust exponential model is proposed that represents the behaviour of blur length in bispectrum domain. The proposed algorithm is tested on several standard images. The maximum errors observed in the estimated blur angle and the blur length is less than 1.6° and 2 pixels respectively in presence of additive Gaussian noise. Experimental results obtained from the proposed algorithm are also compared with the previous algorithms to demonstrate its superior performance.

Online publication date: Tue, 29-Dec-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Image Mining (IJIM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com