The document proposes a lip recognition method based on the dynamic time warping (DTW) algorithm. It involves preprocessing lip images through normalization, separation of upper and lower lips, and rotation. Feature extraction extracts lip patterns through smoothing, top-hat transformation, and binarization. Projections of lip features are obtained and matched using DTW to determine similarity. The method achieved good results and could be improved by enhancing image quality and comparing more projection angles for forensic identification applications.
The Indian Dental Academy is the Leader in continuing dental education , training dentists in all aspects of dentistry and
offering a wide range of dental certified courses in different formats.
Portrait Parle via Bertillon System By G S ShaktawatG.S Shaktawat
The individualization of the human is very hard thing from the ages. People had done or invented certain ways for the proper individualization of the person. The Bertillon System is the first anthropological technique for individualization invented by Sir Bertillon.
This PPT contains the content mainly from the history to the decline of the Bertillon system. And the center point of the PPT is the Portrait Parle or Bertillonage.
whenever and wherever a Disaster takes place in the form of Tsunami, Earthquake, Terrorist attack or Bomb blast the bodies which we get at the crime scene are either damaged or sometimes face cannot be identified.
The Indian Dental Academy is the Leader in continuing dental education , training dentists in all aspects of dentistry and
offering a wide range of dental certified courses in different formats.
Portrait Parle via Bertillon System By G S ShaktawatG.S Shaktawat
The individualization of the human is very hard thing from the ages. People had done or invented certain ways for the proper individualization of the person. The Bertillon System is the first anthropological technique for individualization invented by Sir Bertillon.
This PPT contains the content mainly from the history to the decline of the Bertillon system. And the center point of the PPT is the Portrait Parle or Bertillonage.
whenever and wherever a Disaster takes place in the form of Tsunami, Earthquake, Terrorist attack or Bomb blast the bodies which we get at the crime scene are either damaged or sometimes face cannot be identified.
Paints: types and composition; Forensic examination of paint: microscopic and macroscopic examination, pigment distribution, micro-chemical analysis, physical matching and solubility test; Analytical tools used in paint comparison
It is one of the topic of criminalistics. Ear prints are one of the important physical evidences that are of significant value in the forensic investigation and helps to reach the perpetrator. ear and every individual are believe to have unique ear prints. They are mainly found on the cases like Burglary, theft, Homicide, etc.
INTRO:
Nowadays, person identification (recognition) and verification is very important in security and resource access control.
Biometrics is the science of automatic recognition of individual depending on their physiological and behavioral attributes.
For centuries, handwritten signatures have been an integral part of validating business transaction contracts and agreements.
Among the different forms of biometric recognition systems such as
fingerprint, iris, face, voice, palm etc., signature will be most widely used.
SIGNATURE RECOGNITION
Signature Recognition is the procedure of determining to whom a particular signature belongs to.
Depending on acquiring of signature images, there are two types of signature recognition systems:
Online Signature Recognition
Offline Signature Recognition
STEPS
IMAGE ACQUSITION
Collection of signatures from 50 persons on blank paper.
The collected signatures are scanned to get images in JPG format to create database.
PREPROCESSING
Image pre-processing is a technique to enhance raw images received from cameras/sensors placed on satellites, space probes and aircrafts or pictures taken in normal day-to-day life for various applications.
The techniques for preprocessing used are
RGB to Gray Scale Conversion
Binarization
Thinning
Bounding Box
FEATURE EXTRACTION
Features are the characters to be extracted from the processed image.
It has used two feature techniques
Global Features
Grid Features
DWT
After applying DWT to all 9 blocks, each block is divided into horizontal, vertical and diagonal components. From each components two features mainly horizontal and vertical projection positions are extracted. Total 54 (9 x 3 x 2) features are extracted.
Grid features extracted from each block are
Horizontal Projection Position
Vertical Projection Position
Algorithm for Training phase
Description: Retrieval of a signature image from a database
Input: Training sample images.
Output: Construction of Back Propagation Neural Network.
Begin
Read the training samples images
Step1: Pre-processing
Convert the image into gray scale image.
Convert the gray scale image into binary image.
Apply thinning process.
Apply bounding box.
Step 2: Features Extracted.
Step 3: Back propagation neural network training.
end // end of proposed algorithm
Single Metal Deposition : Technique of Latent Fingerprint DevelopmentRitujaGharote
It is a process of Latent Fingerprint Development. It includes a Comparative study with Multi Metal Deposition, another method of Latent Fingerprint Development.
Paints: types and composition; Forensic examination of paint: microscopic and macroscopic examination, pigment distribution, micro-chemical analysis, physical matching and solubility test; Analytical tools used in paint comparison
It is one of the topic of criminalistics. Ear prints are one of the important physical evidences that are of significant value in the forensic investigation and helps to reach the perpetrator. ear and every individual are believe to have unique ear prints. They are mainly found on the cases like Burglary, theft, Homicide, etc.
INTRO:
Nowadays, person identification (recognition) and verification is very important in security and resource access control.
Biometrics is the science of automatic recognition of individual depending on their physiological and behavioral attributes.
For centuries, handwritten signatures have been an integral part of validating business transaction contracts and agreements.
Among the different forms of biometric recognition systems such as
fingerprint, iris, face, voice, palm etc., signature will be most widely used.
SIGNATURE RECOGNITION
Signature Recognition is the procedure of determining to whom a particular signature belongs to.
Depending on acquiring of signature images, there are two types of signature recognition systems:
Online Signature Recognition
Offline Signature Recognition
STEPS
IMAGE ACQUSITION
Collection of signatures from 50 persons on blank paper.
The collected signatures are scanned to get images in JPG format to create database.
PREPROCESSING
Image pre-processing is a technique to enhance raw images received from cameras/sensors placed on satellites, space probes and aircrafts or pictures taken in normal day-to-day life for various applications.
The techniques for preprocessing used are
RGB to Gray Scale Conversion
Binarization
Thinning
Bounding Box
FEATURE EXTRACTION
Features are the characters to be extracted from the processed image.
It has used two feature techniques
Global Features
Grid Features
DWT
After applying DWT to all 9 blocks, each block is divided into horizontal, vertical and diagonal components. From each components two features mainly horizontal and vertical projection positions are extracted. Total 54 (9 x 3 x 2) features are extracted.
Grid features extracted from each block are
Horizontal Projection Position
Vertical Projection Position
Algorithm for Training phase
Description: Retrieval of a signature image from a database
Input: Training sample images.
Output: Construction of Back Propagation Neural Network.
Begin
Read the training samples images
Step1: Pre-processing
Convert the image into gray scale image.
Convert the gray scale image into binary image.
Apply thinning process.
Apply bounding box.
Step 2: Features Extracted.
Step 3: Back propagation neural network training.
end // end of proposed algorithm
Single Metal Deposition : Technique of Latent Fingerprint DevelopmentRitujaGharote
It is a process of Latent Fingerprint Development. It includes a Comparative study with Multi Metal Deposition, another method of Latent Fingerprint Development.
Here's an introduction to the field of Forensic Odontology; role and scope. A summary of the type of cases where the expertise of an odontologist is required. Special emphasis is given on the dental profiling.
Effective segmentation of sclera, iris and pupil in noisy eye imagesTELKOMNIKA JOURNAL
In today’s sensitive environment, for personal authentication, iris recognition is the most attentive
technique among the various biometric technologies. One of the key steps in the iris recognition system is
the accurate iris segmentation from its surrounding noises including pupil and sclera of a captured
eye-image. In our proposed method, initially input image is preprocessed by using bilateral filtering.
After the preprocessing of images contour based features such as, brightness, color and texture features
are extracted. Then entropy is measured based on the extracted contour based features to effectively
distinguishing the data in the images. Finally, the convolution neural network (CNN) is used for
the effective sclera, iris and pupil parts segmentations based on the entropy measure. The proposed
results are analyzed to demonstrate the better performance of the proposed segmentation method than
the existing methods.
Face Recognition System Using Local Ternary Pattern and Signed Number Multipl...inventionjournals
This paper presents a novel approach to face recognition. The task of face recognition is to verify a claimed identity by comparing a claimed image of the individual with other images belonging to the same individual/other individual in a database. The proposed method utilizes Local Ternary Pattern and signed bit multiplication to extract local features of a face. The image is divided into small non-overlapping windows. Processing is carried out on these windows to extract features. Test image’s features are compared with all the training images using Euclidean's distance. The image with lowest Euclidean distance is recognized as the true face image. If the distance between test and all training images is more than threshold then test image is considered as unrecognised image or match not found .The face recognition rate of proposed system is calculated by varying the number of images per person in training database
Proposition of local automatic algorithm for landmark detection in 3D cephalo...journalBEEI
This study proposes a new contribution to solve the problem of automatic landmarks detection in three-dimensional cephalometry. 3D images obtained from CBCT (cone beam computed tomography) equipment were used for automatic identification of twelve landmarks. The proposed method is based on a local geometry and intensity criteria of skull structures. After the step of preprocessing and binarization, the algorithm segments the skull into three structures using the geometry information of nasal cavity and intensity information of the teeth. Each targeted landmark was detected using local geometrical information of the volume of interest containing this landmark. The ICC and confidence interval (95% CI) for each direction were 0, 91 (0.75 to 0.96) for x- direction; 0.92 (0.83 to 0.97) for y-direction; 0.92 (0.79 to 0.97) for z-direction. The mean error of detection was calculated using the Euclidian distance between the 3D coordinates of manually and automatically detected landmarks. The overall mean error of the algorithm was 2.76 mm with a standard deviation of 1.43 mm. Our proposed approach for automatic landmark identification in 3D cephalometric was capable of detecting 12 landmarks on 3D CBCT images which can be facilitate the use of 3D cephalometry to orthodontists.
REMOVING RAIN STREAKS FROM SINGLE IMAGES USING TOTAL VARIATIONijma
ABSTRACT
Rainy image restoration is considered asone of the most important image restorations aspects to improve the outdoor vision. Many fields have used this kind of restorations such as driving assistant, environment monitoring, animals monitoring, computer vision, face recognition, object recognition and personal photos. Image restoration simply means how to remove the noise from the images. Most of the images have some noises from the environment. Moreover, image quality assessment plays an important role in the valuation of image enhancement algorithms. In this research, we will use a total variation to remove rain streaks from a single image. It shows a good performance compared to other methods, using some measurements MSE, PSNR, and VIF for an image with references and BRISQUE for an image without references.
From unimodal image classification to integrative multimodal deep learning pipelines in disease classification, disease management and predictive personalised healthcare.
Automated Diagnosis of Glaucoma using Haralick Texture FeaturesIOSR Journals
Abstract : Glaucoma is the second leading cause of blindness worldwide. It is a disease in which fluid
pressure in the eye increases continuously, damaging the optic nerve and causing vision loss. Computational
decision support systems for the early detection of glaucoma can help prevent this complication. The retinal
optic nerve fibre layer can be assessed using optical coherence tomography, scanning laser polarimetry, and
Heidelberg retina tomography scanning methods. In this paper, we present a novel method for glaucoma
detection using an Haralick Texture Features from digital fundus images. K Nearest Neighbors (KNN)
classifiers are used to perform supervised classification. Our results demonstrate that the Haralick Texture
Features has Database and classification parts, in Database the image has been loaded and Gray Level Cooccurrence
Matrix (GLCM) and thirteen haralick features are combined to extract the image features, performs
better than the other classifiers and correctly identifies the glaucoma images with an accuracy of more than
98%. The impact of training and testing is also studied to improve results. Our proposed novel features are
clinically significant and can be used to detect glaucoma accurately.
Keywords: Glaucoma, Haralick Texture features, KNN Classifiers, Feature Extraction
Image Denoising Based On Sparse Representation In A Probabilistic FrameworkCSCJournals
Image denoising is an interesting inverse problem. By denoising we mean finding a clean image, given a noisy one. In this paper, we propose a novel image denoising technique based on the generalized k density model as an extension to the probabilistic framework for solving image denoising problem. The approach is based on using overcomplete basis dictionary for sparsely representing the image under interest. To learn the overcomplete basis, we used the generalized k density model based ICA. The learned dictionary used after that for denoising speech signals and other images. Experimental results confirm the effectiveness of the proposed method for image denoising. The comparison with other denoising methods is also made and it is shown that the proposed method produces the best denoising effect.
PREVENTING COPYRIGHTS INFRINGEMENT OF IMAGES BY WATERMARKING IN TRANSFORM DOM...ijistjournal
Images are undoubtedly the most efficacious and easiest means of communicating an idea. They are surely an indispensable part of human life .The trend of sharing images of various kinds for example typical technical figures, modern exceptional masterpiece from an artist, photos from the recent picnic to hill station etc, on the internet is spreading like a viral. There is a mandatory requirement for checking the privacy and security of our personal digital images before making them public via the internet. There is always a threat of our original images being illegally reproduced or distributed elsewhere. To prevent the misuse and protect the copyrights, an efficient solution has been given that can withstand many attacks. This paper aims at encoding of the host image prior to watermark embedding for enhancing the security. The fast and effective full counter propagation neural network helps in the successful watermark embedding without deteriorating the image perception. Earlier techniques embedded the watermark in the image itself but is has been observed that synapses of neural network provide a better platform for reducing the distortion and increasing the message capacity.
Regenerating face images from multi-spectral palm images using multiple fusio...TELKOMNIKA JOURNAL
This paper established a relationship between multi-spectral palm images and a face image based
on multiple fusion methods. The first fusion method to be considered is a feature extraction between different
multi-spectral palm images, where multi-spectral CASIA database was used. The second fusion method to
be considered is a score fusion between two parts of an output face image. Our method suggests that both
right and left hands are used, and that each hand aims to produce a significant part of
a face image by using a Multi-Layer Perceptron (MLP) network. This will lead to the second fusion part to
reconstruct the full-face image, in order to examine its appearance. This topology provided interesting results
of Equal Error Rate (EER) equal to 1.99%.
Computationally Efficient Methods for Sonar Image Denoising using Fractional ...CSCJournals
Sonar images produced due to the coherent nature of scattering phenomenon inherit a multiplicative component called speckle and contain almost homogeneous as well as textured regions with relatively rare edges. Speckle removal is a pre-processing step required in applications like the detection and classification of objects in the sonar image. In this paper computationally efficient Fractional Integral Mask algorithms to remove the speckle noise from sonar images is proposed. Riemann- Liouville definition of fractional calculus is used to create Fractional integral masks in eight directions. The use of a mask incorporated with the significant coefficients from the eight directional masks and a single convolution operation required in such case helps in obtaining the computational efficiency. The sonar image heterogeneous patch classification is based on a new proposed naive homogeneity index which depends on the texture strength of the patches and despeckling filters can be adjusted to these patches. The application of the mask convolution only to the selected patches again reduce the computational complexity. The non-homomorphic approach used in the proposed method avoids the undesired bias occurring in the traditional homomorphic approach. Experiments show that the mask size required directly depends on the fractional order. Mask size can be reduced for lower fractional orders thus ensuring the computation complexity reduction for lower orders. Experimental results substantiate the effectiveness of the despeckling method. The different non reference image performance evaluation criterion are used to evaluate the proposed method.
Binary operation based hard exudate detection and fuzzy based classification ...IJECEIAES
Diabetic retinopathy (DR) is one of the most considerable reasons for visual impairment. The main objective of this paper is to automatically detect and recognize DR lesions like hard exudates, as it helps in diagnosing and screening of the disease. Here, binary operation based image processing for detecting lesions and fuzzy logic based extraction of hard exudates on diabetic retinal images are discused. In the initial stage, the binary operations are used to identify the exudates. Similarly, the RGB channel space of the DR image is used to create fuzzy sets and membership functions for extracting the exudates. The membership directives obtained from the fuzzy rule set are used to detect the grade of exudates. In order to evaluate the proposed approach, experiment tests are carriedout on various set of images and the results are verified. From the experiment results, the sensitivity obtained is 98.10%, specificity is 96.96% and accuracy is 98.2%. These results suggest that the proposed method could be a diagnostic aid for ophthalmologists in the screening for DR.
Shift Invariant Ear Feature Extraction using Dual Tree Complex Wavelet Transf...IDES Editor
Since last 10 years various methods have been used
for ear recognition. This paper describes the automatic
localization of an ear and its segmentation from the side pose
of face image. In this paper, authors have proposed a novel
approach of feature extraction of iris image using 2D Dual
Tree Complex Wavelet Transform (2D-DT-CWT) which
provides six sub-bands in 06 different orientations, against 3
orientations in DWT. DT-CWT being complex it exhibit the
property of shift invariance. Ear features vectors are obtained
by computing mean, standard deviation, energy and entropy
of these six sub-bands DT-CWT and three sub-bands of DWT
Canberra distance and Euclidian distance are used for
matching. The accuracy of recognition is achieved above 97
%.
A tale of scale & speed: How the US Navy is enabling software delivery from l...sonjaschweigert1
Rapid and secure feature delivery is a goal across every application team and every branch of the DoD. The Navy’s DevSecOps platform, Party Barge, has achieved:
- Reduction in onboarding time from 5 weeks to 1 day
- Improved developer experience and productivity through actionable findings and reduction of false positives
- Maintenance of superior security standards and inherent policy enforcement with Authorization to Operate (ATO)
Development teams can ship efficiently and ensure applications are cyber ready for Navy Authorizing Officials (AOs). In this webinar, Sigma Defense and Anchore will give attendees a look behind the scenes and demo secure pipeline automation and security artifacts that speed up application ATO and time to production.
We will cover:
- How to remove silos in DevSecOps
- How to build efficient development pipeline roles and component templates
- How to deliver security artifacts that matter for ATO’s (SBOMs, vulnerability reports, and policy evidence)
- How to streamline operations with automated policy checks on container images
PHP Frameworks: I want to break free (IPC Berlin 2024)Ralf Eggert
In this presentation, we examine the challenges and limitations of relying too heavily on PHP frameworks in web development. We discuss the history of PHP and its frameworks to understand how this dependence has evolved. The focus will be on providing concrete tips and strategies to reduce reliance on these frameworks, based on real-world examples and practical considerations. The goal is to equip developers with the skills and knowledge to create more flexible and future-proof web applications. We'll explore the importance of maintaining autonomy in a rapidly changing tech landscape and how to make informed decisions in PHP development.
This talk is aimed at encouraging a more independent approach to using PHP frameworks, moving towards a more flexible and future-proof approach to PHP development.
Pushing the limits of ePRTC: 100ns holdover for 100 daysAdtran
At WSTS 2024, Alon Stern explored the topic of parametric holdover and explained how recent research findings can be implemented in real-world PNT networks to achieve 100 nanoseconds of accuracy for up to 100 days.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Generative AI Deep Dive: Advancing from Proof of Concept to ProductionAggregage
Join Maher Hanafi, VP of Engineering at Betterworks, in this new session where he'll share a practical framework to transform Gen AI prototypes into impactful products! He'll delve into the complexities of data collection and management, model selection and optimization, and ensuring security, scalability, and responsible use.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfPaige Cruz
Monitoring and observability aren’t traditionally found in software curriculums and many of us cobble this knowledge together from whatever vendor or ecosystem we were first introduced to and whatever is a part of your current company’s observability stack.
While the dev and ops silo continues to crumble….many organizations still relegate monitoring & observability as the purview of ops, infra and SRE teams. This is a mistake - achieving a highly observable system requires collaboration up and down the stack.
I, a former op, would like to extend an invitation to all application developers to join the observability party will share these foundational concepts to build on:
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
Sudheer Mechineni, Head of Application Frameworks, Standard Chartered Bank
Discover how Standard Chartered Bank harnessed the power of Neo4j to transform complex data access challenges into a dynamic, scalable graph database solution. This keynote will cover their journey from initial adoption to deploying a fully automated, enterprise-grade causal cluster, highlighting key strategies for modelling organisational changes and ensuring robust disaster recovery. Learn how these innovations have not only enhanced Standard Chartered Bank’s data infrastructure but also positioned them as pioneers in the banking sector’s adoption of graph technology.
Communications Mining Series - Zero to Hero - Session 1DianaGray10
This session provides introduction to UiPath Communication Mining, importance and platform overview. You will acquire a good understand of the phases in Communication Mining as we go over the platform with you. Topics covered:
• Communication Mining Overview
• Why is it important?
• How can it help today’s business and the benefits
• Phases in Communication Mining
• Demo on Platform overview
• Q/A
Communications Mining Series - Zero to Hero - Session 1
Lip recognition
1. Lips Recognition
Based on DTW Algorithm
Presented by-
Piyush Mittal
(211CS2281)
Information Security
Computer Science and
06/24/12 Engineering Department 1
2. 2
National Institute of Technology, Rourkela 06/24/12
Overview
French criminologist, Edmond Locard, first recommended
the use of lip prints for criminal identification in 1932.
Lip prints are impressions of human lips left on the objects
such as drinking glasses, cigarettes, drink containers,
aluminium foils, etc.
Study of human lips as a means of personal identification
was started in 1970s by two Japanese scientists Yasuo and
Kazuo Suzuki.
The uniqueness of lip prints makes cheiloscopy especially
effective when evidence is discovered at the crime scene such
as for example lipstick blot marks, cups or glasses and even
envelopes.
3. 3
National Institute of Technology, Rourkela 06/24/12
Overview
Similarly to fingerprint patterns, lip prints have the following
particular properties: permanence, indestructibility and
uniqueness.
Lip prints are genotypically determined and therefore and
unique and stable throughout life of human being.
Additionally, lip prints are not only unique to an individual
but also offer the potential for recognition of an individual’s
gender.
The lip imprints can be captured by special police materials
(paper, special cream and magnetic powder). Such obtained
imprint pictures are then scanned.
4. 4
National Institute of Technology, Rourkela 06/24/12
FEATURE EXTRACTION
5. 5
National Institute of Technology, Rourkela 06/24/12
1 Image normalization
6. 6
06/24/12
1.1 Detection of lip area
National Institute of Technology, Rourkela
It consists of several steps –
In the first step, normalization of the image histogram is carried out.
Then, pixels whose value is greater than the accepted threshold (180) are
converted to the white color.
Next, median filter with mask 7×7 is used to blur the image.
In the last step, binarization is conducted according to the following formula:
0.516.I ( x, y )
I BIN ( x, y ) = 1 − round( )
I AVG
where:
I ( x, y )– value of the pixel at coordinates (x,y) before Binarization,
I AVG– average value of the all image pixels before binarization,
I BIN ( x, y ) – value of the pixel at coordinates (x,y) after binarization.
The value of 0.516 in the formula was experimentally determined.
8. 8
06/24/12
National Institute of Technology, Rourkela
1.2 Separation of Upper and Lower Lip
Separation is determined by a curve that runs through the
centre of the space between the lips Designated curve divides
the lip print into an upper and lower lip.
9. 9
National Institute of Technology, Rourkela 06/24/12
1.3 Lip Print Rotation
The curve obtained in the previous stage is then approximated
by a straight line (Fig. 3a). For a given straight line equation, a
rotation angle towards the X – axis can be determined. It
allows obtaining a separation line which will be parallel to the
Cartesian OX axis. Rotated lip print image is shown in Fig. 3b.
10. 10
National Institute of Technology, Rourkela 06/24/12
Based on the data obtained in the steps (1)-(3)
we get a lip print image rotated and divided
into upper and lower lip (Fig. 4).
11. 11
National Institute of Technology, Rourkela 06/24/12
2. Lip pattern extraction
12. 12
National Institute of Technology, Rourkela 06/24/12
2.1 Lip pattern smoothing
This process aims to improve the quality level of the
lines forming the lip pattern. The smoothing masks
5×5 are depicted in the Fig. 5.
13. 13
National Institute of Technology, Rourkela 06/24/12
The procedure is repeated for the all masks depicted on the
Fig. 5. Then, the mask with the largest cumulative value of
the sum is ultimately selected. For the selected in the
previous step mask, the average value of the pixels lying on
the elements of the mask is calculated and copied to the
central point of the analyzed source image. The effect of the
image smoothing inside of the interest region is shown in
Fig. 6.
14. 14
National Institute of Technology, Rourkela 06/24/12
2.2 Top-hat transformation
The purpose of this procedure is to emphasize lines of the lip
pattern and separate them from the background. To increase
effectiveness of the algorithm, transformation is applied
twice using different mask sizes. The following masks are
used: 2×2 to highlight thin lines (up to 3 pixels) and 6×6 to
highlight thick lines (more than 3 pixels). The results of the
top-hat transformation are depicted in the Fig. 7.
15. 15
2.3 Binarization
National Institute of Technology, Rourkela 06/24/12
This procedure is applied according to the formula below for
both images resulted from the top-hat transformation. For
the thin lines binarization threshold value was set to t=15,
while for the thick lines this parameter was established to
t=100.
IBIN(x,y) = 1 for I(x,y)>t
0 for I(x,y)<=t
where:
I(x,y) – value of the pixel at the coordinates (x, y) before binarization,
t – binarization threshold,
IBIN(x,y)-value of the pixel at the coordinates (x, y) after binarization.
16. 16
National Institute of Technology, Rourkela 06/24/12
The effect of the lip print image binarization is
shown in Fig. 8.
17. 17
National Institute of Technology, Rourkela 06/24/12
In the last stage, sub-images for the thin and thick lines are
combined into a single image, and then the obtained
global image is denoised. For the noise reduction,
appropriate 7×7 dimensional masks have been designed. It is
depicted on Fig.9.
18. 18
National Institute of Technology, Rourkela 06/24/12
For each of the masks number of black pixels in the
highlighted area of the mask is counted. If the number of the
black pixels is less than 5, then the central pixel of the mask
is converted to the white color.
Additionally, the area of the 11×11 pixels around the central
point of the mask is searched. If there are less than 11 pixels
inside of defined area, then the value of the central point of
the mask is converted to the white color. Example of the
noise reduction is shown in the Fig.10.
20. 20
National Institute of Technology, Rourkela 06/24/12
3 Feature extraction
The feature extraction algorithm is carried out for both the
upper and lower lip. This process relies on determination of
the vertical, horizontal and diagonal projections of the lip
pattern image. The exemplary projections of the image lip
print pixels towards the appropriate axes are presented in
Fig.11.
Projections are one-dimensional vectors represented in a form
of specialized histograms. Each projection shows number of
the black pixels which lie towards the appropriate direction:
horizontal, vertical, oblique for 45° and 135°angles.
22. 22
National Institute of Technology, Rourkela 06/24/12
THE DTW METHOD
Two sequences Q={q1, …, qn} and U={u1, …, um} being
compared, the D matrix of the size n×m is built in the first
stage. It allows to align the two sequences Q and U. The
matrix element D(i, j) contains the distance between the
points qi and uj, so D(i, j)=d(qi,uj).
In this study, the Euclidean distance was applied.
On the basis of the elements D(i, j) so-called sequences
matching cost have to be determined. When cost matching is
lower then both sequences Q and U are more similar.
23. 23
National Institute of Technology, Rourkela 06/24/12
In the next stage, the warping path W is determined. The path
W consists of a set of the some elements of the matrix D what
allows to define a mapping between the sequences Q and U.
The warping path can be determined as follows:
W=w1,w2,...,wl , max(n,m) ≤l≤n+m−1
The wh element of the path W is defined as:
Wh =D(i ,j), h=1,....l i=1,.....,n j=1,.....,m
24. 24
National Institute of Technology, Rourkela 06/24/12
A correctly determined path W has to fulfill a few
conditions:
The first element of the sequence Q must be matched to
the first element of the sequence U:
w1 =w(1,1)=D(1,1)
The last element of the sequence Q must be matched to
the last element of the sequence U:
wl=w(n , m)=D(n , m)
Next assignments in the path cannot concern elements
of sequences that are distant from each other more than
one instant t:
it - it-1<=1 and jt - jt-1<=1
Points of the warping path W must be arranged
monotonically in time:
it - it-1 >=0 and jt - jt-1 >=0
25. 25
National Institute of Technology, Rourkela 06/24/12
The D matrix together with the warping path for
two sample sequences is shown in Fig. 12.
26. 26
06/24/12
National Institute of Technology, Rourkela
The elements wk of the path W can be found very efficiently
using dynamic programming. The path W determination starts
from the upper right corner of the populated matrix D. In the
first step i=m and j=n, so wl = D(n,m) . Then the next
coordinates of the cell of the matrix D will be fixed from the
formula:
27. 27
National Institute of Technology, Rourkela 06/24/12
Now, on the basis of the all elements w1,w2,…,wl
of the path W the total (cumulative) matching
cost γ can be calculated:
28. 28
National Institute of Technology, Rourkela 06/24/12
Comparison of the lip print projections was done using
the following algorithm:
1. Matching of horizontal, vertical and oblique (angle of 45° and
135°) projections from the tested and template lip prints using
the DTW algorithm (separately for the upper and lower lip).
2. Computation of the matching cost of all corresponding
projections by means of the formula (i,j) and averaging the
result.
29. 29
National Institute of Technology, Rourkela 06/24/12
DTW path for projections of two different sample lip
prints are shown in the Fig.13.
30. 30
National Institute of Technology, Rourkela 06/24/12
CONCLUSIONS AND FUTURE WORKS
Considering this fact it can be stated that the results obtained
by the proposed method are good and indicate the possibility
of using this approach in forensic identification systems.
In future studies, further improvement of lip print image
quality will be also performed. It is also planned to compare a
larger number of projections generated for different angles.
Additionally, are planed studies where only part of the lip
print will be analyzed .
31. 31
National Institute of Technology, Rourkela 06/24/12
REFERENCES
• Lukasz Smacki, Krzysztof Wrobel, Piotr Porwik, “Lip Print
Recognition Based on DTW Algorithm,” Department of
Computer Systems, University of Silesia, Katowice, Poland,
2011
• E.J. Keogh, and M.J. Pazzani, “Computer Derivative
Dynamic Time Warping,” Proc. First SIAM International
Conference on Data Mining, Chicago, USA, 2001, pp. 1-11.
32. 32
National Institute of Technology, Rourkela 06/24/12
Any Suggestions?
33. 33
National Institute of Technology, Rourkela 06/24/12
For more information visit- www.piyushmittal.in