提出低秩逼近网络,实现任意形状文字的高精度高效检测
LRANet++: Low-Rank Approximation Network for Accurate and Efficient Text Spotting
- 用低秩分解建模文字形状相关性,从噪声标注中提取关键形状基向量
- 三分支检测头设计使训练与推理分离,推理速度显著提升
- 适用于需要快速准确识别不规则文字的工业场景
端到端文字定位旨在统一优化文字检测与识别。尽管进展显著,针对任意形状文字的高精度高效检测仍具挑战。本文发现核心瓶颈在于缺乏可靠高效的检测方法。为此,提出基于低秩逼近的参数化文字形状表示,实现精准检测;并设计三重分配检测头以加速推理。不同于现有无关数据的形状表示方法,利用标注文字边界的形状相关性构建稳健的低秩子空间,通过最小化ℓ₁范数目标,提取正交基向量,仅需少数基向量即可线性重构真实形状。三重分配机制将训练复杂度与推理速度解耦:深而稀疏分支指导超轻量推理分支,密集分支提供丰富并行监督。在此基础上,集成增强检测模块与轻量识别分支,构建端到端文字定位框架LRANet++,可高效准确地定位任意形状文字。在多个挑战性基准测试中,其性能优于当前最优方法。代码已开源:https://github.com/ychensu/LRANet-PP。
原文摘要 · Abstract (English)
End-to-end text spotting aims to jointly optimize text detection and recognition within a unified framework. Despite significant progress, designing an accurate and efficient end-to-end text spotter for arbitrary-shaped text remains challenging. We identify the primary bottleneck as the lack of a reliable and efficient text detection method. To address this, we propose a novel parameterized text shape representation based on low-rank approximation for precise detection and a triple assignment detection head for fast inference. Specifically, unlike current data-irrelevant shape representation methods, we exploit shape correlations among labeled text boundaries to construct a robust low-rank subspace. By minimizing an $\ell_1$-norm objective, we extract orthogonal vectors that capture the intrinsic text shape from noisy annotations, enabling precise reconstruction via the linear combination of only a few basis vectors. Next, the triple assignment scheme decouples training complexity from inference speed. It utilizes a deep sparse branch to guide an ultra-lightweight inference branch, while a dense branch provides rich parallel supervision. Building upon these advancements, we integrate the enhanced detection module with a lightweight recognition branch to form an end-to-end text spotting framework, termed LRANet++, capable of accurately and efficiently spotting arbitrary-shaped text. Extensive experiments on challenging benchmarks demonstrate the superiority of LRANet++ compared to state-of-the-art methods. Code is available at: https://github.com/ychensu/LRANet-PP.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。