Modified localized graph cuts based active contour model for local segmentation with surrounding nearby clutter and intensity inhomogeneity

Graph cuts based active contour models (GCACMs) have been widely used in image segmentation for global minimization and efficient calculation. For local segmentation, the localized GCACMs (LGCACMs) have been proposed by reformulating GCACMs in a narrow band. However, the existing LGCACMs cannot deal with local segmentation with surrounding nearby clutter and intensity inhomogeneity. In this paper, a modified LGCACM (MLGCACM) with a new narrow band energy function is proposed to solve local segmentation in the presence of surrounding nearby clutter and intensity inhomogeneity. Firstly, by removing the region term in the narrow band energy function, the narrow band graph can be constructed without t-links, in which case, local segmentation with surrounding nearby clutter can be solved. Secondly, by strengthening the edge term in the narrow band energy function with a new local region term, the n-links in the narrow band graph can be weighted more suitably for local segmentation with intensity inhomogeneity. Experiments on synthetic and medical images demonstrate the advantages of the proposed MLGCACM over the existing LGCACMs in local segmentation with surrounding nearby clutter and intensity inhomogeneity.

[1]  Adel Said Elmaghraby,et al.  A graph cut based active contour without edges with relaxed homogeneity constraint , 2008, 2008 19th International Conference on Pattern Recognition.

[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]  Wenbing Tao.  Iterative Narrowband-Based Graph Cuts Optimization for Geodesic Active Contours With Region Forces (GACWRF) , 2012, IEEE Transactions on Image Processing.

[4]  Yan Wang,et al.  Active contours driven by weighted region-scalable fitting energy based on local entropy , 2012, Signal Process..

[5]  Chunming Li,et al.  Active contours driven by local Gaussian distribution fitting energy , 2009, Signal Process..

[6]  T. Chan.  NON-LOCAL UNSUPERVISED VARIATIONAL IMAGE SEGMENTATION MODELS , 2008 .

[7]  Olga Veksler,et al.  Fast approximate energy minimization via graph cuts , 2001, Proceedings of the Seventh IEEE International Conference on Computer Vision.

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

[9]  Marie-Pierre Jolly,et al.  Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images , 2001, ICCV.

[10]  Vladimir Kolmogorov,et al.  An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision , 2001, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Chunming Li,et al.  Minimization of Region-Scalable Fitting Energy for Image Segmentation , 2008, IEEE Transactions on Image Processing.

[12]  Adel Said Elmaghraby,et al.  Graph cut optimization for the Mumford-Shah model , 2007 .

[13]  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.

[14]  Jin Liu,et al.  A variational model and graph cuts optimization for interactive foreground extraction , 2011, Signal Process..

[15]  Ning Xu,et al.  Object segmentation using graph cuts based active contours , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[16]  Vladimir Kolmogorov,et al.  What energy functions can be minimized via graph cuts? , 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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