In this paper we consider error estimation for image restoration problems based on generalized Bregman distances. This error estimation technique has been used to derive convergence rates of variational regularization schemes for linear and nonlinear inverse problems by the authors before, but so far it was not applied to image restoration in a systematic way. Due to the flexibility of the Bregman distances, this approach is particularly attractive for imaging tasks, where often singular energies (nondifferentiable, not strictly convex) are usedto achieve certain tasks such as preservation of edges.
Besides the discussion of the variational image restoration schemes, our main goal in this paper is to extend the error estimation approach to iterative regularization schemes (and time- continuous flows) that have emerged recently as multiscale restoration techniques and could improve some shortcomings of the variational schemes. We derive error estimates between the iterates and the exact image both in the case of clean and noisy data, the latter also giving indications on the choice of termination criteria. The error estimates are applied to various image restoration approaches such as denoising and decomposition by total variation and wavelet methods. We shall see that interesting results for various restoration approaches can be deduced from our general results by just exploring the structure of subgradients.

@Article{BRH07,
  author       = {Burger, M. and Resmerita, E. and He, L.},
  title        = {Error estimation for Bregman iterations and inverse scale space methods},
  journal      = {Computing},
  volume       = {81},
  pages        = {109-135},
  year         = {2007},
  url          = \{/2007/BRH07},
}