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

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.

[1]  Wotao Yin,et al.  An Iterative Regularization Method for Total Variation-Based Image Restoration , 2005, Multiscale Model. Simul..

[2]  Ronald Fedkiw,et al.  Level set methods and dynamic implicit surfaces , 2002, Applied mathematical sciences.

[3]  Gene H. Golub,et al.  A Nonlinear Primal-Dual Method for Total Variation-Based Image Restoration , 1999, SIAM J. Sci. Comput..

[4]  Olga Veksler,et al.  Fast Approximate Energy Minimization via Graph Cuts , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Guillermo Sapiro,et al.  Geodesic Active Contours , 1995, International Journal of Computer Vision.

[6]  J. Sethian,et al.  Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations , 1988 .

[7]  M. Burger,et al.  Projected Gradient Flows for BV/Level Set Relaxation , 2005 .

[8]  Wotao Yin,et al.  Analysis and Generalizations of the Linearized Bregman Method , 2010, SIAM J. Imaging Sci..

[9]  Tony DeRose,et al.  Surface reconstruction from unorganized points , 1992, SIGGRAPH.

[10]  Simon Setzer,et al.  Split Bregman Algorithm, Douglas-Rachford Splitting and Frame Shrinkage , 2009, SSVM.

[11]  Jean-Daniel Boissonnat,et al.  Geometric structures for three-dimensional shape representation , 1984, TOGS.

[12]  Ronald Fedkiw,et al.  Particle Level Set Method , 2003 .

[13]  Alfred M. Bruckstein,et al.  Regularized Laplacian Zero Crossings as Optimal Edge Integrators , 2003, International Journal of Computer Vision.

[14]  I. Johnstone,et al.  Adapting to Unknown Smoothness via Wavelet Shrinkage , 1995 .

[15]  L. Rudin,et al.  Nonlinear total variation based noise removal algorithms , 1992 .

[16]  S. Osher,et al.  Geometric Level Set Methods in Imaging, Vision, and Graphics , 2011, Springer New York.

[17]  J. Sethian,et al.  A geometric approach to segmentation and analysis of 3D medical images , 1996, Proceedings of the Workshop on Mathematical Methods in Biomedical Image Analysis.

[18]  Stanley Osher,et al.  Implicit and Nonparametric Shape Reconstruction from Unorganized Data Using a Variational Level Set Method , 2000, Comput. Vis. Image Underst..

[19]  D. F. Rogers,et al.  An Introduction to NURBS: With Historical Perspective , 2011 .

[20]  Anthony J. Yezzi,et al.  A geometric snake model for segmentation of medical imagery , 1997, IEEE Transactions on Medical Imaging.

[21]  Stanley Osher,et al.  Level Set Methods , 2003 .

[22]  ANTONIN CHAMBOLLE,et al.  An Algorithm for Total Variation Minimization and Applications , 2004, Journal of Mathematical Imaging and Vision.

[23]  Xavier Bresson,et al.  Fast Global Minimization of the Active Contour/Snake Model , 2007, Journal of Mathematical Imaging and Vision.

[24]  Antonin Chambolle,et al.  On Total Variation Minimization and Surface Evolution Using Parametric Maximum Flows , 2009, International Journal of Computer Vision.

[25]  Xavier Bresson,et al.  Active Contours Based on Chambolle's Mean Curvature Motion , 2007, 2007 IEEE International Conference on Image Processing.

[26]  Àlex Haro,et al.  A Parameterization Method for the Computation of Invariant Tori and Their Whiskers in Quasi-Periodic Maps: Explorations and Mechanisms for the Breakdown of Hyperbolicity , 2008 .

[27]  Xavier Bresson,et al.  White matter fiber tract segmentation in DT-MRI using geometric flows , 2005, Medical Image Anal..

[28]  Mila Nikolova,et al.  Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models , 2006, SIAM J. Appl. Math..

[29]  Wotao Yin,et al.  Bregman Iterative Algorithms for (cid:2) 1 -Minimization with Applications to Compressed Sensing ∗ , 2008 .

[30]  A. Chambolle.  An algorithm for Mean Curvature Motion , 2004 .

[31]  S. Osher,et al.  Fast surface reconstruction using the level set method , 2001, Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision.

[32]  Junfeng Yang,et al.  A New Alternating Minimization Algorithm for Total Variation Image Reconstruction , 2008, SIAM J. Imaging Sci..

[33]  Antonin Chambolle,et al.  Dual Norms and Image Decomposition Models , 2005, International Journal of Computer Vision.

[34]  S. Osher,et al.  A level set approach for computing solutions to incompressible two-phase flow , 1994 .

[35]  Ernie Esser,et al.  Applications of Lagrangian-Based Alternating Direction Methods and Connections to Split Bregman , 2009 .

[36]  Milan Sonka,et al.  Intrathoracic airway trees: segmentation and airway morphology analysis from low-dose CT scans , 2005, IEEE Transactions on Medical Imaging.

[37]  A. Chambolle.  Practical, Unified, Motion and Missing Data Treatment in Degraded Video , 2004, Journal of Mathematical Imaging and Vision.

[38]  J. Sethian,et al.  A Fast Level Set Method for Propagating Interfaces , 1995 .

[39]  Daniel P. Huttenlocher,et al.  Efficient Graph-Based Image Segmentation , 2004, International Journal of Computer Vision.

[40]  D. Mumford,et al.  Optimal approximations by piecewise smooth functions and associated variational problems , 1989 .

[41]  Jitendra Malik,et al.  Blobworld: Image Segmentation Using Expectation-Maximization and Its Application to Image Querying , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[42]  Demetri Terzopoulos,et al.  Snakes: Active contour models , 2004, International Journal of Computer Vision.

[43]  Yin Zhang,et al.  A Fast Algorithm for Image Deblurring with Total Variation Regularization , 2007 .

[44]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid , 2012 .

[45]  F. Almgren,et al.  Curvature-driven flows: a variational approach , 1993 .

[46]  Taku Komura,et al.  Topology matching for fully automatic similarity estimation of 3D shapes , 2001, SIGGRAPH.

[47]  Marshall W. Bern,et al.  A new Voronoi-based surface reconstruction algorithm , 1998, SIGGRAPH.

[48]  L. Bregman.  The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming , 1967 .

[49]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[50]  Jérôme Darbon,et al.  A Fast and Exact Algorithm for Total Variation Minimization , 2005, IbPRIA.

[51]  Tom Goldstein,et al.  The Split Bregman Method for L1-Regularized Problems , 2009, SIAM J. Imaging Sci..

[52]  Wotao Yin,et al.  Parametric Maximum Flow Algorithms for Fast Total Variation Minimization , 2009, SIAM J. Sci. Comput..

[53]  Tony F. Chan,et al.  Active contours without edges , 2001, IEEE Trans. Image Process..