Is it an i or an l: Test-time Adaptation of Text Line Recognition Models
Not on the map. Why?
Abstract (arXiv)
Recognizing text lines from images is a challenging problem, especially for handwritten documents due to large variations in writing styles. While text line recognition models are generally trained on large corpora of real and synthetic data, such models can still make frequent mistakes if the handwriting is inscrutable or the image acquisition process adds corruptions, such as noise, blur, compression, etc. Writing style is generally quite consistent for an individual, which can be leveraged to correct mistakes made by such models. Motivated by this, we introduce the problem of adapting text line recognition models during test time. We focus on a challenging and realistic setting where, given only a single test image consisting of multiple text lines, the task is to adapt the model such that it performs better on the image, without any labels. We propose an iterative self-training approach that uses feedback from the language model to update the optical model, with confident self-labels in each iteration. The confidence measure is based on an augmentation mechanism that evaluates the divergence of the prediction of the model in a local region. We perform rigorous evaluation of our method on several benchmark datasets as well as their corrupted versions. Experimental results on multiple datasets spanning multiple scripts show that the proposed adaptation method offers an absolute improvement of up to 8% in character error rate with just a few iterations of self-training at test time.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 28 of its 40 references that are in the map. First posted on arXiv 29 Aug 2023.
Builds on
28 of 40 references.
References · 28
- 2017Attention Is All You Needcited by 59,932
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,827
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,857
- 2017CyCADA: Cycle-Consistent Adversarial Domain Adaptationcited by 1,079
- 2014Deep Neural Networks are Easily Fooled: High Confidence Predictions for Unrecognizable Imagescited by 774
- 2018Learning to Adapt Structured Output Space for Semantic Segmentationcited by 584
- 2020Improving robustness against common corruptions by covariate shift adaptationcited by 427
- 2021MEMO: Test Time Robustness via Adaptation and Augmentationcited by 376
- 2021TrOCR: Transformer-based Optical Character Recognition with Pre-trained Modelscited by 278
- 2022Contrastive Test-Time Adaptationcited by 258
- 2020Evaluating Prediction-Time Batch Normalization for Robustness under Covariate Shiftcited by 235
16 more
- 2018Scene Text Detection and Recognition: The Deep Learning Eracited by 114
- 2022Test-Time Adaptation via Conjugate Pseudo-labelscited by 98
- 2022MM-TTA: Multi-Modal Test-Time Adaptation for 3D Semantic Segmentationcited by 76
- 2020ScrabbleGAN: Semi-Supervised Varying Length Handwritten Text Generationcited by 69
- 2021MT3: Meta Test-Time Training for Self-Supervised Test-Time Adaptioncited by 65
- 2021SITA: Single Image Test-time Adaptationcited by 57
- 2021MixNorm: Test-Time Adaptation Through Online Normalization Estimationcited by 47
- 2021Rethinking Text Line Recognition Modelscited by 45
- 2018Handwriting Recognition in Low-resource Scripts using Adversarial Learningcited by 32
- 2021MetaHTR: Towards Writer-Adaptive Handwritten Text Recognitioncited by 27
- 2019A Scalable Handwritten Text Recognition Systemcited by 25
- 2019Unsupervised Adaptation for Synthetic-to-Real Handwritten Word Recognitioncited by 11
- 2021KOHTD: Kazakh Offline Handwritten Text Datasetcited by 10
- 2022Test-time Adaptation with Slot-Centric Modelscited by 9
- 2023Towards Writing Style Adaptation in Handwriting Recognitioncited by 6
- 2021Reconstructing Training Data from Diverse ML Models by Ensemble Inversioncited by 5
Built on by
Citing papers per year: 2024: 2; 2025: 0; 2026: 1.
3 papers.