Unsupervised Domain Adaptation for Symbol Spotting in Historical Encrypted Manuscripts

• URL: http://arxiv.org/abs/2609.07159v1
• Date: Mon, 07 Sep 2026 07:54:42 GMT
• Title: Unsupervised Domain Adaptation for Symbol Spotting in Historical Encrypted Manuscripts
• Abstract summary: We propose a three-stage pipeline that bridges the gap between clean, digitally rendered font queries and degraded handwritten manuscript symbols.<n> Experiments show that our method outperforms zero-shot foundation models, including CLIP and DINOv2, by a large margin.<n>This capability is of direct practical relevance to palaeographers, historians, and other researchers working with undeciphered manuscripts.
• Score: 4.547164943557434
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The decipherment of historical encrypted manuscripts poses a fundamental challenge in Digital Humanities: before any transcription can begin, the symbol inventory of the underlying cipher alphabet must first be identified and characterized. We address this challenge through symbol spotting: given a candidate alphabet specified as a set of rendered font glyphs, the task is to determine whether and where its characters appear in an unseen handwritten document, without any labeled examples from the target script. The main difficulty lies in the domain gap between clean, digitally rendered font queries and degraded handwritten manuscript symbols. We propose a three-stage pipeline that bridges this gap without manual annotation, combining a joint SimCLR+DANN encoder for domain-invariant glyph representations with an embedding-space style-adaptation mechanism applied at retrieval time, requiring no re-training. Experiments on fourteen pages from seven encrypted manuscript collections show that our method outperforms zero-shot foundation models, including CLIP and DINOv2, by a large margin ($+0.194$ P@1 over CLIP ViT-L/14), and surpasses task-specific trained baselines by $+0.138$ P@1. We further demonstrate that the Raw-Cover metric, computed in a fully unsupervised setting, provides a meaningful script-family fingerprint that identifies the underlying alphabet of an unknown document. This capability is of direct practical relevance to palaeographers, historians, and other researchers working with undeciphered manuscripts.

Related papers

• MonkeyOCRv2: A Visual-Text Foundation Model for Document AI [71.06391669976786]
  MonkeyOCRv2 is a visual-text pretrained model for document AI.<n> MonkeyDoc v2 is the largest document-image pretraining corpus, comprising 113 million images spanning 17 languages.
  arXiv  Detail & Related papers  (2026-07-13T13:43:39Z)
• Learning to Decipher from Pixels -- A Case Study of Copiale [4.238413656800081]
  We propose an end-to-end, transcription-free approach that directly maps handwritten cipher images to plaintext.<n>We show that pretraining on generic handwriting data followed by cipher-specific fine-tuning substantially improves decipherment accuracy.<n>Our results demonstrate that transcription-free image-to-plaintext decipherment is both feasible and effective for historical substitution ciphers.
  arXiv  Detail & Related papers  (2026-04-26T12:51:41Z)
• Contrastive Masked Autoencoders for Character-Level Open-Set Writer Identification [25.996617568144675]
  This paper introduces Contrastive Masked Auto-Encoders (CMAE) for Character-level Open-Set Writer Identification.<n>We merge Masked Auto-Encoders (MAE) with Contrastive Learning (CL) to simultaneously and respectively capture sequential information and distinguish diverse handwriting styles.<n>Our model achieves state-of-the-art results on the CASIA online handwriting dataset, reaching an impressive precision rate of 89.7%.
  arXiv  Detail & Related papers  (2025-01-21T05:15:10Z)
• Online Writer Retrieval with Chinese Handwritten Phrases: A Synergistic Temporal-Frequency Representation Learning Approach [53.189911918976655]
  We propose DOLPHIN, a novel retrieval model designed to enhance handwriting representations through synergistic temporal-frequency analysis.<n>We introduce OLIWER, a large-scale online writer retrieval dataset encompassing over 670,000 Chinese handwritten phrases from 1,731 individuals.<n>Our findings emphasize the significance of point sampling frequency and pressure features in improving handwriting representation quality.
  arXiv  Detail & Related papers  (2024-12-16T11:19:22Z)
• Handwritten and Printed Text Segmentation: A Signature Case Study [0.0]
  We develop novel approaches to address the challenges of handwritten and printed text segmentation. Our objective is to recover text from different classes in their entirety, especially enhancing the segmentation performance on overlapping sections. Our best configuration outperforms prior work on two different datasets by 17.9% and 7.3% on IoU scores.
  arXiv  Detail & Related papers  (2023-07-15T21:49:22Z)
• Recognizing Handwriting Styles in a Historical Scanned Document Using Unsupervised Fuzzy Clustering [0.0]
  Unique handwriting styles may be dissimilar in a blend of several factors including character size, stroke width, loops, ductus, slant angles, and cursive ligatures. Previous work on labeled data with Hidden Markov models, support vector machines, and semi-supervised recurrent neural networks have provided moderate to high success. In this study, we successfully detect hand shifts in a historical manuscript through fuzzy soft clustering in combination with linear principal component analysis.
  arXiv  Detail & Related papers  (2022-10-30T09:07:51Z)
• Open Set Classification of Untranscribed Handwritten Documents [56.0167902098419]
  Huge amounts of digital page images of important manuscripts are preserved in archives worldwide. The class or typology'' of a document is perhaps the most important tag to be included in the metadata. The technical problem is one of automatic classification of documents, each consisting of a set of untranscribed handwritten text images.
  arXiv  Detail & Related papers  (2022-06-20T20:43:50Z)
• Letter-level Online Writer Identification [86.13203975836556]
  We focus on a novel problem, letter-level online writer-id, which requires only a few trajectories of written letters as identification cues. A main challenge is that a person often writes a letter in different styles from time to time. We refer to this problem as the variance of online writing styles (Var-O-Styles)
  arXiv  Detail & Related papers  (2021-12-06T07:21:53Z)
• Scalable Font Reconstruction with Dual Latent Manifolds [55.29525824849242]
  We propose a deep generative model that performs typography analysis and font reconstruction. Our approach enables us to massively scale up the number of character types we can effectively model. We evaluate on the task of font reconstruction over various datasets representing character types of many languages.
  arXiv  Detail & Related papers  (2021-09-10T20:37:43Z)
• Few Shots Is All You Need: A Progressive Few Shot Learning Approach for Low Resource Handwriting Recognition [1.7491858164568674]
  We propose a few-shot learning-based handwriting recognition approach that significantly reduces the human labor annotation process. Our model detects all symbols of a given alphabet in a textline image, then a decoding step maps the symbol similarity scores to the final sequence of transcribed symbols. Since this retraining would require annotation of thousands of handwritten symbols together with their bounding boxes, we propose to avoid such human effort through an unsupervised progressive learning approach.
  arXiv  Detail & Related papers  (2021-07-21T13:18:21Z)
• A Few-shot Learning Approach for Historical Ciphered Manuscript Recognition [3.0682439731292592]
  We propose a novel method for handwritten ciphers recognition based on few-shot object detection. By training on synthetic data, we show that the proposed architecture is able to recognize handwritten ciphers with unseen alphabets.
  arXiv  Detail & Related papers  (2020-09-26T11:49:18Z)
• Enabling Language Models to Fill in the Blanks [81.59381915581892]
  We present a simple approach for text infilling, the task of predicting missing spans of text at any position in a document. We train (or fine-tune) off-the-shelf language models on sequences containing the concatenation of artificially-masked text and the text which was masked. We show that this approach, which we call infilling by language modeling, can enable LMs to infill entire sentences effectively on three different domains: short stories, scientific abstracts, and lyrics.
  arXiv  Detail & Related papers  (2020-05-11T18:00: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.