Title :
A convex neighbor-constrained active contour model for image segmentation
Author :
Mao, Hongda ; Liu, Huafeng ; Shi, Pengcheng
Author_Institution :
Comput. Inf. & Sci., Rochester Inst. of Technol., Rochester, NY, USA
Abstract :
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.
Keywords :
convex programming; image segmentation; automatic segmentation; convex neighbor-constrained active contour model; image segmentation; intensity non-homogeneity; split Bregman method; Active contours; Computational modeling; Equations; Image segmentation; Mathematical model; Minimization; Phase change materials; Active Contour; Image Segmentation; Intensity Non-homogeneity; Split Bregman Method;
Conference_Titel :
Image Processing (ICIP), 2010 17th IEEE International Conference on
Conference_Location :
Hong Kong
Print_ISBN :
978-1-4244-7992-4
Electronic_ISBN :
1522-4880
DOI :
10.1109/ICIP.2010.5652625