Fast Approximations of Shift-Variant Blur

• Published in: International journal of computer vision Vol. 115; no. 3; pp. 253 - 278
• Main Authors: Denis, Loïc, Thiébaut, Eric, Soulez, Ferréol, Becker, Jean-Marie, Mourya, Rahul
• Format: Journal Article
• Language: English
• Published: New York Springer US 01-12-2015; Springer; Springer Nature B.V; Springer Verlag
• Subjects: Accuracy; Algorithms; Analysis; Approximation; Artificial Intelligence; Astronomy; Blurring; Computation; Computer Imaging; Computer Science; Constants; Decomposition; Engineering Sciences; Fourier transforms; Image Processing and Computer Vision; Image processing systems; Imaging; Inversions; Microscopy; Optics; Pattern Recognition; Pattern Recognition and Graphics; Physics; Preserves; Principal components analysis; Signal and Image processing; Studies; Vision; Wavelet transforms; Blur; Deconvolution; PSF; Inverse problems; Image restoration; deconvolution; blur; image restoration; inverse problems
• ISSN: 0920-5691; 1573-1405
• DOI: 10.1007/s11263-015-0817-x

Image deblurring is essential in high resolution imaging, e.g., astronomy, microscopy or computational photography. Shift-invariant blur is fully characterized by a single point-spread-function (PSF). Blurring is then modeled by a convolution, leading to efficient algorithms for blur simulation and removal that rely on fast Fourier transforms. However, in many different contexts, blur cannot be considered constant throughout the field-of-view, and thus necessitates to model variations of the PSF with the location. These models must achieve a trade-off between the accuracy that can be reached with their flexibility, and their computational efficiency. Several fast approximations of blur have been proposed in the literature. We give a unified presentation of these methods in the light of matrix decompositions of the blurring operator. We establish the connection between different computational tricks that can be found in the literature and the physical sense of corresponding approximations in terms of equivalent PSFs, physically-based approximations being preferable. We derive an improved approximation that preserves the same desirable low complexity as other fast algorithms while reaching a minimal approximation error. Comparison of theoretical properties and empirical performances of each blur approximation suggests that the proposed general model is preferable for approximation and inversion of a known shift-variant blur.