The Equivalence of the Taut String Algorithm and BV-Regularization

  • Authors:
  • Markus Grasmair

  • Affiliations:
  • Department of Computer Science, University of Innsbruck, Innsbruck, Austria A---6020

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

It is known that discrete BV-regularization and the taut string algorithm are equivalent. In this paper we extend this result to the continuous case. First we derive necessary equations for the solution of both BV-regularization and the taut string algorithm by computing suitable Gateaux derivatives. The equivalence then follows from a uniqueness result.