Automatic active contour segmentation approach via vector field convolution

Among the segmentation methods proposed in the literature, the active contour models have been widely used in medical images segmentation. This is due to their efficiency to capture complex shapes. Nevertheless, the adequate set of the initial curves for active contours is needed to lead to good automatic segmentation results. An adequate initialization method should set the initial active contour model close enough, to the final targeted boundary, to avoid local minima and to improve computational efficiency. In this paper, we present a new approach, based on the divergence of vector field and the Dijkstra’s algorithm to automatically initialize and give the B-Snake the ability to change topology in presence of multiple objects very close to each other. The divergence of vector fields informs about the vectors spread. Negative divergence indicates that the vectors converge and positive divergence indicates that the vectors diverge. Thus, we used the negative region of the divergence of the vector field convolution (VFC) to set the initial active contour near the objects and the positive divergence region was used to split the B-Snake via Dijkstra algorithm. To demonstrate the effectiveness of the proposed method, we use computed tomography (CT) images of close bones. This method gives good segmentation results, especially on CT images presenting proximities, compared to results obtained by other automatic segmentation methods from the literature.

[1]  Jerry L. Prince,et al.  Generalized gradient vector flow external forces for active contours , 1998, Signal Process..

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

[3]  Dirk-Jan Kroon,et al.  Segmentation of the mandibular canal in cone-beam CT data , 2011 .

[4]  S. Osher,et al.  Algorithms Based on Hamilton-Jacobi Formulations , 1988 .

[5]  M. Shashkov,et al.  A discrete operator calculus for finite difference approximations , 2000 .

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

[7]  Bing Li,et al.  Active Contour External Force Using Vector Field Convolution for Image Segmentation , 2007, IEEE Transactions on Image Processing.

[8]  Chunming Li,et al.  Segmentation of external force field for automatic initialization and splitting of snakes , 2005, Pattern Recognit..

[9]  John E. Bolander,et al.  Numerical Computation of Discrete Differential Operators on Non-Uniform Grids , 2003 .

[10]  Hadj Batatia,et al.  A general quasi-automatic initialization for snakes: application to ultrasound images , 2005, IEEE International Conference on Image Processing 2005.

[11]  Tian Jie,et al.  An automatic active contour model for multiple objects , 2002, Object recognition supported by user interaction for service robots.

[12]  V. Caselles,et al.  A geometric model for active contours in image processing , 1993 .

[13]  James A. Sethian,et al.  The Fast Construction of Extension Velocities in Level Set Methods , 1999 .

[14]  Laurent D. Cohen,et al.  Finite-Element Methods for Active Contour Models and Balloons for 2-D and 3-D Images , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[15]  Laurent D. Cohen,et al.  On active contour models and balloons , 1991, CVGIP Image Underst..

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

[17]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[18]  A.P.S. Selvadurai,et al.  Partial differential equations in mechanics , 2000 .

[19]  A.P.S. Selvadurai,et al.  Fundamentals, Laplace's equation, diffusion equation, wave equation , 2000 .

[20]  Maher Charfi,et al.  Speed Improvement of B-Snake Algorithm Using Dynamic Programming Optimization , 2011, IEEE Transactions on Image Processing.

[21]  Bing Li,et al.  Automatic Active Model Initialization via Poisson Inverse Gradient , 2008, IEEE Transactions on Image Processing.

[22]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods , 1999 .

[23]  Jerry L Prince,et al.  Deformable models with application to human cerebral cortex reconstruction from magnetic resonance images , 1999 .

[24]  Martin D. Fox,et al.  Erratum: Distance regularized level set evolution and its application to image segmentation (IEEE Transactions on Image Processingvol (2010) 19:12 (3243-3254)) , 2011 .

[25]  Dong Joong Kang,et al.  A fast and stable snake algorithm for medical images , 1999, Pattern Recognition Letters.

[26]  J. Tsitsiklis,et al.  Efficient algorithms for globally optimal trajectories , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[27]  Ming-Syan Chen,et al.  A New Approach to Image Copy Detection Based on Extended Feature Sets , 2007, IEEE Transactions on Image Processing.

[28]  J. Sethian,et al.  A Fast Level Set Method for Propagating Interfaces , 1995 .

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

[30]  Chohong Min,et al.  On reinitializing level set functions , 2010, J. Comput. Phys..

[31]  Ramesh C. Jain,et al.  Using Dynamic Programming for Solving Variational Problems in Vision , 1990, IEEE Trans. Pattern Anal. Mach. Intell..