scispace - formally typeset
Open AccessProceedings Article

A global feature for on-line signature verification

TLDR
A new global feature for on-line signature verification, named chain code distance (CCD) represents signature shape using the vector quantization, which is expected to increase the performance of the verification system when it is used with other methods in future works.
Abstract
As reported in many researches, the performance of signature verification is quite high in these days. However, as error rate reduces making performance higher cost more efforts and is getting difficult. This paper proposes a new global feature for on-line signature verification, which can be used in addition to the other system. The proposed feature, named chain code distance (CCD) represents signature shape using the vector quantization. A signature is divided into several segmentation and feature points are selected through the process. Then proposed feature is calculated by extracting information from each segment. Experimental results show that the proposed feature can be used as a global feature. The number of included genuine signatures increases rapidly as the threshold increases, but the number of forged signature increases linearly. The experimental result was remarkable for English signature and the result for Japanese signature was acceptable also. Proposed global feature is expected to increase the performance of the verification system when it is used with other methods in future works.

read more

Citations
More filters
Journal Article

A general approach to off-line signature verification

TL;DR: A generic representation of signature verifiers is proposed, which was created based on the generic model, including the unified benchmarking, comparability of different systems and the support for distributed software architectures like SOA.
References
More filters
Journal ArticleDOI

On-line signature verification

TL;DR: Experiments on a database containing a total of 1232 signatures of 102 individuals show that writer-dependent thresholds yield better results than using a common threshold.
Journal ArticleDOI

A linear algorithm for segmentation of digital curves

TL;DR: A new very efficient linear algorithm for the segmentation of 8-connected digital curves is given using a definition of digital lines using a linear double diophantine inequality.
Proceedings ArticleDOI

On line signature verification: Fusion of a Hidden Markov Model and a neural network via a support vector machine

TL;DR: On-line signature verification is proposed by the fusion of two complementary verification modules that considers a signature as a sequence of points and models the genuine signatures of a given signer by a Hidden Markov Model.
Journal ArticleDOI

On-line signature verification based on subband decomposition by DWT and adaptive signal processing

TL;DR: Time-varying pen-position signals of the on-line signature are decomposed into subband signals by using the DWT and adaptive signal processing and verification was 95% even if the writer was not permitted to refer to his/her own signature or if a forger traced the genuine signature.
Related Papers (5)