2018 16th International Conference on Frontiers in Handwriting Recognition (ICFHR) 2018
DOI: 10.1109/icfhr-2018.2018.00037
|View full text |Cite
|
Sign up to set email alerts
|

Offline Signature Verification Via Structural Methods: Graph Edit Distance and Inkball Models

Abstract: For handwritten signature verification, signature images are typically represented with fixed-sized feature vectors capturing local and global properties of the handwriting. Graphbased representations offer a promising alternative, as they are flexible in size and model the global structure of the handwriting. However, they are only rarely used for signature verification, which may be due to the high computational complexity involved when matching two graphs. In this paper, we take a closer look at two recentl… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
2
2

Relationship

2
8

Authors

Journals

citations
Cited by 17 publications
(7 citation statements)
references
References 26 publications
(31 reference statements)
0
7
0
Order By: Relevance
“…To overcome the complexity of SVM, an addition of decision tree function produced better results previously, the hybrid SVM model was proposed embed C4.5 algorithm of a decision tree into the SVM and resulting in a more accurate and efficient hybrid classifier. Then we introduced the modified DT-SVM (Maergner et al, 2019;Blankers et al, 2009) algorithm addition of a new method, Probability-based Distance as Spitting Criterion, in which we use the distances in the frequency distribution of the instances. Thus, the modified DT-SVM provides better performance over the previous decision tree, and SVM (Ferrer et al, 2005) in comparison with the Computational Complexity and overall Accuracy.…”
Section: Proposed Workmentioning
confidence: 99%
“…To overcome the complexity of SVM, an addition of decision tree function produced better results previously, the hybrid SVM model was proposed embed C4.5 algorithm of a decision tree into the SVM and resulting in a more accurate and efficient hybrid classifier. Then we introduced the modified DT-SVM (Maergner et al, 2019;Blankers et al, 2009) algorithm addition of a new method, Probability-based Distance as Spitting Criterion, in which we use the distances in the frequency distribution of the instances. Thus, the modified DT-SVM provides better performance over the previous decision tree, and SVM (Ferrer et al, 2005) in comparison with the Computational Complexity and overall Accuracy.…”
Section: Proposed Workmentioning
confidence: 99%
“…Graph matching is a common technique in pattern recognition [8], [9], which has been applied in document analysis to keyword spotting [4] and signature verification [10]. The main idea is to define a graph, which traces the lines of a word or a signature with its edges, as shown in Fig.…”
Section: B Graph Matchingmentioning
confidence: 99%
“…Then, they used the SVM classification by using the selected features. Maergner et al (10,11) described the graph-based signature verification system. This system was a combined model consisting of key points graphs with approximate graph edit distance and inkball models.…”
Section: Introductionmentioning
confidence: 99%