Total Variation Blind Deconvolution: The Devil Is in the Details

• Published in: 2014 IEEE Conference on Computer Vision and Pattern Recognition pp. 2909 - 2916
• Main Authors: Perrone, Daniele, Favaro, Paolo
• Format: Conference Proceeding Journal Article
• Language: English
• Published: IEEE 01.06.2014
• Subjects: Adaptation; Algorithm design and analysis; Algorithms; blind deconvolution; Blinds; Convolution; deblurring; Deconvolution; Energy conservation; Energy of solution; Iterative methods; Kernel; Mathematical models; maximum a posteriori; Minimization; Pattern recognition; Signal processing algorithms; total variation
• ISSN: 1063-6919; 1063-6919
• DOI: 10.1109/CVPR.2014.372

In this paper we study the problem of blind deconvolution. Our analysis is based on the algorithm of Chan and Wong [2] which popularized the use of sparse gradient priors via total variation. We use this algorithm because many methods in the literature are essentially adaptations of this framework. Such algorithm is an iterative alternating energy minimization where at each step either the sharp image or the blur function are reconstructed. Recent work of Levin et al. [14] showed that any algorithm that tries to minimize that same energy would fail, as the desired solution has a higher energy than the no-blur solution, where the sharp image is the blurry input and the blur is a Dirac delta. However, experimentally one can observe that Chan and Wong's algorithm converges to the desired solution even when initialized with the no-blur one. We provide both analysis and experiments to resolve this paradoxical conundrum. We find that both claims are right. The key to understanding how this is possible lies in the details of Chan and Wong's implementation and in how seemingly harmless choices result in dramatic effects. Our analysis reveals that the delayed scaling (normalization) in the iterative step of the blur kernel is fundamental to the convergence of the algorithm. This then results in a procedure that eludes the no-blur solution, despite it being a global minimum of the original energy. We introduce an adaptation of this algorithm and show that, in spite of its extreme simplicity, it is very robust and achieves a performance comparable to the state of the art.