Denoising by BV-duality

  • Authors:
  • Stefan Kindermann;Stanley Osher;Jinjun Xu

  • Affiliations:
  • Department of Mathematics, UCLA, Los Angeles, USA 90095;Department of Mathematics, UCLA, Los Angeles, USA 90095;Department of Mathematics, UCLA, Los Angeles, USA 90095

  • Venue:
  • Journal of Scientific Computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we apply Meyer's G-norm for image processing problems. We use a definition of the G-norm as norm of linear functionals on BV, which seems to be more feasible for numerical computation. We establish the equivalence between Meyer's original definition and ours and show that computing the norm can be expressed as an interface problem. This allows us to define an algorithm based on the level set method for its solution. Alternatively we propose a fixed point method based on mean curvature type equations. A computation of the G-norm according to our definition additionally gives functions which can be used for denoising of simple structures in images under a high level of noise. We present some numerical computations of this denoising method which support this claim.