Segmentation of large periapical lesions toward dental computer-aided diagnosis in cone-beam CT scans

被引:1
作者
Rysavy, Steven [1 ]
Flores, Arturo [1 ]
Enciso, Reyes [2 ]
Okada, Kazunori [1 ]
机构
[1] San Francisco State Univ, 1600 Holloway Ave, San Francisco, CA 94132 USA
[2] Univ So Calif, Los Angeles, CA 90089 USA
来源
MEDICAL IMAGING 2008: IMAGE PROCESSING, PTS 1-3 | 2008年 / 6914卷
关键词
segmentation; dental CAD;
D O I
10.1117/12.770908
中图分类号
R318 [生物医学工程];
学科分类号
0831 ;
摘要
This paper presents an experimental study for assessing the applicability of general-purpose 3D segmentation algorithms for analyzing dental periapical lesions in cone-beam computed tomography (CBCT) scans. In the field of Endodontics, clinical studies have been unable to determine if a periapical granuloma can heal with non-surgical methods. Addressing this issue, Simon et al. recently proposed a diagnostic technique which non-invasively classifies target lesions using CBCT. Manual segmentation exploited in their study, however, is too time consuming and unreliable for real world adoption. On the other hand, many technically advanced algorithms have been proposed to address segmentation problems in various biomedical and non-biomedical contexts, but they have not yet been applied to the field of dentistry. Presented in this paper is a novel application of such segmentation algorithms to the clinically-significant dental problem. This study evaluates three state-of-the-art graph-based algorithms: a normalized cut algorithm based on a generalized eigen-value problem, a graph cut algorithm implementing energy minimization techniques, and a random walks algorithm derived from discrete electrical potential theory. In this paper, we extend the original 2D formulation of the above algorithms to segment 3D images directly and apply the resulting algorithms to the dental CBCT images. We experimentally evaluate quality of the segmentation results for 3D CBCT images, as well as their 2D cross sections. The benefits and pitfalls of each algorithm are highlighted.
引用
收藏
页数:10
相关论文
共 14 条
[1]  
Adelson EH., 1984, RCA Engineer, V29, P33
[2]  
[Anonymous], 2006, IEEE T PATTERN ANAL
[3]   Fast approximate energy minimization via graph cuts [J].
Boykov, Y ;
Veksler, O ;
Zabih, R .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2001, 23 (11) :1222-1239
[4]   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
[5]   Ultrasound real-time imaging in the differential diagnosis of periapical lesions [J].
Cotti, E ;
Campisi, G ;
Ambu, R ;
Dettori, C .
INTERNATIONAL ENDODONTIC JOURNAL, 2003, 36 (08) :556-563
[6]   Diagnostic imaging over the last 50 years: research and development in medical imaging science and technology [J].
Doi, Kunio .
PHYSICS IN MEDICINE AND BIOLOGY, 2006, 51 (13) :R5-R27
[7]  
GOLUB G, 1996, MATRIX COMPUTATIONS, P408
[8]  
HUANG Y, 2006, CLIN IMAG, V29, P164
[9]  
KAWATA Y, 1999, P 10 INT C IM AN PRO, V470
[10]   What energy functions can be minimized via graph cuts? [J].
Kolmogorov, V ;
Zabih, R .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2004, 26 (02) :147-159