GRAPH CUT SEGMENTATION METHOD AND ITS APPLICATION IN MEDICAL IMAGES
DOI:
https://doi.org/10.11113/jt.v75.5061Keywords:
Graph cut, segmentation, image processingAbstract
Graph cut is an interactive segmentation method. It works based on preparing graph from image and finds the minimum cut for the graph. The edges value is calculated based on belonging a pixel to object or background. The advantage of this method is using the cost function. If the cost function is clearly described, graph cut is presents a generally optimum result. In this paper graph concepts and preparing graph according to image pixels is described. Preparing different edges and performing min cut/max flow is explained. Finally, the method is applied on some medical images. Â
References
Boykov, Y. and M. P. Jolly. 2001. Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images. In International Conference on Computer Vision. Vancouver,Canada. 7-14 July 2001. 105-112.
Rother, C., V. Kolmogorov and A. Blake. 2004. GrabCut—Interactive Foreground Extraction using Iterated Graph Cuts. Journal of ACM Transactions on Graphics (TOG)-Proceedings of ACM SIGGRAPH. 23(13): 309-341.
Li, Y., J. Sun, C.K. Tang and H.-Y. Shum. 2004. Lazy Snapping. Journal of ACM Transaction on Graphics–Proceedings of ACM SIGGRAPH 2004. 23(13): 303-308.
Booykov, Y. and G. Funka-Lea. 2006. Graph Cuts and Efficient N-D Image Segmentation. International Journal of Computer Vision. 70(2): 109-131.
Peng, B. and O. Veksler. 2008. Parameter Selection for Graph Cut based Image Segmentation. In British Machine Vision Conference. Leeds, UK. 1-4 September 2008. 16.1-16.10.
Kolmogorov, V., Y. I. Boykov and C. Rother. 2007. Applications of Parametric Maxflow in Computer Vision. In IEEE 11th International Conference on Computer Vision (ICCV 2007). Rio de Janeiro. 14-21 October 2007. 1-8.
Ford, L. and D. Fulkerson. 1962. Flows in Networks: Princeton University Press.
Goldberg, A.V. and R.E. Tarjan. 1988. A New Approach to the Maximum-Flow Problem. Journal of the Association for Computing Machinery. 35(4): 921-940.
Downloads
Published
Issue
Section
License
Copyright of articles that appear in Jurnal Teknologi belongs exclusively to Penerbit Universiti Teknologi Malaysia (Penerbit UTM Press). This copyright covers the rights to reproduce the article, including reprints, electronic reproductions, or any other reproductions of similar nature.
