Abstract
Existing methods to deal with off-line signature verification usually adopt the feature representation based approaches which suffer from limited training samples. It is desired to employ straightforward means to measure similarity between 2-D static signature graphs. In this paper, we incorporate merits of both global and local alignment methods. Two signature patterns are globally registered using weak affine transformation and correspondences of feature points between two signature patterns are determined by applying an elastic local alignment algorithm. Similarity is measured as the mean square of sum Euclidean distances of all found corresponding feature points based on a match list. Experimental results showed that the computed similarity measurement was able to provide sufficient discriminatory information. Verification performance in terms of equal error rate was 18.6% with four training samples.
| Original language | English |
|---|---|
| Pages (from-to) | 272-281 |
| Number of pages | 10 |
| Journal | Lecture Notes in Computer Science |
| Volume | 3644 |
| Issue number | PART I |
| DOIs | |
| State | Published - 2005 |
| Externally published | Yes |
| Event | 1st International Conference on Intelligent Computing, ICIC 2005 - Hefei, China Duration: 23 Aug 2005 → 26 Aug 2005 |
Fingerprint
Dive into the research topics of 'Similarity measurement for off-line signature verification'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver