An efficient online signature verification scheme using dynamic programming of string matching

7Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The necessity to authenticate individuals is rapidly increasing day by day with the explosive growth of E-commerce, E-finance, PDA, etc. Handwritten signature is the most widely used and easiest way to verify a person. Online signature verification is a very active and hot topic in the field of biometric research. It is a potential candidate to replace traditional password-based security system as the password can be forgotten, stolen or guessed. Online signature verification deals with both spatial and temporal features of signature. Therefore, it is difficult to forge. This paper proposes a novel online signature verification technique using dynamic programming of string matching. The performance of the proposed approach is evaluated for both genuine signatures and skilled forgeries on SVC2004 database. The proposed approach produces a False Acceptance Rate (FAR) of 4.13% and False Rejection Rate (FRR) of 5.5% with an Equal Error Rate (ERR) of 5%. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Reza, A. G., Lim, H., & Alam, M. J. (2011). An efficient online signature verification scheme using dynamic programming of string matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6935 LNCS, pp. 590–597). https://doi.org/10.1007/978-3-642-24082-9_72

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free