You are on page 1of 6

TEETH FEATURE EXTRACTION AND MATCHING FOR HUMAN

IDENTIFICATION USING MORPHOLOGICAL SKELETON


TRANSFORM
LCC Jani Joseph1, Libi B George2, Shabna GU3, Dr. N. Santhi5, Associate professor
Susmi I4 Department of Electronics and Communication
UG Scholar1,2,3,4 Engineering
Department of Electronics and Communication Noorul Islam University, Kumaracoil, Thuckalay, KK
Engineering District
Noorul Islam University, Kumaracoil,Thuckalay, KK
District
libigeorge51091@gmail.com2
shabna8988@gmail.com3

rithms use the structural approach. That is, a given shape is


Abstract-- The morphological skeleton transform (MST) is a described in terms of its simpler shape components and the
leading morphological shape representation scheme. In the relationships among the components. The morphological skeleton
MST, a given shape is represented as the union of all the transform (MST) is a leading morphological shape representation
maximal disks contained in the shape. The concept of external algorithm [1]. In the MST, a given shape is represented as a union
skeleton points and external maximal disks has been used for of all maximal disks contained in the shape. The advantages of
shape description and characterization purposes. Dental the MST include that it has a simple and intuitive mathematical
biometrics has emerged as vital biometric information of characterization as well as an easy and efficient implementation.
human being due to its stability, invariant nature and However, one problem with the MST is that there is a great deal
uniqueness. The proposed work using SIFT algorithm for of overlapping among the maximal disks. Some shape matching
human identification and we work with canny detection algorithms have been developed based on the MST, but they were
algorithm for the analysis and comparison with the proposed only demonstrated to work on some simple geometric shapes.
SIFT algorithm. This system has six main stages as pre-
processing, feature extraction, feature matching and finalized In our paper we are comparing using SIFT algorithm for human
recognized person. Then we go for canny edge detection and identification using dental biometrics. Teeth are parts of human
comparison with database images. At the final step we organ that are not easily decayed and located inside mouth.
compare SIFT and canny algorithm detected values using the Human teeth has its own unique characteristics, based on a
Euclidian distance between the query image and database. number of distinctive features. Human teeth identification is one
Here the Euclidian distance between detected points and of the reliable tools for human identification. In general, human
matching points determines the accuracy of the algorithm for has 32 teeth each with 5 surfaces. Inside a mouth there are 160
human identification. The system is work for both types of tooth surfaces with various conditions. If we use dental features
dental images i.e. photograph and radiograph in which two as a tool of identification manual matching based on teeth
different datasets are required. The required database contains appearance needs a large amount of time and there may be some
50 images of dental photographs and 50 images of dental expertise. So we are going for computer aided identification.
radiographs so experimentation has done on total 100 images Teeth features consists of properties of teeth like shape ,size, root
and that are taken from dental clinic* and internet. While and crown morphology, pathology, dental restorations
comparing proposed SIFT algorithm with canny detection ,periodontal tissue features and anatomical features. Teeth feature
algorithm we can conclude that our SIFT algorithm can extraction means extracting various information such as contour,
provide more accurate result. artificial prosthesis ,shape, size etc. from dental image(dental
photograph and radiograph[9]).In our wok the teeth feature
Key points: MST, SIFT, Canny, Dental biometrics extracted is contour and shape because they remains more
invariant over time as compared to other features of teeth.
I. INTRODUCTION
For identifying victims of massive disasters like terrorist attack,
Mathematical morphology is a shape-based approach to image tsunami, bomb blast etc. dental records have been used to identify
processing. It is only natural that a number of morphological shape the victims. Identification of a person based on dental records is
representation algorithms have been proposed. Many of these algo- an important concept of Forensic .Radiograph images are used

978-1-4673-9925-8/16/$31.00 ©2016 IEEE 802


since they are more permanent rather than fingerprints, iris and DENTAL RADIOGRAPH
facial features of an individual. The main advantage is, it will
remain available for several hours after death of an individual. It is an intra or oral image taken using X-ray radiation. Dental
Teeth identification involves three steps: image acquisition, radiograph consists of teeth, bones and surrounding soft tissues.
image enhancement and image segmentation. Periapical, Bitewing and Panoramic are the three types of dental
radiograph commonly used. In our work we are using bitewing
TOOTH ANATOMY radiographs because it will gives clear information of contour and
shape of teeth used for feature extraction.
A Tooth is a small calcified, whitish structure found in the
mouths (jaws). It is used to break down food. Its roots are covered
by gums. Teeth are not made up of bone, but rather of multiple
tissues of varying density and hardness. A typical healthy tooth
has number of layers and its internal structure. Each tooth relates
to the gum and surrounding jaw bone. The crown is the part of the
tooth that is visible above the gum and neck is the region of the
tooth at the gum line, between root and the crown. Root is the
(a) (b) (c)
region below the gum. Some teeth have only one roots, for
example, incisors and canine (eye) teeth, whereas molars and Fig.3 (a) Periapical radiograph (b) Bitewing radiograph (c)
premolars have 4 roots per tooth. Panoramic radiograph

II. EXISTING SYSTEMS

There are certain techniques based on dental radiograph and


dental photograph are already exist. For each technique certain
algorithms are used for the identification of images. For that in
each technique any one or two of the teeth features are taken for
matching purpose.

III. PROPOSED SYSTEM

In our proposed system we are using two algorithms for teeth


identification, for proving that morphological skeleton transform
is more efficient for identification purposes. SIFT-Scale Invariant
Fig.1 Tooth anatomy Feature Transform and Canny Edge Detection are the two
algorithms using in the proposed system. In SIFT algorithm
DENTAL PHOTOGRAPH identification is based on key points .SIFT is based on MST. In
Canny algorithm identification is based on edge detection.
It is the pictorial view of teeth structure. It is a image captured by
digital camera by stretching lower and upper lips. Dental DATA BASE INPUT
photographs gives the information of contour and size of upper
and lower jaw teeth.
INPUT
PRE-PROCESSING
IMAGE

FEATURE EXTRACTION

RECOGNITION

OUTPUT IMAGE
Fig.2 Typical dental photograph
Fig 4: block diagram of proposed system

803
3.1 PRE- PROCESSING IV. PROPOSED SYSTEM COMPARISON WITH CANNY
DETECTION METHOD
Input Image: Here the input images are dental photograph and
radiograph in JPEG format. First user has to select database Human teeth identification using canny algorithm consists of five
type, either dental photograph or radiograph. After that input steps,
image is selected from that database type for further processing.
The input image is then resized to 150*150 in pre-processing step 1. Image Classification
2. Pre-Processing
3.2 RGB TO GRAY CONVERSION 3. Segmentation
4. Feature Extraction
It is necessary step because the processing takes place on gray 5. Dental Image Matching And Human Identification
scale image. It is carried out by eliminating hue and saturation
information while retaining luminance information of image. 4.1 IMAGE CLASSIFICATION

3.3 SEGMENTATION Here phase collection of various dental radiographs are done.
These images are stored in template and used as database. The
Here each tooth is segmented in rectangular region using information about the person such as name and address to which
mathematical approach like noise filtering, it will isolate the teeth the radiograph belongs is stored separately. Then it is classified as
from background. Specify colour range, intensity and hue map, periapical, panoramic and bitewing dental images. Among these
creating binary image from hue intensity map and return binary bitewing images has certain features like upper and lower jaws
image are the four steps used in segmentation signifying bite. Peiapical has features like a nasal area, sinuses
.Here we used bitewing images. Dental radiographs can be
3.4 FEATURE EXTRACTION divided into teeth areas, bone areas and background area.

In feature extraction SIFT is used to extract key points from the  Teeth area - high intensity.
input image and comparing with database images for feature
 Bone area - average intensity
matching. SIFT is an algorithm in computer vision to detect and
 Background area - lowest intensity
describe local features in images. Here we used skeleton image to
extract highly distinctive features. There are four steps involved 4.2 PRE-PROCESSING
in SIFT feature extraction. Scale –space Extreme Detection, Key
point Localization, Interpolation of nearby Data for Accurate In pre-processing the unwanted noise in radiographs are removed.
Position, Orientation Assignment. First dental radiograph are converted into gray scale image. From
the histogram unwanted intensities can be seen and filter out from
3.5 FEATURE MATCHING the image.

