Automatic segmentation of teeth using X-ray images

Number of pages: 80 File Format: word File Code: 31035
Year: 2012 University Degree: Master's degree Category: Computer Engineering
  • Part of the Content
  • Contents & Resources
  • Summary of Automatic segmentation of teeth using X-ray images

    Dissertation for Master's Degree in Artificial Intelligence

    Abstract

     

    One of the most complicated tasks in digital image processing is image segmentation. Due to increasing attention to this technique by researchers and turning it into a vital role, it is used in many practical fields such as medical applications. Today, in modern dentistry, techniques based on the use of computers, such as planning and planning before surgery, are being developed day by day. In order to achieve and implement the mentioned processes, the automatic segmentation of teeth is one of the important and primary steps. In this thesis, a multi-step method for automatic segmentation of teeth in digital dental images is presented.

    The main goal of this thesis is to use subbands of wavelet coefficients to improve segmentation. Each of these subbands contains important information that can be used in image segmentation. This important information is ignored in image segmentation. The main idea is to somehow add this information to the original image. Subbands of wavelet coefficients are added to the first subband of wavelet transform coefficients, corresponding to approximation coefficients that are closer to the original image in terms of value and appearance, using integration methods. After that, the wavelet transform image is done. In this case, the obtained image contains more information than the original image and the segmentation is done better and more accurately.

    In this thesis, the EM algorithm is used for the segmentation of dental radiology images, and to improve this algorithm, the k-means algorithm is used for the initial estimation of the parameters of the EM algorithm. Despite its simplicity, this algorithm is considered a basic method for many other clustering methods. Morphological operators have been used to improve the segmentation. Keywords: segmentation, wavelet transform, EM algorithm, K-means algorithm, morphological operators. It is useful in engineering techniques. Extensive studies and researches have been done in this field for a long time and many advances have been made. The speed of development of these developments has been such that now and after a short period of time, the effect of image processing can be clearly seen in many sciences and industries. While some of these applications are so dependent on image processing, they cannot be used without it. In today's world, the science of image processing in a comprehensive and specialized way is gaining a more basic and important role day by day, and it is at the beginning of the way in our country. The issue of the size of image data and the effort to remove noise and image disturbances such as the parameters resulting from inappropriate light sources, the disproportion of the combination of colors and many other factors in the received images are very important issues in working with images and their processing. Segmentation[2] is an important step of image processing, the input of which is the image and the output of those features extracted from the image. Segmentation divides the image into its constituent regions or constituent objects. The level of detail at which segmentation is performed depends on the problem to be solved, i.e., segmentation should stop when objects or regions of interest in the application have been identified. Segmentation accuracy determines the ultimate success or failure of computer analysis procedures. For this reason, great care must be taken to improve the possibility of accurate segmentation.

    Today in dentistry, computer-based techniques such as preoperative planning and planning, implant placement, and surgical evaluation are being developed day by day [1]. Segmentation of teeth in digital representation plays an important role in computer algorithms for feature extraction and measurement, and in orthodontic simulation for reordering teeth. In order to achieve and implement the mentioned processes, the automatic segmentation of dental images is one of the important and primary steps. Segmentation of teeth is also used in the field of identity recognition, orthodontic direction planning and facial cosmetic surgery.

    Separation of dental structures is very important both anatomically and pathologically.Finding the size, volume and sometimes the location of the structures is also very important in terms of diagnosing the disease. Most of the efforts have been made on two-dimensional images of maxillary and dental surfaces and curves. Segmentation of teeth is separating different parts of a tooth from each other in dental radiology images[3]. (Relationships and formulas are available in the main file) 1-2-Segmentation Most segmentation algorithms are based on one of the two main properties of brightness intensity values, discontinuity and similarity; In the first category, the method of dividing the image is based on rapid changes in light intensity, such as edges. The main methods in the second category are based on segmenting the image into regions that are similar based on a set of predefined criteria. Thresholding, area growth and area division and integration are examples of methods in this category.

    Image segmentation is also done using optimization methods. Among the important optimization algorithms, we can mention the evolutionary algorithms, genetic algorithm, ant colony algorithm, bird collective movement algorithm. Image segmentation can be considered as a process that divides R into n subregions Rn, ., R2, R1, so that:

    A.

    (Relations and formulas are available in the main file)

    B. Ri is the connected set, for n, .,2,i=1

    p.  For every j, i that

    t.  For n, .,2,1 = i

    Th.  For each neighboring region Ri and Ri.

    Here, is a rational formula defined on the points of the set RK and is the null set. The symbols are, respectively, community, community, collection. Two regions Ri and Rj are adjacent if their union forms a connected set.

    Condition (a) indicates that the segmentation must be complete [2], that is, two pixels must be in the same region, condition (b) requires that the points in a region must be connected based on predefined rules (for example, points must have a 4-way or 8-way connection. Condition (p) indicates that the regions must The condition (t) deals with the properties that must be satisfied by the pixels in the segmented region. The condition (c) indicates that the two adjacent regions Ri and Rj must be different according to the formula. Therefore, the main problem in segmentation is to divide the image into regions that satisfy the previous conditions. Segmentation algorithms for gray images are usually based on one of two categories of brightness such as discontinuity and similarity. In the segmentation based on discontinuities, it is assumed that the boundaries of the regions are completely different from each other and different from the background, as a result, it is possible to detect the border based on the local discontinuities in the light intensity. The edge-based segmentation is the main method used in this category. Area-based segmentation methods are based on dividing the image into regions that are similar based on a set of predefined criteria. 1-2-2-Edge detection [4]

    In this section, we emphasize on segmentation methods that are based on the detection of sharp local changes in brightness [2]. Edge pixels are pixels where the brightness of the image varies greatly. Edge detectors are image processing methods designed to detect edge pixels. A line can be thought of as an edge where the background luminance intensity on either side of the line is much higher or much lower than the luminance intensity of the line pixels. By line, we mean thin structures and usually they are one pixel thick. Edge detection is often used to segment images based on rapid changes in brightness. An edge consists of a transition between two levels of luminance that ideally occurs over a distance of one pixel. The size of the first derivative can be used to detect the edge in a region of the image. Among the more advanced techniques for edge detection, we can mention the Mar-Hildreth edge detector [5] and the edge detector using the sufficient transformation method [6]. In this section, techniques based on brightness intensity values ??or the properties of these values ??are discussed for directly dividing images into multiple regions.

  • Contents & References of Automatic segmentation of teeth using X-ray images

    List:

    1.  The first chapter. 1

    1-1-Introduction. 2

    1-2-Partitioning. 3

    1-2-1-Basics of segmentation. 4

    1-2-3- thresholding. 6

    1-2-4-district-based segmentation. 7

    1-2-4-1- Area growth. 8

    1-2-4-2-segmentation using the watershed algorithm. 9

    1-2-5-segmentation based on graph theory. 12

    1-2-6-fuzzy clustering. 14

    1-2-7-matrix also occurred. 14

    1-2-8- Classification of support vector machine. 15

    1-2-9-hierarchical clustering. 17

    1-2-10-K-means clustering method. 23

    1-2-11-past methods for segmenting dental images. 24

    The second chapter. 28

    2-1-Noise removal. 29

    2-2-Wavelet transform. 30

    2-2-1-image pyramids. 32

    2-2-2- partial band encoding. 34

    2-2-3-Hari transformation 35

    2-2-4-Multiprecision expansion. 36

    2-2-5-scaling functions. 36

    2-2-6-wavelet functions. 37

    2-2-7-discrete wavelet transform. 38

    2-1-8- Wavelet transforms in two dimensions. 40

    2-3-EM algorithm. 43

    2-4-morphological operators. 45

    The third chapter. 47

    3-1-Introduction. 48

    3-2-Radiographic images. 48

    3-3-Noise reduction. 50

    3-4- Segmentation using wavelet transform and EM algorithm. 50

    3-5-segmentation of dental images using wavelet transform and EM algorithm. 52

    3-6-Integration of features in image processing. 55

    3-7-Conclusion: 62

    3-8-Future solutions 63

    Resources 64

    Persian to English dictionary. 67

     

     

    Source:

    [1] Kihaninejad, Sh., Automatic segmentation and three-dimensional representation of teeth using multi-section CT scan images, Master, Faculty of Engineering, Department of Electrical Engineering, Bioelectrical Medical Engineering, University of Tehran, 2015

    [2] Gonzalez, R.C., Woods, E.R., Digital Image Processing, Second Edition, Tom Robbins, New Jersey, 2002. [3] Al-amri, S.S. & Kalyankar, N.V. and Khamitkar S.D.” Image Segmentation by Using Thershod Techniques" JOURNAL OF COMPUTING, VOL. 2, ISSUE. 5, MAY 2010,        ISSN 2151-9617

    [4] Behjati, Sh., Spectral method of Afraz Graf, MA, Faculty of Mathematical Sciences, Sharif University of Technology, December 89.

    [5] Wu, zh. & Leahy, R. "An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation", IEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, vol. 15, no. 11. November 1993

    [6] Zadeh, L. A., “Fuzzy Sets”, Information and Control, 8:338-353, 1965.

    [7] Magoulas G.D, & Karkanis S.A, & Karras D.A, and Vrahatis, M.N; "Comparison Study of Descriptors for Training Neural Network Classifier", The 19th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, Vol. 3, No. 30. [8] Vapnik, V. & Chervonenkis, A. "The necessary and sufficient conditions for consistency in the empirical risk minimization method," Pattern Recognition and Image Analysis, vol. 1, no. 3, pp. 283-305, 1991. [9] Jain, K. & Dubes, R.C.," Algorithms for Clustering Data”, Prentice Hall, Englewood Cliffs, 1988.

    [10] http://www.educator.ir/post-497.jsp

    [11] Sneath P. H. A. & Sokal, R. R., Numerical Taxonomy, Freeman, San Francisco, 1973.

    [12] King, B., “Step-Wise Clustering Procedures,” Journal of the American Statistical Association, 69:86-101, 1967. [13] Murtagh, "A survey of Recent Advances in Hierarchical Clustering Algorithms Which Use Cluster centers", The Computer Journal, 26:354-359, 1984. [14] Ward, J. H., Jr., "Hierarchical Grouping to Optimize an Objective Function", Journal of         the American Statistical Association, 58:236-244, 1963.

    [15] Jain, K. & Flynn P. J.,” Image Segmentation Using Clustering”, In N. Ahuja and         Bowyer  K., editors. Advances in Image Understanding: AAdvances in Image Understanding: A Festschrift for Azriel Rosenfeld, IEEE Computer Society Press, pp. 65-83, 1996. [16] Jain, K. & Dubes, R.C.,” Algorithms for Clustering Data”, Prentice Hall, Englewood Cliffs, 1988.

    [17] Mokhtari Hasanabad, and, Clustering Stream Data Using Parallel Hybrid Algorithms, MA, School of Computer Engineering, Software, Islamic Azad University Qazvin

    ]18] Tahmasabi, P., Environmental Data Clustering, Winter 2010

    [19] Dubes, R. C., How Many Clusters Are Best? -An Experiment, Pattern Recognition, 20: 645-663,1987. [19] Zhang T, Ramakrishnan R, Livny M, “BIRCH: An Efficient Data Clustering Method for Very Large Databases”, SIGMOD ’96 6/96 Montreal, Canada IQ 1996 ACM 0-89791 -        794-4/96/0006

    [21] Covavisaruch, N. & Sinthanayothin, C., “Wavelet Transformation for Dental X-ray Radiographs Segmentation Technique,” ??in 2010 Eighth International Conference on ICT and Knowledge Engineering

    [22] Keshtkar, F. & Gueaieb, W., “Segmentation of Dental Radiographs Using a Swarm Intelligence Approach,” in IEEE CCECE/CCGEI, Ottawa, May 2006

    [23] Phong–Dinh, V., & Bac–Hoai B., “Dental Radiographs Segmentation Based on Tooth Anatomy”, 2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies University of Science – Vietnam National University, Ho Chi Minh City, July 13-17, 2008

    [24] Wanat, R.,"A Problem of Automatic Segmentation of Digital Dental Panoramic X-Ray Images for Forensic Human Identification", Proceedings of CESCG 2011: The 15th Central European Seminar on Computer Graphics (non-peer-reviewed)

    [25] Shah, S., &Abaza, A.,& Ross, A., and Ammar H. "Automatic Tooth Segmentation Using Active Contour Without Edges",1-4244-0487-8/06/$20.00 ©2006 IEEE

    [26] http://hhbme.persianblog.ir/1389/12

    [27] Salemi, G., Digital Image Processing Using Thin Signal Representation Based on Iterative Methods, MA, School of Electrical Engineering, Telecommunication System, Sharif University of Technology

    [28] http://fourier.eng.hmc.edu/e161/lectures/Haar/index.html

    [29] Mitchell, T., “Machine Learning”, WCB/McGraw-Hill, 1997.

    [30] Efford, N., “Digital Image Processing: A Practical Introduction Using JavaTM”. Pearson Education, 2000.

    [31] Sateesh Kumar, H. C., & Raja, K. B., & Venugopal, K. R., and Patnaik, L. M., “Automatic Image Segmentation using Wavelets,” IJCSNS International Journal of Computer Science and Network Security, VOL.9 No.

Automatic segmentation of teeth using X-ray images