DEeP random walks

In this paper, we proposed distance enforced penalized (DEeP) random walks segmentation framework to delineate coupled boundaries by modifying classical random walks formulations. We take into account curves inter-dependencies and incorporate associated distances into weight function of conventional random walker. This effectively leverages segmentation of weaker boundaries guided by stronger counterparts, which is the main advantage over classical random walks techniques where the weight function is only dependent on intensity differences between connected pixels, resulting in unfavorable outcomes in the context of poor contrasted images. First, we applied our developed algorithm on synthetic data and then on cardiac magnetic resonance (MR) images for detection of myocardium borders. We obtained encouraging results and observed that proposed algorithm prevents epicardial border to leak into right ventricle or cross back into endocardial border that often observe when conventional random walker is used. We applied our method on forty cardiac MR images and quantified the results with corresponding manual traced borders as ground truths. We found the Dice coefficients 70%± 14% and 43% ±14% respectively for DEeP random walks and conventional one.

[1]  Chunming Li,et al.  Level set evolution without re-initialization: a new variational formulation , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[2]  Eigil Samset,et al.  Unifying Statistical Classification and Geodesic Active Regions for Segmentation of Cardiac MRI , 2008, IEEE Transactions on Information Technology in Biomedicine.

[3]  Marcel Breeuwer,et al.  Detection of left ventricular epi-and endocardial borders using coupled active contours , 2003, CARS.

[4]  Paul F. Whelan,et al.  Left-ventricle myocardium segmentation using a coupled level-set with a priori knowledge , 2006, Comput. Medical Imaging Graph..

[5]  Caroline Petitjean,et al.  A review of segmentation methods in short axis cardiac MR images , 2011, Medical Image Anal..

[6]  Leo Grady,et al.  Random Walks for Image Segmentation , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Li Wenna,et al.  Improved random walker interactive image segmentation algorithm for texture image segmentation , 2011, 2011 Chinese Control and Decision Conference (CCDC).

[8]  William A. Barrett,et al.  Interactive Segmentation with Intelligent Scissors , 1998, Graph. Model. 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]  Dinggang Shen,et al.  Automatic segmentation of neonatal images using convex optimization and coupled level sets , 2011, NeuroImage.

[12]  R Kikinis,et al.  Automatic identification of gray matter structures from MRI to improve the segmentation of white matter lesions. , 1995, Journal of image guided surgery.