Complexity-based biometric signature verification
Complexity-based biometric signature verification
On-line signature verification systems are mainly based on two approaches: feature- or time functions-based systems (a.k.a. global and local systems). However, new sources of information can be also considered in order to complement these traditional approaches, reduce the intra-class variability and achieve more robust signature verification systems against forgers. In this paper we focus on the use of the concept of complexity in on-line signature verification systems. The main contributions of the present work are: 1) classification of users according to the complexity level of their signatures using features extracted from the Sigma LogNormal writing generation model, and 2) a new architecture for signature verification exploiting signature complexity that results in highly improved performance. Our proposed approach is tested considering the BiosecurID on-line signature database with a total of 400 users. Results of 5.8.0 an analysis of the optimal time functions for each complexity level is performed providing practical insights for the application of signature verification in real scenarios.
Tolosana, Ruben
93125127-5ac2-4e76-94aa-4d09f28a3e51
Vera-Rodriguez, Ruben
d9c7e17e-332c-47ac-a9a9-30cc75d26a3e
Guest, Richard
93533dbd-b101-491b-83cc-39ccfdc18165
Fierrez, Julian
c93da818-9beb-4e74-981b-e7a8d394e719
Ortega-Garcia, Javier
4b1da9fb-4b6c-4876-b15e-6c5d886f5aeb
Tolosana, Ruben
93125127-5ac2-4e76-94aa-4d09f28a3e51
Vera-Rodriguez, Ruben
d9c7e17e-332c-47ac-a9a9-30cc75d26a3e
Guest, Richard
93533dbd-b101-491b-83cc-39ccfdc18165
Fierrez, Julian
c93da818-9beb-4e74-981b-e7a8d394e719
Ortega-Garcia, Javier
4b1da9fb-4b6c-4876-b15e-6c5d886f5aeb
Tolosana, Ruben, Vera-Rodriguez, Ruben and Guest, Richard
,
et al.
(2018)
Complexity-based biometric signature verification.
In 2017 14th IAPR International Conference on Document Analysis and Recognition (ICDAR).
IEEE..
(doi:10.1109/ICDAR.2017.40).
Record type:
Conference or Workshop Item
(Paper)
Abstract
On-line signature verification systems are mainly based on two approaches: feature- or time functions-based systems (a.k.a. global and local systems). However, new sources of information can be also considered in order to complement these traditional approaches, reduce the intra-class variability and achieve more robust signature verification systems against forgers. In this paper we focus on the use of the concept of complexity in on-line signature verification systems. The main contributions of the present work are: 1) classification of users according to the complexity level of their signatures using features extracted from the Sigma LogNormal writing generation model, and 2) a new architecture for signature verification exploiting signature complexity that results in highly improved performance. Our proposed approach is tested considering the BiosecurID on-line signature database with a total of 400 users. Results of 5.8.0 an analysis of the optimal time functions for each complexity level is performed providing practical insights for the application of signature verification in real scenarios.
This record has no associated files available for download.
More information
e-pub ahead of print date: 29 January 2018
Venue - Dates:
14th IAPR International Conference on Document Analysis and Recognition, , Kyoto, Japan, 2017-11-13 - 2017-11-15
Identifiers
Local EPrints ID: 489717
URI: http://eprints.soton.ac.uk/id/eprint/489717
PURE UUID: bc6b0fef-f8a9-4153-840d-477ce737c156
Catalogue record
Date deposited: 30 Apr 2024 17:03
Last modified: 01 May 2024 02:10
Export record
Altmetrics
Contributors
Author:
Ruben Tolosana
Author:
Ruben Vera-Rodriguez
Author:
Richard Guest
Author:
Julian Fierrez
Author:
Javier Ortega-Garcia
Corporate Author: et al.
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics