Tooth Segmentation from Cone Beam Computed Tomography Images Using the Identified Root Canal and Harmonic Fields Good afternoon, first of all, let me introduce.

Slides:



Advertisements
Similar presentations
An Active contour Model without Edges
Advertisements

Tooth Segmentation on Dental Meshes Using Morphologic Skeleton
20 10 School of Electrical Engineering &Telecommunications UNSW UNSW 10 Nicholas Webb (Author), David Taubman (Supervisor) 15 October 2010.
MRI Image Segmentation for Brain Injury Quantification Lindsay Kulkin 1 and Bir Bhanu 2 1 Department of Biomedical Engineering, Syracuse University, Syracuse,
Randomized Planning for Short Inspection Paths Tim Danner Lydia E. Kavraki Department of Computer Science Rice University.
An algorithm for metal streaking artifact reduction in cone beam CT M. Bazalova 1,2, G. Landry 1, L. Beaulieu 3, F. Verhaegen 1,4 1-McGill University,
X-ray Based Craniofacial Visualization and Surgery Simulation Junjun Pan 1, Jian J Zhang 1, Yanning Zhang 2, Hong Zhou 3
Image Segmentation Rob Atlas Nick Bridle Evan Radkoff.
AdvisorStudent Dr. Jia Li Shaojun Liu Dept. of Computer Science and Engineering, Oakland University 3D Shape Classification Using Conformal Mapping In.
S I E M E N S C O R P O R A T E R E S E A R C H 1 1 Computing Exact Discrete Minimal Surfaces: Extending and Solving the Shortest Path Problem in 3D with.
An Interactive Segmentation Approach Using Color Pre- processing Marisol Martinez Escobar Ph.D Candidate Major Professor: Eliot Winer Department of Mechanical.
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.
Visualizing Fiber Tracts in the Brain Using Diffusion Tensor Data Masters Project Presentation Yoshihito Yagi Thursday, July 28 th, 10:00 a.m. 499 Dirac.
Boundary Recognition in Sensor Networks by Topology Methods Yue Wang, Jie Gao Dept. of Computer Science Stony Brook University Stony Brook, NY Joseph S.B.
Detection of nerves in Ultrasound Images using edge detection techniques NIRANJAN TALLAPALLY.
EDGE DETECTION USING MINMAX MEASURES SOUNDARARAJAN EZEKIEL Matthew Lang Department of Computer Science Indiana University of Pennsylvania Indiana, PA.
Conclusions The success rate of proposed method is higher than that of traditional MI MI based on GVFI is robust to noise GVFI based on f1 performs better.
Principles and Practice of Radiation Therapy
3D Digital Cleansing Using Segmentation Rays Authors: Sarang Lakare, Ming Wan, Mie Sato and Arie Kaufman Source: In Proceedings of the IEEE Visualization.
AdvisorStudent Dr. Jia Li Shaojun Liu Dept. of Computer Science and Engineering, Oakland University Automatic 3D Image Segmentation of Internal Lung Structures.
Journal of Visual Communication and Image Representation
 In the previews parts we have seen some kind of segmentation method.  In this lecture we will see graph cut, which is a another segmentation method.
