OPTIMAL AND EFFICIENT SEGMENTATION FOR 3D VASCULAR FOREST STRUCTURE WITH GRAPH CUTS

被引:0
作者
Zhu, Ning [1 ]
Chung, Albert C. S. [1 ]
机构
[1] Hong Kong Univ Sci & Technol, Lo Kwee Seong Med Image Anal Lab, Dept Comp Sci & Engn, Hong Kong, Hong Kong, Peoples R China
来源
2013 20TH IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP 2013) | 2013年
关键词
Graph Cuts; Optimal Segmentation; 3D Vascular Forest; IMAGES;
D O I
暂无
中图分类号
TB8 [摄影技术];
学科分类号
0804 ;
摘要
In this paper, we propose an optimal segmentation method for vascular forest structure based on graph cuts framework, which has widely been used in recent years because of its global optimal object segmentation property. However, shrinking bias, a classical issue of the graph cuts methods, sets up a barrier for the use of these methods on elongated structures such as blood vessels, especially the complex vascular tree and forest structures. To deal with this problem, a new graph construction method and a new energy function are proposed in this paper. The global optimal segmentation of vascular forest structure can be obtained more efficiently, while the shrinking bias can be overcome by the proposed method. The method is compared with a classical graph cuts method [1] and two methods [2, 3] for vascular tree structure segmentation, and is demonstrated to be more accurate on both the synthetic and clinical images, especially on noisy images. Different from many other tree structure segmentation methods, the proposed method does not have to consider the bifurcations explicitly.
引用
收藏
页码:1135 / 1139
页数:5
相关论文
共 15 条
[1]   Segmentation of interwoven 3d tubular tree structures utilizing shape priors and graph cuts [J].
Bauer, Christian ;
Pock, Thomas ;
Sorantin, Erich ;
Bischof, Horst ;
Beichel, Reinhard .
MEDICAL IMAGE ANALYSIS, 2010, 14 (02) :172-184
[2]   An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision [J].
Boykov, Y ;
Kolmogorov, V .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2004, 26 (09) :1124-1137
[3]   Graph cuts and efficient N-D image segmentation [J].
Boykov, Yuri ;
Funka-Lea, Gareth .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 2006, 70 (02) :109-131
[4]  
Boykov YY, 2001, EIGHTH IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION, VOL I, PROCEEDINGS, P105, DOI 10.1109/ICCV.2001.937505
[5]   Liver Vessels Segmentation Using a Hybrid Geometrical Moments/Graph Cuts Method [J].
Esneault, Simon ;
Lafon, Cyril ;
Dillenseger, Jean-Louis .
IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING, 2010, 57 (02) :276-283
[6]  
Ford L.R., 1956, Canadian journal of Mathematics, V8, P399, DOI 10.4153/CJM-1956-045-5
[7]  
Grady L, 2008, LECT NOTES COMPUT SC, V5241, P153, DOI 10.1007/978-3-540-85988-8_19
[8]  
Kolev K, 2009, PROC CVPR IEEE, P1858, DOI 10.1109/CVPRW.2009.5206608
[9]   Optimal surface segmentation in volumetric images - A graph-theoretic approach [J].
Li, K ;
Wu, XD ;
Chen, DZ ;
Sonka, M .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2006, 28 (01) :119-134
[10]   Vessel extraction in medical images by wave-propagation and traceback [J].
Quek, FKH ;
Kirbas, C .
IEEE TRANSACTIONS ON MEDICAL IMAGING, 2001, 20 (02) :117-131