ProtoSig: Enhancing training data for offline handwritten signature verification using prototypical signatures
Bibliographic record
Abstract
Offline Handwritten Signature Verification (offline HSV) analyzes static images of signatures to distinguish between genuine and forged samples. To create training data for such systems, negative samples, commonly known as random forgeries, are typically drawn from genuine signatures of other users, as real-world datasets often lack actual forgeries. While this strategy helps address the scarcity of forgery data, it faces several challenges. The randomly selected samples may lack the diversity and challenge needed to improve model robustness. Additionally, they can cause redundancy, increasing training time and storage requirements, and may introduce bias across users, leading to unfair training distributions. This paper proposes a novel strategy, called \textit{ProtoSig}, for generating more informative and diverse negative samples by leveraging prototypical signatures, which are compact, non-identifiable vectors obtained through a data-driven summarization of signature feature vectors. Our experiments demonstrate that ProtoSig enhances skilled forgery detection in a writer-dependent verification approach, eliminating performance variability across runs, while reducing dependence on external user data. We further demonstrate that our method achieves similar or better accuracy using a smaller dataset, offering considerable gains in scalability, computational efficiency, and storage requirements, while strengthening data privacy and promoting fairness in offline HSV systems.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.003 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".