Online Signature Verification and Authentication Using Smart Phones
Online Signature Verification and Authentication Using Smart Phones
Online Signature Verification and Authentication Using Smart Phones
Volume: 5 Issue: 5 54 58
______________________________________________________________________________________________
Abstract The proposed system is designed to determine whether the person signing on any touch screen device is authenticated user or not.
This can be done by verifying his/her handwritten signature which is a socially accepted biometric trait for authenticating an individual. There
are two types of handwritten signature verification systems: offline and online systems. In an off-line system, just an image of the users
signature is acquired without additional attributes, whereas, in an online system, a sequence of x-y coordinates of the users signature, along
with many other attributes are also acquired. In our paper, we have created a client (mobile) application which captures the users signature and
extracts various features like pressure, time and x-y co-ordinates and the server application verifies these features to find whether the signature
has been done by an authenticated user or a forger. The implementation is done using Python and the GUI is coded using Xcode.
Keywords- Handwritten signature, biometric, verification, authentication, offline, online, forger, Python, GUI, Xcode
__________________________________________________*****_________________________________________________
Phase 3:
This phase involved verification of signature in the login
process. In this, user enters credentials and signature to verify.
Figure 4:- Markov Chain
This signature is then compared with the real and forged
signatures as stored in the database. If the signature is verified
A Markov chain given in above figure 4 consist of two states,
as authentic, the user is logged in.
one is known as hidden states and other is known as
The proposed system is majorly implemented by using 2 observable states. Every observable state is connected to its
respective hidden state which we need to find. Looking at the
algorithms:- Relative Slope Algorithm[3] and Hidden Markov
observable state we predict the hidden state, this is the essence
Model[1][2].
of both Hidden Markov model and Markov chain.
Relative Slope Algorithm(RSA):- Also there are 2 probabilities in HMM as given below:-
This algorithm calculates all the slope values of the stored 1)Transition probability :-
the probability of going from a given state to the next state in a
signature[3]. The steps to be followed are given below:-
Markov process.(probability of hidden state)
Various steps to be followed are given below:
2)Observe probability
1) Using optimize HMM we can calculate the segment of the
signature. Then segment can be combining to form a line It is the probability of any visible state.
segment.
The basic idea of implementation of HMM in our paper is
2) After the line segment are obtained the relative slope are
assigning initial probability to each state. During the process
calculated.
of feature extraction we will extract various features like
3) Slope of line: S=dy/dx Where: dx=x2-x1 dy= y2-y1
4) For the first segment we calculate the slope between the pressure, time, slope and x-y co-ordinates. As the slope aspect
starting point of the first segment and the ending point of the has been covered by above algorithm we are considering
pressure for implementation of markov model. Different
last segment.
readings of pressure form different state of markov model and
5) However, the for the further line segment the slope is
to each state we assign a initial probability and and also
calculated based on the previous line segment.
6) In the first step global time required to put the signature and calculate the transition probability to each state. This can be
calculate. done by following the steps given below:-
56
IJRITCC | May 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 5 54 58
______________________________________________________________________________________________
1) The very first step is to run a loop through the available
dataset and find the max value and min value
2) After calculating min and max value use formula (max -
min)/5 to divide the hole dataset into 5 ranges
3) Then again run a loop determine the number of time a data
set is occurring in that range divided by the total number
of datasets.
4)Transitional probability=(Occurrence in particular range/
Total datasets)
5) Now initial probability is assigned according to the formula
(Occurrence in particular range/ 5)
6) Now this process is repeated for both forged and real
datasets of a particular user and value is stored
7) Now the real time signature of user is present state and all
calculate ranges are act as transitional states(Hidden States) or
all set of possible state in which the system can make
transition to. Figure 6:- Result when a forger signs
8) Using above states we predict whether the signature is of
real user or forged user(Observational state).
57
IJRITCC | May 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 5 54 58
______________________________________________________________________________________________
VII. Conclusion & future work [2] Javier Ortega-Garcia, Daniel Ramos- "HMM-Based On-
In the current times of increasing forgeries, it is important to Line Signature Verification: Feature Extraction &
use a system which will help to efficiently manage user Signature Modeling"
[3] P.N .Ganorkar, Kalyani Pendke - Design Of Digital
authentication in a more systematic and secure manner.
Signature Verification Algorithm Using Relative Slope
Criminal experts can be employed at every place and hence
Method - eISSN: 2319-1163 | pISSN: 2321-7308, August
there is an increase in need to develop computerized 14
algorithms that could verify and authenticate individuals [4] Napa Sae-Bae, Nasir D Menon- Online Signature
identity. Our mobile based authentication system can be Verification on mobile devices - ISSN 2250-2459, June
considered as a complete solution for multi-factor 2014
authentication. This is because we extract features of the users [5] Navid Forhad, Bruce Poon, M. Ashraful Amin, Hong Yan -
in real time and have created a training model with the help of Online Verification for multi-modal Authentication using
3-4 forgers which will cover various forgeries that could be Smart Phone -ISSN: 2078-0958, Volume 1, March 2015
[6] Kiran Kumer Gurrala, Sukadev Meher- Online Signature
done by many professional forgers.
Verification Techniques - ISSN: 2319-7064, November 13
In future, we would like to work on increasing the systems
[7] Aswathy K. V. - Online Signature Verification
accuracy so that it can perform at its best even in 1-sigma Techniques: A Survey, ISSN 2091-2730
range[8]. To increase the accuracy we could implement many [8] Beton, M., Marie, V., Rosenberger, C.: Biometric secret
more algorithm such as optimized HMM, Angle deviation path for mobile user authentication: A preliminary study.
method[7] also we can reduce the size of the database as 25 In: 2013 World Congress Computer Information
copies of signature each for real and forger will occupy lot of Technology, pp. 16 (2013)
database.
VIII. References
[1] Juan J. Igarza, Iaki Goirizelaia - "Online Handwritten
Signature Verification Using Hidden Markov Model"
58
IJRITCC | May 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________