Split Bregman - Globally Convex Segmentation

SB-GCS, L1 regularized fast, convex, level set segmentation technique

This Matlab code implements an edge-based active contour model as an application of the Split Bregman Globally Convex Segmentation (SP-GCS) formulation in Goldstein et al's paper:
Tom Goldstein, Xavier Bresson, Stanley Osher,
"Geometric Applications of the Split Bregman Method: Segmentation and Surface Reconstruction",
Journal of Scientific Computing, vol. 45 (1-3), pp 272–293, 2010.
The method is very fast, and has reduced parameters comparing to standard level set methods. The algorithm requires no initialization and converges very quickly. Due to the L1 regularized for the level set, the final contour is highly independent from the level chosen, most values between 0-1 will result in a good segmentation.