Chance Constrained Robust Energy Efficiency in Cognitive Radio Networks with Channel Uncertainty Yongjun Xu and Xiaohui Zhao College of Communication Engineering,
Karolina Kokurewicz Supervisors: Dino Jaroszynski, Giuseppe Schettino
Detection of nerves in Ultrasound Images using edge detection techniques NIRANJAN TALLAPALLY.
Motion Segmentation at Any Speed Shrinivas J. Pundlik Department of Electrical and Computer Engineering, Clemson University, Clemson, SC.
Shadow Detection in Remotely Sensed Images Based on Self-Adaptive Feature Selection Jiahang Liu, Tao Fang, and Deren Li IEEE TRANSACTIONS ON GEOSCIENCE.
Document Clustering with Prior Knowledge Xiang Ji et al. Document Clustering with Prior Knowledge. SIGIR 2006 Presenter: Suhan Yu.
Presented by: Anum Masood PhD Scholar
Technological Uncanny K. S'hell, C Kurtz, N. Vincent et E. André et M. Beugnet 1.
October 3, 2013Computer Vision Lecture 10: Contour Fitting 1 Edge Relaxation Typically, this technique works on crack edges: pixelpixelpixel pixelpixelpixelebg.
Chapter-4 Single-Photon emission computed tomography (SPECT)
Three-Dimension (3D) Whole-slide Histological Image Analytics
Physica Medica 32 (2016) 1570–1574 報告人:王俊淵
Clustering Anna Reithmeir Data Mining Proseminar 2017
Image Processing For Soft X-Ray Self-Seeding
You Zhang, Jeffrey Meyer, Joubin Nasehi Tehrani, Jing Wang
New imaging techniques in orthodontics
International Workshop
DIGITAL SIGNAL PROCESSING
Graph Theory Modeling – A Petri Net based Approach
Classification and numbering of teeth in dental bitewing images
CSc4730/6730 Scientific Visualization
Yue Zhang, Nathan Vance, and Dong Wang
Brain Hemorrhage Detection and Classification Steps
Enhanced-alignment Measure for Binary Foreground Map Evaluation
An Efficient method to recommend research papers and highly influential authors. VIRAJITHA KARNATAPU.
Graph Cut Weizhen Jing
Scale-Space Representation of 3D Models and Topological Matching
Sheqin Dong, Song Chen, Xianlong Hong EDA Lab., Tsinghua Univ. Beijing
PRAKASH CHOCKALINGAM, NALIN PRADEEP, AND STAN BIRCHFIELD
Medical Images Edge Detection via Neutrosophic Mathematical Morphology
Geometric Reasoning About Mechanical Assembly
Automatic Segmentation of Data Sequences
Institute of Computing Tech.
Additive and Subtractive
My name is Shijian Liu, a Lecture from Fujian University of Technology
EE 492 ENGINEERING PROJECT
Hierarchical and Dynamic Large-Scale Railway-Track Modeling Method for High-Speed Train Real-Time Visual Simulation Good afternoon, first of all, let.
ROLE OF «electronic virtual enhanced research-engaged student teams» WEB PORTAL IN SOLUTION OF PROBLEM OF COLLABORATION INTERNATIONAL TEAMS INSIDE ONE.
Actively Learning Ontology Matching via User Interaction
Retrieval Performance Evaluation - Measures
Reporter: Wenkai Cui Institution: Tsinghua University Date:
Chapter 4 . Trajectory planning and Inverse kinematics
Inductive Clustering: A technique for clustering search results Hieu Khac Le Department of Computer Science - University of Illinois at Urbana-Champaign.
Computed Tomography (C.T)
Computed Tomography (C.T)
Computed Tomography (C.T)
Random Neural Network Texture Model
Presentation transcript:

Tooth Segmentation from Cone Beam Computed Tomography Images Using the Identified Root Canal and Harmonic Fields Good afternoon, first of all, let me introduce myself. My name is Shi-Jian Liu from Fujian University of Technology Today I’d like to present our work, which is a modeling method of railway-track for Visual simulation. Shi-Jian Liu 1,2,3 , Zheng Zou 4, Ye Liang 5 , and Jeng-Shyang Pan 1,2 1Shcool of Information Science and Engineering, Fujian University of Technology 2Key Laboratory of Big Data Mining and Applications of Fujian Province 3The Key Laboratory for Automotive Electronics and Electric Drive of Fujian Province 4Shcool of Information Science and Engineering, Central South University 5Department of Stomatology, Xiangya Hospital of Central South University

Outlines 1. Introduction 2. Challenges & Related Works 3. Our method & Results 4. Conclusion & Future Works

Outlines 1. Introduction 2. Challenges & Related Works 3. Our method & Results 4. Conclusion & Future Works

CBCT The way of capturing in vivo dental information Laser scanner Cone Beam Computed Tomography (CBCT) techniques There are two major ways nowadays to capture in vivo dental information into its digital format. The first one is to use a laser scanner, which is a popular three dimensional(3D) approach and can be used to capture the geometry of crown surface accurately. However, as we know, the laser beams cannot reach the internal of object, therefore, it is unable to capture the root of tooth. As another option, Cone Beam Computed Tomography (CBCT) techniques are widely used in the clinic, since the X-ray it adopted can pass through human body and tell the differences among different organs. Actually, the CBCT images play an very important role in the computer-aided diagnosis, treatment planning and virtual surgery for dental routines such as root canal therapy, where information of the root is crucial to their successes.

Tooth segmentation Aim of this work A primary step of the CBCT based approach is to distinguish tooth from the rests, which is the aim of this work. In other words, we want to find a feasible way to segment individual teeth from CBCT images. Or find the segmentation boundary of a tooth in each slice.

Root canal and the centerline Instead of solid object, within a tooth there exist some spaces anatomically where soft tissues, such as the blood vessels and nerve, can be found. Therefore, in the CBCT images, low intensity areas appear inside the tooth in contrast with the high intensity bone tissues. A root canal is the tubular structure within the root of a tooth. In this paper, we treat it as an important prior knowledge because a tooth can be located as long as its root canals are identified. And we use its centerline as an efficient descriptive way of the root canal.

Outlines 1. Introduction 2. Challenges & Related Works 3. Our method & Results 4. Conclusion & Future Works

