Active contours without level sets

This paper deals with the problem of segmenting an image with active contours. We explain how recent convexification methods allow now to use active contours without level sets with simple and efficient first order schemes. We recall different algorithms proposed in the literature, and we propose a new variant. Numerical experiments in 2D and 3D confirm the interest of the approach.

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

[2]  B. V. Dean,et al.  Studies in Linear and Non-Linear Programming. , 1959 .

[3]  Mingqiang Zhu,et al.  An Efficient Primal-Dual Hybrid Gradient Algorithm For Total Variation Image Restoration , 2008 .

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

[5]  R. Tyrrell Rockafellar,et al.  Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming , 1976, Math. Oper. Res..

[6]  Marie-Pierre Jolly,et al.  Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[7]  B. V. Dean,et al.  Studies in Linear and Non-Linear Programming. , 1959 .

[8]  J. Sethian,et al.  FRONTS PROPAGATING WITH CURVATURE DEPENDENT SPEED: ALGORITHMS BASED ON HAMILTON-JACOB1 FORMULATIONS , 2003 .

[9]  Daniel Cremers,et al.  Global Solutions of Variational Models with Convex Regularization , 2010, SIAM J. Imaging Sci..

[10]  Antonin Chambolle,et al.  A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging , 2011, Journal of Mathematical Imaging and Vision.

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

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

[13]  Xavier Bresson,et al.  Completely Convex Formulation of the Chan-Vese Image Segmentation Model , 2012, International Journal of Computer Vision.

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

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

[16]  Xue-Cheng Tai,et al.  Global Minimization for Continuous Multiphase Partitioning Problems Using a Dual Approach , 2011, International Journal of Computer Vision.

[17]  Gjlles Aubert,et al.  Mathematical problems in image processing , 2001 .

[18]  Samuel Karlin,et al.  Studies in Linear and Non-Linear Programming. , 1959 .

[19]  Pau Gargallo,et al.  A Narrow Band Method for the Convex Formulation of Discrete Multilabel Problems , 2010, Multiscale Model. Simul..

[20]  Daniel Cremers,et al.  A Convex Formulation of Continuous Multi-label Problems , 2008, ECCV.