Here key points in feature extraction step are used for matching 4.3 SIZE MATCHING
of database image with input image on the basis of their
thresholding. SIFT features are first extracted from a set of The size of image in matching reference and input images are
reference images and stored in a database. A new image is same initially. In the matching the images will be subtracted. So
matched by individually comparing each feature from the new we get intensity matrix for all the images. Size matching is
image to this previous database and finding candidate matching important parameter in our work.
features based on Euclidean distance of their feature vectors. If
Euclidean distance is 0.8 times less than secondary least 4.4 SHAPE MATCHING
Euclidean distance then two feature points are match. After
repeated experiment when dist ratio=0.65, there reflect matching The shapes of the crowns of the segmented teeth are used to find
points and remove mismatch points in addition the matching ratio a match between the query case and the cases in the reference
is the best. More match points help to achieve high accuracy; this database. The matching is performed by finding features like
is calculated by using following formula rotation scale and translation. It results in a minimum matching
distance.
𝑛
4.5 SEGMENTATION
𝐸(𝑥, 𝑦) = √∑(𝑥𝑖 − 𝑦𝑖 )2 … … … … … … … . . (1)
𝑖=0
Radiograph is segmented into regions such that each region
contains only a single tooth. There are three steps consists in
E – Eucledian distance, x, y – feature vectors segmentation.

804
1. Filtering of noise is different for dental photograph and radiograph even they have
same experimentation. Output results of 20 persons with 10
2. To isolate the teeth from the background thresholding is photograph and 10 radiograph are shown below.
required.
5.1 EXPERIMENTAL RESULTS OF DENTAL
4.6 FEATURE EXTRACTION PHOTOGRAPH

In canny edge detection is used. Edge is a point in the image From this average matching ratio and average matching time can
where intensities are changing rapidly. It refers to the various be calculated,
mathematical and algorithmic methods by which a computer is
able to map out the edges. Table 1: Dental photograph

4.7 CANNY EDGE DETECTION


Thresh Key points Match Misma Matchi Matchi
Name old points tch ng ng
We can derive the optimal edge operation to find step edges in the
value points ratio time
presence of white noise. (sec.)
Sujeeth 0.0349 317 317 317 00 100% 5
 Good detection- minimum the probability of detecting
false edges and missing real edge. Reeja 0.0349 227 188 38 84% 6
 Good localization- detected edges must be close to the 1175
true edges. Abin 0.0349 244 182 61 75% 7
2442
 Single response- return only one point for each true
Girija 0.0349 529 529 529 00 100% 5
edge point. George 0.0349 319 345 257 55 81% 4.4
Leny 0.0349 359 359 359 00 100% 5
IMAGE Sarath 0.0349 156 158 156 00 100% 4
SMOOTHIN Sinu 0.0349 279 345 253 25 92% 4
G Ajith 0.0349 310 392 275 24 91% 5
GRADIENT COMPUTING Ardra 0.0349 445 703 380 74 87% 5

sum of all matching ratio(%)


Average matching ratio =
NON MAXIMA SUPPRESSION 𝒕𝒐𝒕𝒂𝒍 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑖𝑚𝑎𝑔𝑒𝑠

4699%
= = 94%
HYSTERISYS THRESHOLDING 50

𝑠𝑢𝑚 𝑜𝑓 𝑎𝑙𝑙 𝑚𝑎𝑡𝑐ℎ𝑖𝑛𝑔 𝑡𝑖𝑚𝑒(𝑠𝑒𝑐)


Average matching time =
𝑡𝑜𝑡𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑖𝑚𝑎𝑔𝑒𝑠
if
SET AS ZERO magnitude SET AS EDGE
266.5
>threshold = = 5.33 sec
50

5.2 GRAPHICAL REPRESENTATION OF DENTAL


PHOTOGRAPH
END 600
500 key
Fig. 5 flowchart of canny algorithm 400 points
key points

4.8 IMPLEMENTATION 300 match


