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% FRR for a FAR = 5.0% have been achieved against skilled forgeries outperforming recent related works. In addition, 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.