Document Type
Article
Publication Date
6-26-2019
Abstract
Graphs provide a powerful representation formalism that offers great promise to benefit tasks like handwritten signature verification. While most state-of-the-art approaches to signature verification rely on fixed-size representations, graphs are flexible in size and allow modeling local features as well as the global structure of the handwriting. In this article, we present two recent graph-based approaches to offline signature verification: keypoint graphs with approximated graph edit distance and inkball models. We provide a comprehensive description of the methods, propose improvements both in terms of computational time and accuracy, and report experimental results for four benchmark datasets. The proposed methods achieve top results for several benchmarks, highlighting the potential of graph-based signature verification.
Keywords
offline signature verification, structural pattern recognition, graph edit distance, Hausdorff edit distance, inkball models
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Rights
Licensed to Smith College and distributed CC-BY under the Smith College Faculty Open Access Policy.
Recommended Citation
Maergner, Paul; Howe, Nicholas; Riesen, Kaspar; and Fischer, Andreas, "Graph-Based Offline Signature Verification" (2019). Computer Science: Faculty Publications, Smith College, Northampton, MA.
https://scholarworks.smith.edu/csc_facpubs/221
Comments
Author’s submitted manuscript.