Local features for forensic signature verification

4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper we present a novel comparison among three local features based offline systems for forensic signature verification. Forensic signature verification involves various signing behaviors, e.g., disguised signatures, which are generally not considered by Pattern Recognition (PR) researchers. The first system is based on nine local features with Gaussian Mixture Models (GMMs) classification. The second system utilizes a combination of scale-invariant Speeded Up Robust Features (SURF) and Fast Retina Keypoints (FREAK). The third system is based on a combination of Features from Accelerated Segment Test (FAST) and FREAK. All of these systems are evaluated on the dataset of the 4NSigComp2010 signature verification competition which is the first publicly available dataset containing disguised signatures. Results indicate that our local features based systems outperform all the participants of the said competition both in terms of time and equal error rate. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Malik, M. I., Liwicki, M., & Dengel, A. (2013). Local features for forensic signature verification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8158 LNCS, pp. 103–111). https://doi.org/10.1007/978-3-642-41190-8_12

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