Prostate Segmentation from 2-D Ultrasound Images Using Graph Cuts and Domain Knowledge

In this paper we present a graph cuts based segmentation technique that incorporates the domain knowledge based fuzzy inference system to find the prostate boundary more accurately. By using this prior knowledge, we increase the robustness of the algorithm at weak boundaries which are common in ultrasound images. Also in traditional graph cuts algorithm, corrections on segments will be done by user after the first run, but in the proposed method there is no user interaction after initialization and we use the priors to add hard constraints for the second run of the graph cuts.

[1]  Vladimir Kolmogorov,et al.  An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision , 2004, IEEE Trans. Pattern Anal. Mach. Intell..

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

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

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

[5]  K. Ling,et al.  Prostate Boundary Detection From Ultrasonographic Images , 2003, Journal of ultrasound in medicine : official journal of the American Institute of Ultrasound in Medicine.

[6]  Aaron Fenster,et al.  Prostate segmentation by feature enhancement using domain knowledge and adaptive region based operations , 2006, Physics in medicine and biology.

[7]  Gareth Funka-Lea,et al.  Graph Cuts and Efficient N-D Image Segmentation , 2006, International Journal of Computer Vision.