Documente Academic
Documente Profesional
Documente Cultură
IIT Roorkee.
Seminar report on
Abstract
Biometrics is a pattern recognition problem for automatic
recognition or verification of an individuals identity based on a
feature vector(s) derived from their physiological and/or behavioural
characteristic. Biometric systems should provide a reliable personal
recognition/verification which cannot be fooled by fraudulent
impostors. Handwritten signature is a common biometric used to
authenticate financial transactions including cheques, credit card
validation etc. or to sanction the contents of a document like
certificates, contracts etc... As a biometric system relies on what you
are or what you do rather than what you possess (a Personal
Identification Number or a Password) to establish the identity of the
individual, it is much more robust than other traditional
recognition/verification schemes. In this report, a brief overview of
biometric methods will be presented. Major focus will be on
signature verification.
Contents
1. Introduction
........................................................................... 4
2. Biometric Systems .......................................................................... 5
3. Signature Verification System ..................................... 9
4. Features in signature verification ............................................. 11
5. Signature Feature Matching ............................................................. 13
6. Conclusion
................................................................................... 19
7. References
....................................................................... 20
1. Introduction
With the proliferation of information and communication technologies, the humanmachine interaction has become a matter of routine in modern day to day life. We are
interacting with machines at work place, at leisure, during travel, at home or any other
place. All our day to day transactions are being conducted through various
interconnected electronic devices. Many of these transactions require authenticated
access for security reasons. In order to protect all these transactions from various
fraudulent practices it is very important to come up with a method so that the machine
we interact with to complete the transaction can establish the identity of individuals.
Traditional approaches rely on what you possess like Personal Identification Number
or ID card but approaches like these are not sufficiently reliable to satisfy the security
requirements of electronic transactions because they lack the capability to differentiate
between a genuine individual and impostor who fraudulently acquires the access
privilege. Biometrics, which refers to the identity of the individual based on his/her
physiological or behavioural characteristics, relies on something which you are or
what you do to make personal identification and, therefore, inherently has the
capability to differentiate between a genuine individual and a fraudulent impostor [1].
A Biometric system depends on pattern recognition/classification techniques to
establish the identity of an individual. Pattern Recognition techniques assign a
physical object or an event to one of the pre-specified categories. The pattern
recognition problem is difficult because various sources of noise distort the patterns,
and often within a class there is substantial variability in patterns.
Every Pattern recognition based Biometric system has two major objectives:
i.
To select appropriate features from raw biometric data. Feature extraction can
be stated as the problem of extracting from the raw data, the information which
is most relevant for classification purposes, in the sense of minimizing the
within-class pattern variability while enhancing the between class pattern
variability [2].
ii.
2. Biometric Systems
A biometric system which is essentially a pattern recognition system uses the
physiological or behavioural characteristics of an individual to recognize the person.
A feature vector is extracted from the biometric data collected from the individual
being enrolled in the system and is stored in the system database as a template for
future queries. Depending on the application context, a biometric system may operate
either in verification mode or identification mode. While identification involves
comparing the acquired biometric information against templates corresponding to all
users in the database, verification involves comparison with only those templates
corresponding to the claimed identity. This implies that identification and verification
are two problems that should be dealt with separately.
In the verification problem we consider two categories or classes w1 and w2, where w1
indicates that the claim is true (a genuine user) and w2 indicates that the claim is false
(an impostor). Each pattern is described by a feature vector X Rd. An input feature
vector XQ is extracted from biometric data of the individual being tested and the
individual specifies the claimed identity I. Now the verification problem is to
determine if (I, XQ) belongs to class w1 or w2. Typically, XQ is matched against, the
biometric template corresponding to user I, to determine its category. Thus
Bayes formula shows that by observing the value of s we can convert the prior
probability P (wj) to the a posteriori probability P (wj | s), the probability of that the
individual belongs to class wj given that similarity measured is s.
For a given s we can minimize the probability of error by deciding w1 if P (w1|x) and
w2 otherwise. This is called Bayes Decision Rule [3].
The Biometric system decision is regulated by the threshold t. The threshold is chosen
such that it satisfies the Bayes Decision Rule. The pairs of biometric samples
generating scores higher than or equal to t are inferred as mate pairs (i.e., belonging to
the same person); pairs of biometric samples generating scores lower than t are
inferred as non-mate pairs (i.e., belonging to different persons). The distribution of
scores generated from pairs of samples from the same person is called the genuine
distribution and from different persons is called the impostor distribution.
6
The probabilities associated with the four possible outcomes of the system:
i.
ii.
iii.
iv.
P (s>t | XQ w1): a hit, the probability that the similarity measure is greater
than the threshold and the individual is a genuine user.
P (s>t | XQ w2): a miss, the probability that the similarity measure is greater
than the threshold but the individual is not a genuine user.
P (s<t | XQ w1): a false rejection, the probability that the similarity measure is
less than the threshold but the individual is a genuine user.
P (s<t | XQ w2): a correct rejection, the probability that the similarity measure
is less than the threshold and the individual is not a genuine user.
As it can be seen from four possible outcomes the biometric verification systems
outcome can be erroneous in two cases:
1. When the biometric measurements from two different persons are misjudged to
be from same person. This type of error is called false match or a miss.
2. When the biometric measurements from the same person are judged to
input does not come from the same person as the template XI;
input comes from the same person as the template XI.
The decision rule is as follows. If the matching score is less than the system threshold,
then decide D0, else decide. The above terminology is borrowed from communication
theory, where the goal is to detect a message in the presence of noise. H0 is the
hypothesis that the received signal is noise alone; and H1 is the hypothesis that the
received signal is message plus the noise. Such a hypothesis testing formulation
inherently contains two types of errors [1].
Type I: false match (D1 is decided when H0 is true);
Type II: false non-match (D0 is decided when H1 is true).
FMR is the probability of type-I error (also called significance level in hypothesis
testing) and FNMR is the probability of type-II error as
FMR = P (D1|H0)
FNMR = P (D0|H1)
Figure 1. Biometric system error rates. (a) FMR and FNMR for a given threshold t are displayed
over the genuine and impostor score distributions; FMR is the percentage of non-match pairs
whose matching scores are greater than or equal to t, and FNMR is the percentage of mate pairs
whose matching scores are less than t. (b) Choosing different operating points results in different
FMR and FNMR. The curve relating FMR to FNMR at different thresholds is referred to as receiver
operating characteristics (ROC). Typical operating points of different biometric applications are
displayed on an ROC curve. Lack of understanding of the error rates is a primary source of
confusion in assessing system accuracy in vendor/user communities a like [1].
10
In region based shape description techniques, all the points within the shape are
considered to obtain the shape description or representation. These techniques
generally use moment descriptors to describe shape. Moments and functions of
moments have been utilized in a number of applications to achieve invariant
recognition of two dimensional image patterns [10]. The most common moments used
are geometric moments, Zernike moments, Legendre moments etc. Region moment
representation of the shape interprets a normalized grey level image function as a
probability density of a 2D random variable. Moments capture the global information
such as overall orientation, elongation etc. missing from many pure contour based
representations. Just like Fourier series the first few terms of the moment capture the
more general shape properties while the higher terms capture the finer detail.
Contour based shape description techniques use only the boundary data of the shape.
Contour based methods can be classified as: global descriptors, shape signatures, and
spectral descriptors [9]. Global descriptors such as area, circularity, eccentricity, axis
orientation can only be used to discriminate shapes with large dissimilarities; therefore
it is suitable only for filtering process. Shape signatures are essentially local
representations of shape features. Common shape signatures are complex coordinates,
curvature and angular representations etc., they are very sensitive to noise and are not
robust. They also require large computation during similarity measure. Therefore
these local representations require further processing using spectral transforms such as
Fourier transform and wavelet transform. Spectral descriptors such as Fourier
descriptor and wavelet descriptor are usually derived from shape signatures by taking
their Fourier transform and wavelet transform respectively. In Fourier descriptor the
first few low frequency terms capture the coarse information of the contour while the
higher frequency terms capture the finer detail of the contour. The advantage of
wavelet descriptor over Fourier descriptor is that wavelet descriptor achieve
localization in both space and frequency domain simultaneously. However, the
wavelet transform require intensive calculation in the matching stage.
.
Figure 3. The signature and its envelope with the values of area, angle and number of black pixels
associated with each sample on the contour [8].
12
Where Q(S) stands for marginalized joint probability of the multiset S under the
family F.
14
ii.
iii.
N, the number of states in the model. The states are hidden but still in many
practical applications there is some significance attached with the states. States
are interconnected to one another. The individual states are denoted as S = {S1,
S2,.,SN}.
M, the number of observable outcomes possible per state. The set observable
outcomes form an alphabet. These observable outcomes correspond to the
physical output of the system being modelled. The outcomes are denoted as V
= {v1, v2,.,vM}.
A={aij}, the state transition probabilities where
aij = P (qt+1 = Sj | qt = Sj),
iv.
1 i, j N
v.
For the HMM model to be useful in real life applications there are three problems that
have to be solved [16].
Problem 1: Given the output sequence O = O1O2..OT, and a HMM model = (A, B,
), we have to efficiently compute P (O| ), the probability of observing the sequence
O, given the model .
Problem 2: Given the observation sequence O = O1O2..OT and a HMM model , we
have to find a corresponding state sequence Q = q1q2.qT which is most probable.
Problem 3: How to find a HMM model that maximizes P (O| ).
Problem 1 is solved using forward backward algorithm which uses recursion to
calculate P (O| ) for partial sequences starting with sequence of length one up to
length T. Problem 2 is solved using Viterbi algorithm using dynamic programming.
Problem 3 is solved iteratively using Baum Welch algorithm. All these algorithms are
described in [14].
15
16
Figure 4: The warping grid with the reference template and the probe template aligned along the
y-axis and x-axis, respectively. The least cost path has been plotted. The signatures from which
feature templates have been extracted are also shown [15].
Problem (AP) from graph theory. The Hungarian Method is used to solve this
assignment problem; i.e., find how much the signatures S1 and S2 match [16].
In Hungarian method to solve the assignment problem a m x n cost matrix is found.
The rows correspond to the vertices of X and column corresponds to the vertices of
Y. Every vertex in X and Y has its corresponding coordinates x and y in the signature
image. These coordinates are used to calculate the entry (which is equal to the
Euclidean distance) in cost matrix corresponding to these vertices. After calculating
all entries of cost matrix, the assignment problem is solved. The cost of the resultant
solution equals the sum of all entries that correspond to the minimum cost solution.
6. Conclusion
This report presents the basic idea of a Biometric system and discusses in some detail
the idea of a verification system using handwritten signature as a biometric trait. A
brief description of some of the employed approaches for offline signature verification
problem is given and their major merits and demerits are also listed. It is obvious that
the problem of signature verification becomes more difficult when passing from
random to skilled forgeries, the latter being so difficult a task that even human beings
make errors in several cases. The task is even more difficult for offline signature
verification due to absence of all the dynamic information. Concluding the discussion
it may be said that although much work has been done in the area of online signature
verification but the area of offline signature verification is far from maturity and much
work is needed in the same before it can be employed for some commercial purpose
like a automatic cheque verification system in a bank.
19
7. References
[1] Anil K. Jain, Arun Ross and Salil Prabhakar, An Introduction to Biometric
Recognition, IEEE Transactions on circuits and systems for video technology, vol.
14, no. 1, pp.4-20, January 2004.
[2] P.A. Devijer and J. Kittler, Pattern Recognition: A statistical approach, London:
Prentice-Hall, 1982.
[3] Peter E. Hart, David G. Stork, and Richard O. Duda, Pattern Classification, 2nd
Edition, Wiley, New York, 2000.
[4] Rjean Plamondon and Sargur N.Srihari, On-line and Off-line Handwriting
Recognition: A Comprehensive Survey, IEEE Transactions on pattern analysis and
machine intelligence, vol. 22, no.1, pp.63-84, January 2000.
[5] Zhaoxiang Zhang, Kaiyue Wang, Yunhong Wang, A Survey of On-line Signature
Verification, Biometric Recognition, Lecture Notes in Computer Science, SpringerVerlag Berlin Heidelberg, Volume 7098, pp 141-149, December 2011.
[6] Weiping Hou, Xiufen Ye and Kejun Wang, A Survey of Off-line Signature
Verification, Proceedings of the 2004 International Conference on Intelligent
Mechatronics and Automation, Chengdu, China , pp. 536-541, August 2004.
[7] Oivind Due Trier, Anil K. Jain, Torfinn Taxt, Feature extraction method for
character recognition: A survey, Pattern Recongnition, Elsevier, vol.29, no.4, pp.
641-662, April 1996.
[8] Miguel A. Ferrer, Jesus B. Alonso, and Carlos M. Travieso, Offline Geometric
Parameters for Automatic Signature Verification Using Fixed-Point Arithmetic,
IEEE Transactions on pattern analysis and machine intelligence, vol. 27, no. 6, June
2005.
[9] D.S. Zhang, G.J. Lu, A comparative study on shape retrieval using Fourier
descriptors with different shape signatures, Proceedings of the International
Conference on Multimedia and Distance Education, Fargo, ND, USA, pp. 19, June
2001.
[10] Cho-Huak Teh and Roland T. Chin, On image analysis by the methods of
moments, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.10,
no.4, pp.496-513, July 1988.
[11] Yoshimara, M. Yoshimura and T. Tsukamoto, Investigation of an Automatic
Verification System for Japanese Counter signatures on Travellers Cheques,
Proceedings of the 7th IGS Conference, pp. 86-87, August 1995.
20
21