A fast and exact algorithm for total variation minimization

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

  • Affiliations:
  • EPITA Research and Development Laboratory (LRDE), Le Kremlin-Bicêtre, France;ENST / LTCI CNRS UMR 5141, Paris, France

  • Venue:
  • IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part I
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper deals with the minimization of the total variation under a convex data fidelity term. We propose an algorithm which computes an exact minimizer of this problem. The method relies on the decomposition of an image into its level sets. Using these level sets, we map the problem into optimizations of independent binary Markov Random Fields. Binary solutions are found thanks to graph-cut techniques and we show how to derive a fast algorithm. We also study the special case when the fidelity term is the L1-norm. Finally we provide some experiments.