Challenges Close to surrounding objects - suspicious / disappeared boundaries Topological change – see the first molar Limited resolution – the entire head Noisy - reduced radiation dose Efficiency - large number of slices The segmentation of tooth from CBCT images is challenging. Firstly, the tooth is very close to surrounding objects. Therefore, many suspicious boundaries may exist and the boundary even disappeared where adjacent teeth touch each other. Secondly, the tooth contour also suffers from topological change among different images. For example, the first molar in Fig. X can be seen as one connected region, while becomes three region in Fig. X. Thirdly, the resolution of tooth is limited, because the image represents the entire head and some surroundings. As Fig. X demonstrated, the region of tooth in red rectangle is relatively small comparing to the entire region of image in blue rectangle. Fourthly, the CBCT images may be very noisy for the reason of reduced radiation dose, which is for the consideration of healthy. Lastly, efficiency is important due to large number of slices for each tooth.

Existed methods max-flow/min-cut based graph cut method contour evaluation based algorithm Snakes Level Set - the most adopted algorithm Lots of methods have been proposed for medical image segmentation. Some of them are relatively simple, such as threshold based method and region growing. Others may be more complex, such as max-flow/min-cut based graph cut method and contour evaluation based Snakes [2] or Level Set [8] algorithm. Actually, Level Set is the most adopted algorithm in the published methods for tooth segmentation. However, parameter tunings are generally required in order to get a excellent result for different cases, Besides, errors are prone to accumulate in these methods.

Outlines 1. Introduction 2. Challenges & Related Works 3. Our method & Results 4. Conclusion & Future Works

Our Work Root Canal Centerline Identification Tooth Segmentation Graph Theory Tooth Segmentation The identified canal centerline Harmonic Fields This method takes the advantages of manual and automatic method, Specifically, small repeated geometric structure of the track will be off-line manual generated and on-line assembled to form an integrated railway-track.

The method for centerline identification Graph Theory energy term shortest weighted path algorithm In order to identification centerline, we treat it as a path formed by consecutive edges between two selected terminal points in the graph constructed from CT volume. The key is to design a energy term and assign it to every edges of the graph on the condition that the centerline will possess the minimum energy values than any other path’s between the two specified terminals. Then, the classic shortest weighted path algorithm can be used to solve the minimization problem where energy term of each edge is the weight. Specifically, the position P(x i , x i+1 ) and tangential direction D(x i , x i+1 ) of edge x i , x i+1 λ i , e i (i = 1, 2, 3) are eigenvalue and eigenvector of structure tensor of xi subjected to λ 1 ≥ λ 2 ≥ λ 3 , v is the vector from x i to x i+1 , • denotes the dot product operation.

The method for tooth segmentation The canal centerline - belongs to the tooth Harmonic field theory The canal centerline is used for the segmentation based on the fact that it belongs to the tooth definitely. And Harmonic field theory is also adopted for the segmentation, similar to the work we did in our previous work. But this time it works on 2D image and uses the canal centerline region as the constrains.

Experimental Result Here are some results based on our method.

Experimental Result A Morphological Snakes (MS) algorithm [MS] is adopted for the comparison [MS] Alvarez, L., Baumela, L., Marquez-Neila, P., Henriquez, P.: A real time morphological snakes algorithm. Image Processing On Line 2, 1–7 (2012) A Morphological Snakes (MS) algorithm [3] is adopted for the comparison. As showed in Fig. 4, our method is more accurate than the MS.

Experimental Result Then, the average time consumption for root canal centerline identification and contour tracking also are recorded (see Fig. 4) grouped by teeth indexes (i.e., from 11 to 17 and 21 to 27 according to the Federation Dentaire Internationale notation method)

Outlines 1. Introduction 2. Challenges & Related Works 3. Our method & Results 4. Conclusion & Future Works

Conclusion & Future Works This paper presents a novel segmentation method of tooth from CBCT images. (1) The root canal centerline identified by graph theory based energy minimization problem is applied as prior knowledge aiding for the segmentation. (2) Within each slice, the segmentation is based on the harmonic field theory, which makes our method superior to the traditional ones. The major time consumption of our method is the cost for harmonic field generation. Though strategies for accelerating such as VOI extraction have been achieved in this work, further improvement of efficiency is still a direction of our future works. This paper presents a novel segmentation method of tooth from CBCT images. Firstly, the root canal centerline identified by graph theory based energy min- imization problem is applied as prior knowledge aiding for the segmentation. Besides, though we use the idea of contour tracking strategy as adopted by most published methods, within a slice, the segmentation is based on the harmonic field theory, which makes our method superior to the traditional ones. Effect and efficiency of ours are proved by the experiments. As can be seen in the experiment, the major time consumption of our method is the cost for harmonic field generation. Though strategies for accelerating such as VOI extraction have been achieved in this work, further improvement is still a direction of our future works.

Thanks for your attention ! Q and A Thanks for your attention !