By Topic

Image Multidistortion Estimation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
AndrĂ© L. Caron ; MOIVRE Research Center, Université de Sherbrooke, Sherbrooke, Canada ; Pierre-Marc Jodoin

We present a method for estimating the amount of noise and blur in a distorted image. Our method is based on the multiscale structural similarity (MS-SSIM) framework that, although designed to measure image quality, is used to estimate the amount of blur and noise in a degraded image given a reference image. We show that there exists a bijective mapping between the 2-D noise/blur space and the 3-D MS-SSIM space, which allows to recover distortion parameters. That mapping allows to formulate the multidistortion-estimation problem as a classical optimization problem. Various search strategies such as Newton, simplex, NewUOA, and brute-force search are presented and compared. We also show that a bicubic patch can be used to approximate the bijective mapping between the noise/blur space and the 3-D MS-SSIM space. Interestingly, the use of such a patch reduces the processing time by a factor of 40 without significantly reducing precision. Based on quantitative results, we show that the amount of different types of blur and noise in a distorted image can be recovered with accuracy of roughly 2% and 8%, respectively. Our methods are compared with four state-of-the-art noise- and blur-estimation techniques.

Published in:

IEEE Transactions on Image Processing  (Volume:20 ,  Issue: 12 )