Intrapersonal Parameter Optimization for Offline Handwritten Signature Augmentation

• URL: http://arxiv.org/abs/2010.06663v1
• Date: Tue, 13 Oct 2020 19:54:02 GMT
• Title: Intrapersonal Parameter Optimization for Offline Handwritten Signature Augmentation
• Authors: Teruo M. Maruyama, Luiz S. Oliveira, Alceu S. Britto Jr, Robert Sabourin
• Abstract summary: We propose a method to automatically model the most common writer variability traits. The method is used to generate offline signatures in the image and the feature space and train an ASVS. We evaluate the performance of an ASVS with the generated samples using three well-known offline signature datasets.
• Score: 17.11525750244627
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Usually, in a real-world scenario, few signature samples are available to train an automatic signature verification system (ASVS). However, such systems do indeed need a lot of signatures to achieve an acceptable performance. Neuromotor signature duplication methods and feature space augmentation methods may be used to meet the need for an increase in the number of samples. Such techniques manually or empirically define a set of parameters to introduce a degree of writer variability. Therefore, in the present study, a method to automatically model the most common writer variability traits is proposed. The method is used to generate offline signatures in the image and the feature space and train an ASVS. We also introduce an alternative approach to evaluate the quality of samples considering their feature vectors. We evaluated the performance of an ASVS with the generated samples using three well-known offline signature datasets: GPDS, MCYT-75, and CEDAR. In GPDS-300, when the SVM classifier was trained using one genuine signature per writer and the duplicates generated in the image space, the Equal Error Rate (EER) decreased from 5.71% to 1.08%. Under the same conditions, the EER decreased to 1.04% using the feature space augmentation technique. We also verified that the model that generates duplicates in the image space reproduces the most common writer variability traits in the three different datasets.

Related papers

• Offline Signature Verification Based on Feature Disentangling Aided Variational Autoencoder [6.128256936054622]
  Main tasks of signature verification systems include extracting features from signature images and training a classifier for classification. The instances of skilled forgeries are often unavailable, when signature verification models are being trained. This paper proposes a new signature verification method using a variational autoencoder (VAE) to extract features directly from signature images.
  arXiv  Detail & Related papers  (2024-09-29T19:54:47Z)
• Investigating the Common Authorship of Signatures by Off-Line Automatic Signature Verification Without the Use of Reference Signatures [3.3498759480099856]
  This paper addresses the problem of automatic signature verification when no reference signatures are available. The scenario we explore consists of a set of signatures, which could be signed by the same author or by multiple signers. We discuss three methods which estimate automatically the common authorship of a set of off-line signatures.
  arXiv  Detail & Related papers  (2024-05-23T10:30:48Z)
• Decoupled Prototype Learning for Reliable Test-Time Adaptation [50.779896759106784]
  Test-time adaptation (TTA) is a task that continually adapts a pre-trained source model to the target domain during inference. One popular approach involves fine-tuning model with cross-entropy loss according to estimated pseudo-labels. This study reveals that minimizing the classification error of each sample causes the cross-entropy loss's vulnerability to label noise. We propose a novel Decoupled Prototype Learning (DPL) method that features prototype-centric loss computation.
  arXiv  Detail & Related papers  (2024-01-15T03:33:39Z)
• Consensus-Threshold Criterion for Offline Signature Verification using Convolutional Neural Network Learned Representations [0.0]
  A consensus-threshold distance-based classifier is proposed for offline writer-dependent signature verification. On GPDS-300, the consensus threshold classifier improves the state-of-the-art performance by achieving a 1.27% FAR compared to 8.73% and 17.31% recorded in literature. This is consistent across other datasets and guarantees that the risk of imposters gaining access to sensitive documents or transactions is minimal.
  arXiv  Detail & Related papers  (2024-01-05T23:10:26Z)
• Offline Handwriting Signature Verification: A Transfer Learning and Feature Selection Approach [4.395397502990339]
  The aim is to ascertain the authenticity of a provided handwritten signature, distinguishing between genuine and forged ones. This issue has many applications in sectors such as finance, legal documentation, and security. We collected a large dataset of 12600 images from 420 distinct individuals, and each individual has 30 signatures of a certain kind. In the subsequent stage, the best features from each image were extracted using a deep learning model named MobileNetV2.
  arXiv  Detail & Related papers  (2024-01-05T10:55:20Z)
• Diversified in-domain synthesis with efficient fine-tuning for few-shot classification [64.86872227580866]
  Few-shot image classification aims to learn an image classifier using only a small set of labeled examples per class. We propose DISEF, a novel approach which addresses the generalization challenge in few-shot learning using synthetic data. We validate our method in ten different benchmarks, consistently outperforming baselines and establishing a new state-of-the-art for few-shot classification.
  arXiv  Detail & Related papers  (2023-12-05T17:18:09Z)
• Collaborative Propagation on Multiple Instance Graphs for 3D Instance Segmentation with Single-point Supervision [63.429704654271475]
  We propose a novel weakly supervised method RWSeg that only requires labeling one object with one point. With these sparse weak labels, we introduce a unified framework with two branches to propagate semantic and instance information. Specifically, we propose a Cross-graph Competing Random Walks (CRW) algorithm that encourages competition among different instance graphs.
  arXiv  Detail & Related papers  (2022-08-10T02:14:39Z)
• SURDS: Self-Supervised Attention-guided Reconstruction and Dual Triplet Loss for Writer Independent Offline Signature Verification [16.499360910037904]
  Offline Signature Verification (OSV) is a fundamental biometric task across various forensic, commercial and legal applications. We propose a two-stage deep learning framework that leverages self-supervised representation learning as well as metric learning for writer-independent OSV. The proposed framework has been evaluated on two publicly available offline signature datasets and compared with various state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-01-25T07:26:55Z)
• Semi-Supervised Domain Adaptation with Prototypical Alignment and Consistency Learning [86.6929930921905]
  This paper studies how much it can help address domain shifts if we further have a few target samples labeled. To explore the full potential of landmarks, we incorporate a prototypical alignment (PA) module which calculates a target prototype for each class from the landmarks. Specifically, we severely perturb the labeled images, making PA non-trivial to achieve and thus promoting model generalizability.
  arXiv  Detail & Related papers  (2021-04-19T08:46:08Z)
• Text Recognition in Real Scenarios with a Few Labeled Samples [55.07859517380136]
  Scene text recognition (STR) is still a hot research topic in computer vision field. This paper proposes a few-shot adversarial sequence domain adaptation (FASDA) approach to build sequence adaptation. Our approach can maximize the character-level confusion between the source domain and the target domain.
  arXiv  Detail & Related papers  (2020-06-22T13:03:01Z)
• Diverse Image Generation via Self-Conditioned GANs [56.91974064348137]
  We train a class-conditional GAN model without using manually annotated class labels. Instead, our model is conditional on labels automatically derived from clustering in the discriminator's feature space. Our clustering step automatically discovers diverse modes, and explicitly requires the generator to cover them.
  arXiv  Detail & Related papers  (2020-06-18T17:56:03Z)

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.