Applying Dissimilarity Representation to Off-Line Signature Verification
- 1 August 2010
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2010 20th International Conference on Pattern Recognition
- p. 1293-1297
- https://doi.org/10.1109/icpr.2010.322
Abstract
In this paper, a two-stage off-line signature verification system based on dissimilarity representation is proposed. In the first stage, a set of discrete left-to-right HMMs trained with different number of states and codebook sizes is used to measure similarity values that populate new feature vectors. Then, these vectors are input to the second stage, which provides the final classification. Experiments were performed using two different classification techniques - AdaBoost, and Random Subspaces with SVMs - and a real-world signature verification database. Results indicate that the performance is significantly better with the proposed system over other reference signature verification systems from literature.Keywords
This publication has 7 references indexed in Scilit:
- Reducing forgeries in writer-independent off-line signature verification through ensemble of classifiersPattern Recognition, 2010
- Similarity-based classification of sequences using hidden Markov modelsPattern Recognition, 2004
- Learning user-specific parameters in a multibiometric systemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Off-line signature verification using HMM for random, simple and skilled forgeriesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Random ForestsMachine Learning, 2001
- Additive logistic regression: a statistical view of boosting (With discussion and a rejoinder by the authors)The Annals of Statistics, 2000
- A tutorial on hidden Markov models and selected applications in speech recognitionProceedings of the IEEE, 1989