Out of Length Text Recognition with Sub-String Matching
Yongkun Du, Zhineng Chen, Caiyan Jia, Xieping Gao, Yu-Gang, Jiang

TL;DR
This paper introduces a new long text recognition benchmark and a novel sub-string matching method, SMTR, that effectively recognizes arbitrarily long text by iteratively matching sub-strings, even trained only on short text datasets.
Contribution
The paper presents the first Long Text Benchmark (LTB) and a novel sub-string matching approach, SMTR, for out-of-length text recognition, enabling effective long text recognition from short text training data.
Findings
SMTR outperforms existing methods on short text benchmarks.
SMTR achieves superior performance on the new LTB.
Regularization and inference strategies improve recognition accuracy.
Abstract
Scene Text Recognition (STR) methods have demonstrated robust performance in word-level text recognition. However, in real applications the text image is sometimes long due to detected with multiple horizontal words. It triggers the requirement to build long text recognition models from readily available short (i.e., word-level) text datasets, which has been less studied previously. In this paper, we term this task Out of Length (OOL) text recognition. We establish the first Long Text Benchmark (LTB) to facilitate the assessment of different methods in long text recognition. Meanwhile, we propose a novel method called OOL Text Recognition with sub-String Matching (SMTR). SMTR comprises two cross-attention-based modules: one encodes a sub-string containing multiple characters into next and previous queries, and the other employs the queries to attend to the image features, matching the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsAlgorithms and Data Compression · Handwritten Text Recognition Techniques · Speech Recognition and Synthesis