200 points
Here the reference images are stored in a program. Input image
are new image which is match with all the reference images. 100
0
V.EXPERIMENTAL RESULTS
0 5 10 15
number of persons
The experiment is done on 50 persons dental radiograph and 50
persons dental photograph. The matching ratio and matching time Fig.6 Graphical representation of key points and match
points

805
5.3 EXPERIMENTAL RESULTS OF DENTAL human teeth for identification due to its stable and unique features
RADIOGRAPH rather than finger prints, face etc. in future work, the million order
data set can be selected and image identification can be done on
Table 2: Dental radiograph large dataset.

Thresh Key Match Mism Matchi Mat REFERENCES


Name old points points atch ng chin
value points ratio g [1] Jianning Xu, “A generalized morphological skeleton
time Transform using both internal and external skeleton points”,
(sec) pattern recognition 47(2014) 2607-2620.
Pinky 0.0349 148 148 148 00 100% 1 [2] Rafael C. Gonzalez, Richard E. Woods,”Digital image
Rahul 0.0349 41 48 6 34 14% 0.9 processing”. Asoke K. Ghosh, Prentice-Hall of India Pvt Ltd.
nd
Pooja 0.0349 60 60 58 00 100% 0.9 2008, 2 Edition
James 0.0349 40 40 38 00 100% 0.6 [3] D. Zhang G. Lu, Review of shape representation and
Sonam 0.0349 71 72 29 39 44% 0.8 description techniques, Pattern recognition. 37(1) (2004) 1-19.
Sam 0.0349 45 45 43 00 100% 0.7 [4] Y.M.Y Hasan, L.J Karam, Morphological reversible contour
Ammu 0.0349 81 81 79 00 100% 0.9 representation, IEEE Trans. Pattern Anal. Mach. Intell.
Albert 0.0349 148 148 146 00 100% 1.1 22(3)(2000) 227-240.
Anjali 0.0349 50 50 48 00 100% 0.7 [5] J. Xu, Shape matching using both internal and external
Jojo 0.0349 71 71 69 00 100% 1 morphological shape components, in: Proceedings of the 2011
International conference on Image Processing, Computer vision,
and pattern recognition, Las Vegas, Nevada, July 2011
Average matching ratio =
sum of all matching ratio(%) [6] D. Zhang, G. Lu, Review of shape representation and
𝑡𝑜𝑡𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑖𝑚𝑎𝑔𝑒𝑠 description techniques, Pattern Recognit. 37 (1) (2004) 1–19.
4666%
[7] S. Loncaric, A survey of shape analysis techniques, Pattern
= = 93% Recognit. 31 (8) (1998) 983–1001.
50
[8] Y.M.Y. Hasan, L.J. Karam, Morphological reversible contour
𝑠𝑢𝑚 𝑜𝑓 𝑎𝑙𝑙 𝑚𝑎𝑡𝑐ℎ𝑖𝑛𝑔 𝑡𝑖𝑚𝑒(𝑠𝑒𝑐)
Average matching time = representation, IEEE Trans. Pattern Anal. Mach. Intell. 22 (3)
𝑡𝑜𝑡𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑖𝑚𝑎𝑔𝑒𝑠
(2000) 227–240.
46.7 [9] R. Kresch, D. Malah, Skeleton-based morphological coding of
= = 0.93 sec
50 binary images, IEEE Trans. Image Process. 7 (10) (1998) 1387–
1399.
5.4 GRAPHICAL REPRESENTATION OF DENTAL
[10] J. Xu, Shape matching using morphological shape
RADIOGRAPH
components and relaxation labeling, in: Proceedings of the 2010
International Conference on Image Processing, Computer Vision,
200 and Pattern Recognition, Las Vegas, Nevada, July 2010
[11] Hong Chen and A.K. Jain. Dental Biometrics: Alignment
150 and Matching of Dental Radiographs, IEEE
key points
key points

Transactions on Pattern Analysis and Machine Intelligence,


