SVC-onGoing: Signature Verification Competition
- URL: http://arxiv.org/abs/2108.06090v1
- Date: Fri, 13 Aug 2021 06:51:32 GMT
- Title: SVC-onGoing: Signature Verification Competition
- Authors: Ruben Tolosana, Ruben Vera-Rodriguez, Carlos Gonzalez-Garcia, Julian
Fierrez, Aythami Morales, Javier Ortega-Garcia, Juan Carlos Ruiz-Garcia,
Sergio Romero-Tapiador, Santiago Rengifo, Miguel Caruana, Jiajia Jiang,
Songxuan Lai, Lianwen Jin, Yecheng Zhu, Javier Galbally, Moises Diaz, Miguel
Angel Ferrer, Marta Gomez-Barrero, Ilya Hodashinsky, Konstantin Sarin, Artem
Slezkin, Marina Bardamova, Mikhail Svetlakov, Mohammad Saleem, Cintia Lia
Szucs, Bence Kovari, Falk Pulsmeyer, Mohamad Wehbi, Dario Zanca, Sumaiya
Ahmad, Sarthak Mishra, Suraiya Jabin
- Abstract summary: SVC-onGoing is based on the ICDAR 2021 Competition on On-Line Signature Verification (SVC 2021)
The goal of SVC-onGoing is to evaluate the limits of on-line signature verification systems on popular scenarios (office/mobile) and writing inputs (stylus/finger) through large-scale public databases.
The results obtained in SVC-onGoing prove the high potential of deep learning methods in comparison with traditional methods.
- Score: 29.588285669937388
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: This article presents SVC-onGoing, an on-going competition for on-line
signature verification where researchers can easily benchmark their systems
against the state of the art in an open common platform using large-scale
public databases, such as DeepSignDB and SVC2021_EvalDB, and standard
experimental protocols. SVC-onGoing is based on the ICDAR 2021 Competition on
On-Line Signature Verification (SVC 2021), which has been extended to allow
participants anytime. The goal of SVC-onGoing is to evaluate the limits of
on-line signature verification systems on popular scenarios (office/mobile) and
writing inputs (stylus/finger) through large-scale public databases. Three
different tasks are considered in the competition, simulating realistic
scenarios as both random and skilled forgeries are simultaneously considered on
each task. The results obtained in SVC-onGoing prove the high potential of deep
learning methods in comparison with traditional methods. In particular, the
best signature verification system has obtained Equal Error Rate (EER) values
of 3.33% (Task 1), 7.41% (Task 2), and 6.04% (Task 3). Future studies in the
field should be oriented to improve the performance of signature verification
systems on the challenging mobile scenarios of SVC-onGoing in which several
mobile devices and the finger are used during the signature acquisition.
Related papers
- Propose, Solve, Verify: Self-Play Through Formal Verification [75.44204610186587]
We study self-play in the verified code generation setting, where formal verification provides reliable correctness signals.<n>We introduce Propose, Solve, Verify (PSV) a simple self-play framework where formal verification signals are used to create a proposer capable of generating challenging synthetic problems and a solver trained via expert iteration.<n>We show that performance scales with the number of generated questions and training iterations, and through ablations identify formal verification and difficulty-aware proposal as essential ingredients for successful self-play.
arXiv Detail & Related papers (2025-12-20T00:56:35Z) - FORGE: Forming Semantic Identifiers for Generative Retrieval in Industrial Datasets [64.51403245281547]
FORGE is a benchmark for FOrming semantic identifieR in Generative rEtrieval with industrial datasets.<n>For real-world applications, FORGE introduces an offline pretraining schema that reduces online convergence by half.
arXiv Detail & Related papers (2025-09-25T08:44:22Z) - Offline Handwritten Signature Verification Using a Stream-Based Approach [7.18805896964466]
Signature verification systems distinguish between genuine and forged signatures.
Traditional HSV development involves a static batch configuration.
We propose a novel HSV approach with an adaptive system that receives an infinite sequence of signatures and is updated over time.
arXiv Detail & Related papers (2024-11-10T16:16:06Z) - IEEE BigData 2023 Keystroke Verification Challenge (KVC) [14.366081634293721]
This paper considers the biometric verification performance of Keystroke Dynamics captured as tweet-long sequences of variable transcript text from over 185,000 subjects.
The data are obtained from two of the largest public databases of KD up to date.
Several neural architectures were proposed by the participants, leading to global Equal Error Rates (EERs) as low as 3.33% and 3.61% achieved by the best team respectively.
arXiv Detail & Related papers (2024-01-29T20:51:42Z) - SemiReward: A General Reward Model for Semi-supervised Learning [58.47299780978101]
Semi-supervised learning (SSL) has witnessed great progress with various improvements in the self-training framework with pseudo labeling.
Main challenge is how to distinguish high-quality pseudo labels against the confirmation bias.
We propose a Semi-supervised Reward framework (SemiReward) that predicts reward scores to evaluate and filter out high-quality pseudo labels.
arXiv Detail & Related papers (2023-10-04T17:56:41Z) - Fast on-line signature recognition based on VQ with time modeling [0.0]
This paper proposes a multi-section vector quantization approach for on-line signature recognition.
We have used the MCYT database, which consists of 330 users and 25 skilled forgeries per person performed by 5 different impostors.
arXiv Detail & Related papers (2022-03-23T00:04:27Z) - Complete Agent-driven Model-based System Testing for Autonomous Systems [0.0]
A novel approach to testing complex autonomous transportation systems is described.
It is intended to mitigate some of the most critical problems regarding verification and validation.
arXiv Detail & Related papers (2021-10-25T01:55:24Z) - S3PRL-VC: Open-source Voice Conversion Framework with Self-supervised
Speech Representations [124.2620985250939]
This paper introduces S3PRL-VC, an open-source voice conversion framework based on the S3PRL toolkit.
In this work, we provide a series of in-depth analyses by benchmarking on the two tasks in VCC 2020.
We show that S3R is comparable with VCC 2020 top systems in the A2O setting in terms of similarity, and state-of-the-art in S3R-based A2A VC.
arXiv Detail & Related papers (2021-10-12T19:01:52Z) - VisDA-2021 Competition Universal Domain Adaptation to Improve
Performance on Out-of-Distribution Data [64.91713686654805]
The Visual Domain Adaptation (VisDA) 2021 competition tests models' ability to adapt to novel test distributions.
We will evaluate adaptation to novel viewpoints, backgrounds, modalities and degradation in quality.
Performance will be measured using a rigorous protocol, comparing to state-of-the-art domain adaptation methods.
arXiv Detail & Related papers (2021-07-23T03:21:51Z) - Analysing Affective Behavior in the second ABAW2 Competition [70.86998050535944]
The Affective Behavior Analysis in-the-wild (ABAW2) 2021 Competition is the second -- following the first very successful ABAW Competition held in conjunction with IEEE FG 2020- Competition that aims at automatically analyzing affect.
arXiv Detail & Related papers (2021-06-14T11:30:19Z) - ICDAR 2021 Competition on On-Line Signature Verification [29.8436776061712]
The goal of SVC 2021 is to evaluate the limits of on-line signature verification systems on popular scenarios.
The results obtained in SVC 2021 prove the high potential of deep learning methods.
arXiv Detail & Related papers (2021-06-01T19:33:46Z) - Few-Shot Named Entity Recognition: A Comprehensive Study [92.40991050806544]
We investigate three schemes to improve the model generalization ability for few-shot settings.
We perform empirical comparisons on 10 public NER datasets with various proportions of labeled data.
We create new state-of-the-art results on both few-shot and training-free settings.
arXiv Detail & Related papers (2020-12-29T23:43:16Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.