Constrained multiplicative graph cuts based active contour model for magnetic resonance brain image series segmentation

Graph cuts-based active contour model (GCACM) is often used in image segmentation, which can be categorized into additive GCACM and multiplicative GCACM. However, both the additive GCACM and multiplicative GCACM are insufficient for magnetic resonance (MR) brain image series segmentation. Considering the effectiveness of the multiplicative GCACM over the additive GCACM in local segmentation, we propose a new constrained multiplicative GCACM (CM-GCACM) for MR brain image series segmentation, in which, the constraint term is built based on the signed distance function, and can make the segmentation results obtained around the initialized contour. Generally, the deformations between adjacent slices in MR brain series are small, so we only need to give the initialized contour in one selected slice for constrained segmentation, and then the selected slice segmentation result can spread to the adjacent slices, in which case, the segmentation result of the current slicer can be served as the initialized contour for adjacent slices, and the constrained segmentation can be obtained again. By that analogy, we can realize the series segmentation. Experiments on putamen and caudate nucleus segmentation in MR brain image series demonstrate the effectiveness of proposed CM-GCACM over additive GCACM and multiplicative GCACM.

[1]  Wenbing Tao Iterative Narrowband-Based Graph Cuts Optimization for Geodesic Active Contours With Region Forces (GACWRF) , 2012, IEEE Transactions on Image Processing.

[2]  Xuelong Li,et al.  Aurora image segmentation by combining patch and texture thresholding , 2011, Comput. Vis. Image Underst..

[3]  Qiang Zheng,et al.  Graph cuts based active contour model with selective local or global segmentation , 2012 .

[4]  Tao Zhang,et al.  Interactive graph cut based segmentation with shape priors , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[5]  Qiang Zheng,et al.  Modified localized graph cuts based active contour model for local segmentation with surrounding nearby clutter and intensity inhomogeneity , 2013, Signal Process..

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

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

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

[9]  LiXuelong,et al.  Mammographic mass segmentation Embedding multiple features in vector-valued level set in ambiguous regions , 2011 .

[10]  Sung-Jea Ko,et al.  Image segmentation based on modified graph-cut algorithm , 2010 .

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

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

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

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

[15]  John Shawe-Taylor,et al.  MahNMF: Manhattan Non-negative Matrix Factorization , 2012, ArXiv.

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

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