ICDAR 2021 Competition on On-Line Signature Verification

• URL: http://arxiv.org/abs/2106.00739v1
• Date: Tue, 1 Jun 2021 19:33:46 GMT
• Title: ICDAR 2021 Competition on On-Line Signature Verification
• Authors: Ruben Tolosana, Ruben Vera-Rodriguez, Carlos Gonzalez-Garcia, Julian Fierrez, Santiago Rengifo, Aythami Morales, Javier Ortega-Garcia, Juan Carlos Ruiz-Garcia, Sergio Romero-Tapiador, 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 Sz\"ucs, Bence Kovari, Falk Pulsmeyer, Mohamad Wehbi, Dario Zanca, Sumaiya Ahmad, Sarthak Mishra and Suraiya Jabin
• Abstract summary: 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.
• Score: 29.8436776061712
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: This paper describes the experimental framework and results of the ICDAR 2021 Competition on On-Line Signature Verification (SVC 2021). The goal of SVC 2021 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 2021 prove the high potential of deep learning methods. In particular, the best on-line signature verification system of SVC 2021 obtained Equal Error Rate (EER) values of 3.33% (Task 1), 7.41% (Task 2), and 6.04% (Task 3). SVC 2021 will be established as an on-going competition, 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.

Related papers

• Human Identification at a Distance: Challenges, Methods and Results on the Competition HID 2025 [70.29305328364755]
  The International Competition on Human Identification at a Distance (HID) has been organized annually since 2020.<n>The best-performing method reached 94.2% accuracy, setting a new benchmark on this dataset.<n>We analyze key technical trends and outline potential directions for future research in gait recognition.
  arXiv  Detail & Related papers  (2026-02-07T14:22:17Z)
• NAIPv2: Debiased Pairwise Learning for Efficient Paper Quality Estimation [58.30936615525824]
  We present NAIPv2, a debiased and efficient framework for paper quality estimation.<n> NAIPv2 employs pairwise learning within domain-year groups to reduce inconsistencies in reviewer ratings.<n>It is trained on pairwise comparisons but enabling efficient pointwise prediction at deployment.
  arXiv  Detail & Related papers  (2025-09-29T17:59:23Z)
• A Transparent Fairness Evaluation Protocol for Open-Source Language Model Benchmarking on the Blockchain [0.18570740863168358]
  Large language models (LLMs) are increasingly deployed in realworld applications, yet concerns about their fairness persist.<n>This paper introduces transparent evaluation protocol for benchmarking the fairness of opensource LLMs using smart contracts on the Internet Computer Protocol (ICP) blockchain.
  arXiv  Detail & Related papers  (2025-07-29T22:49:00Z)
• The NTNU System at the S&I Challenge 2025 SLA Open Track [4.3128061558581585]
  We propose a system that integrates W2V with Phi-4 multimodal large language model (MLLM) through a score fusion strategy.<n>The proposed system achieves a root mean square error (RMSE) of 0.375 on the official test set of the Speak & Improve Challenge 2025.<n>For comparison, the RMSEs of the top-ranked, third-ranked, and official baseline systems are 0.364, 0.384, and 0.444, respectively.
  arXiv  Detail & Related papers  (2025-06-05T15:09:23Z)
• Type2Branch: Keystroke Biometrics based on a Dual-branch Architecture with Attention Mechanisms and Set2set Loss [5.23087771966975]
  This article describes Type2Branch, the model and techniques that achieved the lowest error rates at the KVC-onGoing competition. Considering five enrollment samples per subject of approximately 50 characters typed, the proposed Type2Branch achieves state-of-the-art performance.
  arXiv  Detail & Related papers  (2024-05-02T08:33:43Z)
• 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)
• EFaR 2023: Efficient Face Recognition Competition [51.77649060180531]
  The paper presents the summary of the Efficient Face Recognition Competition (EFaR) held at the 2023 International Joint Conference on Biometrics (IJCB 2023) The competition received 17 submissions from 6 different teams. The submitted solutions are ranked based on a weighted score of the achieved verification accuracies on a diverse set of benchmarks, as well as the deployability given by the number of floating-point operations and model size.
  arXiv  Detail & Related papers  (2023-08-08T09:58:22Z)
• FedABC: Targeting Fair Competition in Personalized Federated Learning [76.9646903596757]
  Federated learning aims to collaboratively train models without accessing their client's local private data. We propose a novel and generic PFL framework termed Federated Averaging via Binary Classification, dubbed FedABC. In particular, we adopt the one-vs-all'' training strategy in each client to alleviate the unfair competition between classes.
  arXiv  Detail & Related papers  (2023-02-15T03:42:59Z)
• Federated Transfer-Ordered-Personalized Learning for Driver Monitoring Application [15.731990691086123]
  Federated learning (FL) has been successfully applied to various domains, including driver monitoring applications (DMAs) on the internet of vehicles (IoV) This paper proposes a federated transfer-ordered-personalized learning (FedTOP) framework to address the above problems and test on two real-world datasets. The results demonstrate that the proposed FedTOP can be used as a highly accurate, streamlined, privacy-preserving, cybersecurity-oriented, and personalized framework for DMA.
  arXiv  Detail & Related papers  (2023-01-12T06:12:04Z)
• 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)
• SVC-onGoing: Signature Verification Competition [29.588285669937388]
  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.
  arXiv  Detail & Related papers  (2021-08-13T06:51:32Z)
• 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)
• Exploration of End-to-End ASR for OpenSTT -- Russian Open Speech-to-Text Dataset [73.66530509749305]
  This paper presents an exploration of end-to-end automatic speech recognition systems (ASR) for the largest open-source Russian language data set -- OpenSTT. We evaluate different existing end-to-end approaches such as joint CTC/Attention, RNN-Transducer, and Transformer. For the three available validation sets (phone calls, YouTube, and books), our best end-to-end model achieves word error rate (WER) of 34.8%, 19.1%, and 18.1%, respectively.
  arXiv  Detail & Related papers  (2020-06-15T10:35:31Z)

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.