A Logarithmic Image Prior for Blind Deconvolution

Perrone, Daniele; Favaro, Paolo (2015). A Logarithmic Image Prior for Blind Deconvolution. International journal of computer vision, 117(2), pp. 159-172. Springer 10.1007/s11263-015-0857-2

Preview	Text A Logarithmic Image Prior for Blind Deconvolution.pdf - Published Version Available under License Publisher holds Copyright. Download (3MB) | Preview
Preview	Text logtv-1.pdf - Accepted Version Available under License Publisher holds Copyright. Download (6MB) | Preview

Blind Deconvolution consists in the estimation of a sharp image and a blur kernel from an observed blurry image. Because the blur model admits several solutions it is necessary to devise an image prior that favors the true blur kernel and sharp image. Many successful image priors enforce the sparsity of the sharp image gradients. Ideally the L0 “norm” is the best choice for promoting sparsity, but because it is computationally intractable, some methods have used a logarithmic approximation. In this work we also study a logarithmic image prior. We show empirically how well the prior suits the blind deconvolution problem. Our analysis confirms experimentally the hypothesis that a prior should not necessarily model natural image statistics to correctly estimate the blur kernel. Furthermore, we show that a simple Maximum a Posteriori formulation is enough to achieve state of the art results. To minimize such formulation we devise two iterative minimization algorithms that cope with the non-convexity of the logarithmic prior: one obtained via the primal-dual approach and one via majorization-minimization.

Interest & Impact

Downloads

454 since deposited on 29 Jun 2016
62 in the past 12 months

Citations

5 Citations in Web of Science ®
6 Citations in Scopus

Search

in Google Scholar™

Services

Actions (login required)

Edit item

Actions (login required)

Edit item