Geometric Applications of the Split Bregman Method: Segmentation and Surface Reconstruction

  • Authors:

  • Tom Goldstein;Xavier Bresson;Stanley Osher

  • Affiliations:

  • Department of Mathematics, UCLA, Los Angeles, USA 90095-1555;Department of Mathematics, UCLA, Los Angeles, USA 90095-1555;Department of Mathematics, UCLA, Los Angeles, USA 90095-1555

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

Variational models for image segmentation have many applications, but can be slow to compute. Recently, globally convex segmentation models have been introduced which are very reliable, but contain TV-regularizers, making them difficult to compute. The previously introduced Split Bregman method is a technique for fast minimization of L1 regularized functionals, and has been applied to denoising and compressed sensing problems. By applying the Split Bregman concept to image segmentation problems, we build fast solvers which can out-perform more conventional schemes, such as duality based methods and graph-cuts. The convex segmentation schemes also substantially outperform conventional level set methods, such as the Chan-Vese level set-based segmentation algorithm. We also consider the related problem of surface reconstruction from unorganized data points, which is used for constructing level set representations in 3 dimensions. The primary purpose of this paper is to examine the effectiveness of "Split Bregman" techniques for solving these problems, and to compare this scheme with more conventional methods.