Split Bregman - Globally Convex Segmentation

Versión 1.0.0.0 (3,23 KB) por Ander Biguri
SB-GCS, L1 regularized fast, convex, level set segmentation technique
5.0
(1)
503 descargas
Actualizado 7 mar 2018

Ver licencia

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.

Citar como

Ander Biguri (2024). Split Bregman - Globally Convex Segmentation (https://www.mathworks.com/matlabcentral/fileexchange/66413-split-bregman-globally-convex-segmentation), MATLAB Central File Exchange. Recuperado .

Compatibilidad con la versión de MATLAB
Se creó con R2017a
Compatible con cualquier versión
Compatibilidad con las plataformas
Windows macOS Linux
Agradecimientos

Inspirado por: level set for image segmentation

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

SP_GCS/

Versión Publicado Notas de la versión
1.0.0.0