Date of Award

2003

Degree Type

Dissertation

Degree Name

Ph.D.

Department

Electrical and Computer Engineering

First Advisor

Sid-Ahmed, M. A.,

Keywords

Engineering, Electronics and Electrical.

Rights

CC BY-NC-ND 4.0

Abstract

In modern orthodontic practice, a great reliance is placed on objective and systematic methods of characterizing craniofacial forms, using measurements based on a set of agreed upon points known as craniofacial landmarks. Lateral skull x-ray images are usually used in cephalometric analysis to provide quantitative measurements of the head. Accurate location of those landmarks forms the basis for what is known as cephalometric evaluation. Distance and angles among these landmarks are compared with normative values to diagnose a patient's deviations from ideal form, evaluate the craniofacial growth and measure the effect of the treatment. Because of the large variability in the morphology of the human head, large variations of special coordinates of landmarks are observed and must be reduced. To reduce this variation, adaptive localization based on the, size, rotation and shifts of the skull is used. The adaptive system requires a training set that will account for all the variations in the cephalograms. A good training set is difficult to obtain due to unavailability of fixed workbenches of locations of landmarks that cephalometric measurements of x-rays can be compared with. To create a reliable training set, images are grouped into several clusters and one prototype representing that cluster is used in the training set. The work in this thesis reports two novel algorithms for locating craniofacial landmarks on digitized skull x-rays. The first algorithm is based on the use of neuro-fuzzy networks to minimize the search windows for each landmark. Parametric template matching is then used to pin point the exact location of the landmark inside a search window. The second algorithm uses a Multi-Layer Perceptron as a function approximator to predict the location of the landmark based on learned knowledge obtained from a training set. A new method for extracting a features vector from each image is also reported. This feature vector is used to represent images and also used for clustering images to obtain a reliable training set using K-means after providing it with initial estimates of centers of the groups. To reduce the dimension of the feature vector, we provide an efficient pruning technique for reduction of features based on sensitivity analysis. It is shown that this reduction will minimize the number of rules required for the fuzzy system while the clustering characteristics are preserved. Algorithms are simulated using C++ code. Results obtained using the two algorithms are compared with previous works. It is shown that the proposed algorithms outperform other methods found in the open literature.Dept. of Electrical and Computer Engineering. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2003 .E43. Source: Dissertation Abstracts International, Volume: 64-10, Section: B, page: 5116. Advisers: M. A. Sid-Ahmed; M. Ahmadi. Thesis (Ph.D.)--University of Windsor (Canada), 2003.

Share

COinS