arXiv:2607.23194cs.CV2026-07

解决长文本识别模型在实际应用中失效问题,发现编码器宽度是关键瓶颈。

Out-of-Length Scene Text Recognition: A Two-Axis Diagnosis and a Training-Free Fix

论文配图:Out-of-Length Scene Text Recognition: A Two-Axis Diagnosis and a Training-Free Fix
图 1 · 摘自论文原文
  • 将长文本识别失败分解为编码器宽度与解码时间两个轴向问题
  • 通过无训练切片拼接法在长文本基准上达到42.79%-47.11%准确率
  • 无需微调即可超越专用架构,适合部署于现有模型

场景文本识别(STR)模型几乎全部在最多25个字符的单词图像上训练,但真实应用场景(如广告牌、产品标签、密集字幕)需要识别更长文本。本文诊断出该问题并提出解决方案:将过长文本失败分解为编码器宽度和解码时间两个同时外推的维度,发现编码器宽度是主导性失效因素。表示层面修复仅部分缓解问题:无训练旋转重缩放可恢复2-4点字符错误率(CER),加权微调可恢复6-8点且提升标准基准表现,但在长文本基准(LTB)上词准确率仍接近零,因残余差距在于解码机制而非表示。因此,我们在推理时对未修改的单词级检查点采用几何锚定编辑距离对齐的切片拼接方法:将长图像按模型训练宽度切分为重叠块,独立解码后拼接。该方法在两个基础检查点上实现42.79%-43.05%的桶平均词准确率,匹配已有最优结果(41.57%),在最难点桶上领先11-12点,且推理速度与普通解码相当;应用于公开的PARSeq检查点可达47.11%。一旦采用切片策略,微调不再有效:解码端修复已足以媲美专用架构。论文发布诊断工具与实现代码。

原文摘要 · Abstract (English)

Scene Text Recognition (STR) models are trained almost exclusively on word crops of at most 25 characters, yet real deployments (signage, product labels, dense captions) require reading much longer text. This paper diagnoses that failure and then closes it. The diagnosis separates out-of-length failure into two simultaneously extrapolating axes (the encoder's width axis and the decoder's time axis) and shows that encoder width, not decoder length, is the dominant failure mode. Representation-side fixes bring only partial relief: training-free rotary rescalings recover at most 2-4 points of character error rate (CER), and a weighted fine-tuning recipe recovers 6-8 points while improving standard-benchmark accuracy, yet word accuracy on the Long Text Benchmark (LTB) stays near zero, because the residual gap lies in the decoding mechanism rather than the representation. We then close that gap at inference time, on an unmodified word-level checkpoint: the long image is sliced into overlapping crops at the model's training width, each decoded independently and in-distribution, and the reads stitched by geometry-anchored edit-distance alignment. This procedure reaches 42.79-43.05% bucket-average word accuracy on LTB across two base checkpoints, matching the published state of the art (41.57%) and beating it by 11-12 points on the hardest bucket, at wall-clock parity with plain decoding; applied unchanged to the public PARSeq checkpoint it reaches 47.11%. Once chunking is applied fine-tuning no longer helps: the decoding-side fix alone matches purpose-built architectures. We release the diagnosis harness and implementation.

文本识别长文本推理优化无训练

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。