Image Restoration with Discrete Constrained Total Variation Part I: Fast and Exact Optimization

  • Authors:
  • Jérôme Darbon;Marc Sigelle

  • Affiliations:
  • Aff1 Aff2;École Nationale Supérieure des Télécommunications (ENST) / LTCI CNRS UMR 5141, Paris, France F-75013

  • Venue:
  • Journal of Mathematical Imaging and Vision
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper deals with the total variation minimization problem in image restoration for convex data fidelity functionals. We propose a new and fast algorithm which computes an exact solution in the discrete framework. Our method relies on the decomposition of an image into its level sets. It maps the original problems into independent binary Markov Random Field optimization problems at each level. Exact solutions of these binary problems are found thanks to minimum cost cut techniques in graphs. These binary solutions are proved to be monotone increasing with levels and yield thus an exact solution of the discrete original problem. Furthermore we show that minimization of total variation under L 1 data fidelity term yields a self-dual contrast invariant filter. Finally we present some results.