Graph-Based Optimization with Tubularity Markov Tree for 3D Vessel Segmentation

被引:11
作者
Zhu, Ning [1 ]
Chung, Albert C. S. [1 ]
机构
[1] Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Lo Kwee Seong Med Image Anal Lab, Hong Kong, Hong Kong, Peoples R China
来源
2013 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR) | 2013年
关键词
EXTRACTION; CURVES; IMAGES; PATHS; CUTS;
D O I
10.1109/CVPR.2013.288
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we propose a graph-based method for 3D vessel tree structure segmentation based on a new tubularity Markov tree model (TMT), which works as both new energy function and graph construction method. With the help of power-watershed implementation [7], a global optimal segmentation can be obtained with low computational cost. Different with other graph-based vessel segmentation methods, the proposed method does not depend on any skeleton and ROI extraction method. The classical issues of the graph-based methods, such as shrinking bias and sensitivity to seed point location, can be solved with the proposed method thanks to vessel data fidelity obtained with TMT. The proposed method is compared with some classical graph-based image segmentation methods and two up-to-date 3D vessel segmentation methods, and is demonstrated to be more accurate than these methods for 3D vessel tree segmentation. Although the segmentation is done without ROI extraction, the computational cost for the proposed method is low (within 20 seconds for 256*256*144 image).
引用
收藏
页码:2219 / 2226
页数:8
相关论文
共 24 条
  • [1] SEEDED REGION GROWING
    ADAMS, R
    BISCHOF, L
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1994, 16 (06) : 641 - 647
  • [2] Segmentation of interwoven 3d tubular tree structures utilizing shape priors and graph cuts
    Bauer, Christian
    Pock, Thomas
    Sorantin, Erich
    Bischof, Horst
    Beichel, Reinhard
    [J]. MEDICAL IMAGE ANALYSIS, 2010, 14 (02) : 172 - 184
  • [3] An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision
    Boykov, Y
    Kolmogorov, V
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2004, 26 (09) : 1124 - 1137
  • [4] Graph cuts and efficient N-D image segmentation
    Boykov, Yuri
    Funka-Lea, Gareth
    [J]. INTERNATIONAL JOURNAL OF COMPUTER VISION, 2006, 70 (02) : 109 - 131
  • [5] Boykov YY, 2001, EIGHTH IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION, VOL I, PROCEEDINGS, P105, DOI 10.1109/ICCV.2001.937505
  • [6] Power Watershed: A Unifying Graph-Based Optimization Framework
    Couprie, Camille
    Grady, Leo
    Najman, Laurent
    Talbot, Hugues
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (07) : 1384 - 1399
  • [7] Liver Vessels Segmentation Using a Hybrid Geometrical Moments/Graph Cuts Method
    Esneault, Simon
    Lafon, Cyril
    Dillenseger, Jean-Louis
    [J]. IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING, 2010, 57 (02) : 276 - 283
  • [8] Random walks for image segmentation
    Grady, Leo
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2006, 28 (11) : 1768 - 1783
  • [9] Grady L, 2008, LECT NOTES COMPUT SC, V5241, P153, DOI 10.1007/978-3-540-85988-8_19
  • [10] Hanaoka S, 2011, LECT NOTES COMPUT SC, V6893, P554, DOI 10.1007/978-3-642-23626-6_68