Total Variation Deconvolution using Split Bregman

Full text Online demo Source code

P. Getreuer, “Total Variation Deconvolution using Split Bregman,” Image Processing On Line, 2012. DOI: 10.5201/ipol.2012.g-tvdc.

Article permalink: http://dx.doi.org/10.5201/ipol.2012.g-tvdc

@article{getreuer2012tvdeconvolution,
    title = {Total Variation Deconvolution using Split {Bregman}},
    author = {Pascal Getreuer},
    journal = {Image Processing On Line},
    year = {2012},
    doi = {10.5201/ipol.2012.g-tvdc},
}

Abstract

Deblurring is the inverse problem of restoring an image that has been blurred and possibly corrupted with noise. Deconvolution refers to the case where the blur to be removed is linear and shift-invariant so it may be expressed as a convolution of the image with a point spread function. Convolution corresponds in the Fourier domain to multiplication, and deconvolution is essentially Fourier division. The challenge is that since the multipliers are often small for high frequencies, direct division is unstable and plagued by noise present in the input image. Effective deconvolution requires a balance between frequency recovery and noise suppression.

Total variation (TV) regularization is a successful technique for achieving this balance in deblurring problems. It was originally developed for image denoising by Rudin, Osher, and Fatemi and then applied to deconvolution by Rudin and Osher. In this article, we discuss TV-regularized deconvolution with Gaussian noise and its efficient solution using the split Bregman algorithm of Goldstein and Osher. We show a straightforward extension for Laplace or Poisson noise and develop empirical estimates for the optimal value of the regularization parameter λ.