Professional Documents
Culture Documents
Session 02 - Paper 19
Session 02 - Paper 19
Akriti Nigam
Elsevier Publications, 2013.
Robust OIIline Signature IdentiIication and VeriIication system
using Directional Chain Codes
Akriti Nigam
1,*
, Prateek Singh
2
, R.C. Tripathi
3
1
Research Scholar, Indian Institute Of Information Technology, Allahabad
2
M.Tech, Indian Institute Of Information Technology, Allahabad
3
Professor, Indian Institute Of Information Technology, Allahabad
Abstract
This paper proposes an eIIicient technique to develop an automated oIIline signature identiIication and veriIication system
that could help in crime prevention and biometric authentication systems. The technique proposed makes use oI directional
chain codes to compute a set oI Ieatures that are taken together as a combination. The Ieatures include the geometric details oI
the diIIerent strokes that compose a signature. It includes the length oI strokes, location oI transition points, intersection
points, and directions oI strokes, to name a Iew. The results speak Ior the eIIiciency oI the proposed system that achieves
accuracy level much better than many oI the published works.
2013 Elsevier Science. All rights reserved.
Keywords: Chain Codes; Digital Signatures; Signature Verification; Support Vector Machine; Probabilistic model
1. Introduction
DiIIerentiating between people is oIten done on the basis oI their handwriting and a speciIic reason Ior this
comparison oI handwriting is Ior signature veriIication. Signature is considered to be unique to every individual
and thus is a Iamous biometric, used Ior authentication in many legal issues.
Judicial courts oI many countries like India receive large number oI cases on signature Iorgeries which take lot
oI time to get resolved. This Iact motivated the commencement oI this proposed work. Appearance oI a signature
not only depends on the calligraphic sense but also on the mental state and intentions oI the signer.
Handwriting/signature experts use their knowledge and experience to detect whether a signature is original or
Iorged. Here in this paper an attempt has been made to emulate their knowledge and experience to design an
automated signature recognition and veriIication system.
On the basis oI acquisition, we have online and oIIline signature systems. Online systems require a digitizer
and a stylus to capture the signature. The additional inIormation that we gain through this method is the writing
speed and the pressure applied compared to the oIIline mode.
2. Literature Review
A lot oI research work has been done in this Iield oI signature veriIication covering almost every possible
technique. Some oI the major techniques used in the process oI signature identiIication and veriIication can be
Proceedings oI International ConIerence on Computing Sciences
WILKES100 ICCS 2013
ISBN: 978-93-5107-172-3
Robust ffline ignature dentification and erification system using irectional hain odes
Elsevier Publications, 2013.
number oI times the person has picked up his pen while making the signature. As even Ior genuine signatures the
length oI chain code will diIIer Ior each stroke, we normalize this count value Ior matching purpose.
Algorithm for feature extraction ()
1. Traverse the input image matrix in column major order and start with the Iirst end point pixel detected.
End Point- We call a pixel as the end point iI it has exactly one Ioreground pixel as its neighbour as
shown in the Fig 1 below. II (x,y) is the end point pixel then the neighbourhood Ioreground pixel can be
in exactly one oI the highlighted positions.
2. Move in the direction oI Ioreground pixels that occur in the 8-connected neighbourhood oI the input
pixel I(x,y).
3. Keep storing the direction value at each point traversed according to the 8 standard directions shown in
Fig 2.
Fig 1: End Points
Fig 2: Standard 8 Directions
4. Check Ior radical points.
Radical Points: We deIine three types oI radical points TriIid points (any point having three
neighbours), Intersection points (any point having Iour or more neighbours) and End points as shown in
Fig 3. For each radical points we store Iollowing three parameters: P(x,y,type)
where x and y represents the coordinates oI the radical points, and type represents the type oI radical
points.
II a radical point occurs then check the directions oI last Iew pixels (we chose a threshold oI 10
pixels) and choose the next pixel which is in the same direction. We can have two scenarios as
described below-
a. We do not get any TriIid point till we reached the end point. In this scenario we will keep
traversing the stroke till the end point is reached.
b. We get one or more TriIid point in the path till we reached the end point. In this case aIter
reaching the end point we will backtrack to the last seen TriIid point and continue in the
unmarked pixels direction. We continue this process till we reach an end point.
Robust ffline ignature dentification and erification ystem using irectional hain odes
Elsevier Publications, 2013.
where we have a training database oI N data: xn , n1,.,N}
xj} are the set oI support vectors and the parameters aj and b are determined by solving a quadratic problem.
Signature Verification Algorithm: Here we have to decide whether the query signature image is a genuine
one or Iorged. On the basis oI the experiment we have assigned diIIerent weights to each oI the Ieatures on the
basis oI their signiIicance in veriIication process. So Ior each Ieature Fi we have assigned a weight Wi. Now Ior
signature veriIication process a probabilistic model is used where Ior the query signature image, the probability
oI every Ieature is calculated based upon the histogram obtained in the training phase oI the corresponding
Ieature. We now combine the probability value with the weights assigned to each Ieature to calculate the score oI
the query image using the Iollowing equation
Score (S) Pi * Wi ..... (2)
Decision on whether the query signature is genuine or Iorged is based upon a preset threshold value T. II the
score S is greater than T then we declare the signature to be genuine else we declare it as Iorged.
4. Experimental Results
To test the perIormance oI the proposed system we have used the error rate metric. For each query signature
image we have around 20 genuine signature images to train the system. We have given the query image Irom 5
diIIerent classes and Iirst checked the error rate in the recognition phase i.e. the percentage oI times the system
gives wrong classiIication result.
Next we check Ior each query signature its genuineness. The error rate in veriIication process signiIies the
percentage oI times a genuine signature is declared as Iorged or vice versa. The error obtained Ior each oI the 5
query images is tabulated below in table 1 Ior both recognition and veriIication process.
Table 1: Error Percentage obtained Ior each query image during recognition and veriIication
Error
during
recognition
Error
during
veriIication
Class 1 2.8 3.5
Class 2 3.2 3.9
Class 3 2.1 3.1
Class 4 2.8 4.2
Class 5 2.5 3.2
In table 2, a comparison oI the error obtained using the proposed method with some oI the time honoured
techniques has been made. Noticeable here is the Iact that the proposed method achieves lower percentage oI
error in comparison to other techniques tabulated which proves Ior the genuineness oI the proposed approach.
Table 2: VeriIication PerIormance Comparison
Techniques Error
Proposed approach 3.2
Graphical Model |9| 5.43
Contour based approach |1| 3.34
Global Approach|2| 9.0
ModiIied Direction Feature |6| 17.25
Index
F
Fourier descriptors, 130
H
Hidden Markov Model (HMM), 130
M
Modified direction feature (MDF), 130
P
Probabilistic model, 133
R
Real adaboost algorithm, 130
S
Signature verification, 129
chain codes, 130
database description, 130
end points, 131
error percentage, 133
feature extraction, 130133
preprocessing, 130
standard 8 directions, 131
verification performance comparison, 133
Standard 8 directions, 131
Support vector machine (SVM), 130, 132
SVM. see Support vector machine (SVM)