A convex neighbor-constrained active contour model for image segmentation

A large number of real images possess the property of intensity non-homogeneity, which hinders them from being segmented by many image segmentation approaches. Recently, region-based active contour models utilizing local information have been introduced to segment images with intensity non-homogeneity. However, all these models are not convex, thus a good initial guess is required, which limits their practical application. In this paper, we propose a convex neighbor-constrained active contour model to segment images with intensity non-homogeneity. With different shapes and sizes of the neighborhood for each point, our model can accurately capture the region information of a given image. Our model is convex, and therefore it is independent of the initial condition and allows for automatic segmentation. To minimize energy functional of the model, we choose the efficient and fast Split Bregman method. Experimental results on synthetic and real images demonstrate the superior performance of our model.

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

[2]  Tony F. Chan,et al.  A Multiphase Level Set Framework for Image Segmentation Using the Mumford and Shah Model , 2002, International Journal of Computer Vision.

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

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

[5]  Théodore Papadopoulo,et al.  Efficient Segmentation of Piecewise Smooth Images , 2007, SSVM.

[6]  Baba C. Vemuri,et al.  Shape Modeling with Front Propagation: A Level Set Approach , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

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

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

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

[10]  Huafeng Liu,et al.  Neighbor-constrained active contours without edges , 2008, 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops.

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

[12]  Chunming Li,et al.  Implicit Active Contours Driven by Local Binary Fitting Energy , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

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