100 2005, 27, 8, pp. 1319-1326.
match [12] Vijaykumari Pushparaj, Ulaganathan Gurunathan and
50 points Banumathi Arumugam, Dental Radiographs and
Photographs in Human Forensic Identification, IET Biometrics,
2013, 2, 2, pp. 56-63.
0
[13] E H Said, D E Nassar, M GamalFahmy and H HanyAmmar,
0 5 10 15
number of persons Teeth Segmentation in Digitized Dental X-ray
Films using Mathematical Morphology, IEEE Trans. Inf.
Fig.7: graphical representation of key points and match points Forensics Sec., 2006, 1, 2, pp. 178–189.
[14] Anny Yuniarti, AnindhitaSigitNugroho, BilqisAmaliah and
VI. CONCLUSION AgusZainalArifin, Classification and Numbering
of Dental Radiographs for an Automated Human Identification
From our work, we have studied that computer vision System, TELKOMNIKA, 2012,10,1, pp. 137-146.
identification can be more accurately done using morphological [15]Martin L. Tangel, ChastineFatichah, Fei Yan and Kaoru
skeleton transform. For proving that we used two algorithms Hirota, Dental Classification for Periapical Radiograph
SIFT and canny in our work. By comparing both we concluded Based on Multiple Fuzzy Attribute, IEEE, 2013, 978-1-4799-
that SIFT algorithm is more advanced and efficient. We took 0348-1/13.

806
[16] SurendraRamteke, Rahul Patil and NilimaPatil, A State of
Art Automated Dental Identification System (ADIS),
Advances in computational research, 2012, 4, 1, pp. 95-98.
[17] SunitaSood, PanjuKanwar and Malika Singh, Dental
Biometric as Human Personal Identifier using Pixel
Neighbourhood Segmentation Techniques, International Journal
of computer applications,2014, 96, 11.
[18]MeenalMaurya, SnehaNarvekar, Sachin Naik and
ShubhamShet, Computerized Approach for Dental
Identification using Radiographs, International journal of
scientific and research publication, 2013, 3, 5.
[19] AK Jain and Hong Chen, Matching of Dental X-ray Images
for Human Identification, ELSEVIER Pattern
Recognition, 2004, 37, 1519-1532.
[20]Elizabeth BonsagliaBarboza, AparecidoNilceo Marana and
Denise Tostesliveira, Semiautomated Dental
Recognition using a Graph-based Segmentation Algorithm and
Teeth Shape Features, IEEE, 2012 978-1-4673-
0397-2/12.
[21] IA Pretty and D Sweet, A Look at Forensic Dentistry: The
Role of Teeth in the Determination of Human
Identity.
[22]R L R Tinoco, E C Martins and E Daruge, Dental Anomalies
and their Value in Human Identification, case
report from Piracicaba Dental School State University of
Campinas, Department of Forensic Odontology
Av.Limeira, 901 – Caixa Postal 52.
[23]R F Silva and S D Pereira, Forensic Odontology
Identification using Smile Photograph Analysis, case report
from Av. ArumãQd 186 Lt 06 ParqueAmazôniaGoiânia – GO.
Brazil CEP: 74835-320.
[24]RohitThanki and Deven Trivedi, Introduction of Novel Tooth
for Human Identification based on Dental Image
Matching, International Journal of Emerging Technology and
Advanced Engineering, 2012, 2, 10.
[25]ShubhangiDighe, RevatiShriram, Pre-processing,
Segmentation and Matching of Dental Radiographs used in
Dental Biometrics, International Journal of Science and Applied
Information Technology, 2012, 1, 2.
[26]Wang Xinzui, Dong Ningning, and Li Huanli, Features
Extraction and Matching of Teeth Image Based on the
SIFT Algorithm, The 2nd International Conference on Computer
Application and System Modelling, 2012.
[27]Nourdin Al-sherif, AymanAbaza, and HanyAmmar, Dental
Record Retrieval Based on Guided SIFT
Descriptors, ICCIT 2012.
[28]R C Gonzalez and R E Woods, Digital Image Processing,
1992–2008, 3rd Ed, pp.738-756.
[29]MajaOmanovic and Jeff J Orchard, Exhaustive Matching of
Dental X-rays for Human Forensic Identification,
Journal of the Canadian Society of Forensic Science, 2008, 4, 3.

807