Mandible and skull segmentation in cone beam computed tomography using super-voxels and graph clustering

被引:18
作者
Linares, Oscar Cuadros [1 ]
Bianchi, Jonas [2 ]
Raveli, Dirceu [2 ]
Batista Neto, Joao [1 ]
Hamann, Bernd [3 ]
机构
[1] Univ Sao Paulo, ICMC, BR-13566590 Sao Carlos, SP, Brazil
[2] Sao Paulo State Univ UNESP, Fac Odontol FOAR, BR-14801385 Araraquara, SP, Brazil
[3] Univ Calif Davis, Dept Comp Sci, Davis, CA 95616 USA
基金
巴西圣保罗研究基金会;
关键词
Cone beam computed tomography; Graph clustering; Super-voxels; Bone segmentation; Mandible; Skull; 3D SEGMENTATION; CT; BONE;
D O I
10.1007/s00371-018-1511-0
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Cone beam computed tomography (CBCT) is a medical imaging technique employed for diagnosis and treatment of patients with cranio-maxillofacial deformities. CBCT 3D reconstruction and segmentation of bones such as mandible or maxilla are essential procedures in surgical and orthodontic treatments. However, CBCT image processing may be impaired by features such as low contrast, inhomogeneity, noise and artifacts. Besides, values assigned to voxels are relative Hounsfield units unlike traditional computed tomography (CT). Such drawbacks render CBCT segmentation a difficult and time-consuming task, usually performed manually with tools designed for medical image processing. We present an interactive two-stage method for the segmentation of CBCT: (i) we first perform an automatic segmentation of bone structures with super-voxels, allowing a compact graph representation of the 3D data; (ii) next, a user-placed seed process guides a graph partitioning algorithm, splitting the extracted bones into mandible and skull. We have evaluated our segmentation method in three different scenarios and compared the results with ground truth data of the mandible and the skull. Results show that our method produces accurate segmentation and is robust to changes in parameters. We also compared our method with two similar segmentation strategy and showed that it produces more accurate segmentation. Finally, we evaluated our method for CT data of patients with deformed or missing bones and the segmentation was accurate for all data. The segmentation of a typical CBCT takes in average 5 min, which is faster than most techniques currently available.
引用
收藏
页码:1461 / 1474
页数:14
相关论文
共 40 条
[1]   SLIC Superpixels Compared to State-of-the-Art Superpixel Methods [J].
Achanta, Radhakrishna ;
Shaji, Appu ;
Smith, Kevin ;
Lucchi, Aurelien ;
Fua, Pascal ;
Suesstrunk, Sabine .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2012, 34 (11) :2274-2281
[2]  
Achanta Radhakrishna, 2010, Technical report
[3]  
[Anonymous], 1987, PROC INT C COMPUT GR, DOI [10.1145/37401.37422, DOI 10.1145/37402.37422, DOI 10.1145/37401.37422]
[4]  
[Anonymous], P 2012 IEEE INT S ME
[5]  
[Anonymous], 2014, Marginal space learning for medical image analysis
[6]   Graph cuts and efficient N-D image segmentation [J].
Boykov, Yuri ;
Funka-Lea, Gareth .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 2006, 70 (02) :109-131
[7]   Automatic Segmentation of the Mandible in Cone-Beam Computer Tomography Images [J].
Brandariz, M. ;
Barreira, N. ;
Penedo, M. G. ;
Suarez-Cunqueiro, M. .
2014 IEEE 27TH INTERNATIONAL SYMPOSIUM ON COMPUTER-BASED MEDICAL SYSTEMS (CBMS), 2014, :467-+
[8]   Laplacian Coordinates for Seeded Image Segmentation [J].
Casaca, Wallace ;
Nonato, Luis Gustavo ;
Taubin, Gabriel .
2014 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2014, :384-391
[9]   3D segmentation of maxilla in cone-beam computed tomography imaging using base invariant wavelet active shape model on customized two-manifold topology [J].
Chang, Yu-Bing ;
Xia, James J. ;
Yuan, Peng ;
Kuo, Tai-Hong ;
Xiong, Zixiang ;
Gateno, Jaime ;
Zhou, Xiaobo .
JOURNAL OF X-RAY SCIENCE AND TECHNOLOGY, 2013, 21 (02) :251-282
[10]   Comparison of statistical models performance in case of segmentation using a small amount of training datasets [J].
Chung, Francois ;
Schmid, Jerome ;
Magnenat-Thalmann, Nadia ;
Delingette, Herve .
VISUAL COMPUTER, 2011, 27 (02) :141-151