Image segmentation based on local Chan-Vese model optimized by max-flow algorithm

Image segmentation can be used in non-destructive testing, tracking and recognition. Level set method for image segmentation has poor performance on efficiency. In this paper, we propose to use max-flow algorithm to optimize a locally improved Chan-Vese model for image segmentation in the presence of intensity inhomogeneity. The energy function of local Chan-Vese model is introduced firstly. This model consists of global term, local term and penalty term and the local term contributes the segmentation for images with intensity inhomogeneity. Then, we convert this energy function to the frame of Graph Cut whose energy function can be efficiently minimized by max-flow algorithm. As a result, the process of optimization of local Chan-Vese model can be accelerated by using max-flow algorithm. The experiments demonstrate that the proposed method can achieve satisfactory segmentation for images with intensity inhomogeneity as well as very high efficiency.

[1]  Chunming Li,et al.  A Level Set Method for Image Segmentation in the Presence of Intensity Inhomogeneities With Application to MRI , 2011, IEEE Transactions on Image Processing.

[2]  Xiaofeng Wang,et al.  An efficient local Chan-Vese model for image segmentation , 2010, Pattern Recognit..

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

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

[5]  Xue-Cheng Tai,et al.  Graph Cut Optimization for the Piecewise Constant Level Set Method Applied to Multiphase Image Segmentation , 2009, SSVM.

[6]  S. Osher,et al.  Total variation and level set methods in image science , 2005, Acta Numerica.

[7]  Xue-Cheng Tai,et al.  A spatially continuous max-flow and min-cut framework for binary labeling problems , 2014, Numerische Mathematik.

[8]  Li Zeng,et al.  An Active Contour Model for the Segmentation of Images with Intensity Inhomogeneities and Bias Field Estimation , 2015, PloS one.

[9]  Vladimir Kolmogorov,et al.  Computing geodesics and minimal surfaces via graph cuts , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[10]  Chunming Li,et al.  Distance Regularized Level Set Evolution and Its Application to Image Segmentation , 2010, IEEE Transactions on Image Processing.

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

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

[13]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[14]  Xue-Cheng Tai,et al.  Efficient Global Minimization Methods for Image Segmentation Models with Four Regions , 2014, Journal of Mathematical Imaging and Vision.

[15]  David Zhang,et al.  A Level Set Approach to Image Segmentation With Intensity Inhomogeneity , 2016, IEEE Transactions on Cybernetics.

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

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