CPN: Complementary Proposal Network for Unconstrained Text Detection
Longhuang Wu, Shangxuan Tian, Youxin Wang, Pengfei Xiong
TL;DR
CPN tackles unconstrained scene text detection by uniting segmentation-like semantic cues and anchor-based geometric proposals in two parallel networks. The Deformable Morphology Semantic Network provides efficient semantic proposals through differentiable morphological operations, while the Balanced Region Proposal Network supplies geometric proposals with oriented anchors; an Interleaved Feature Attention module fuses these signals for mutual supervision. Across five benchmarks, CPN achieves new or competitive state-of-the-art results with favorable speed, illustrating that complementary proposal generation and cross-branch interaction substantially improve recall and precision for curved, long, and multilingual text. The work demonstrates the practical value of end-to-end trainable, dual-proposal architectures for complex text detection tasks.
Abstract
Existing methods for scene text detection can be divided into two paradigms: segmentation-based and anchor-based. While Segmentation-based methods are well-suited for irregular shapes, they struggle with compact or overlapping layouts. Conversely, anchor-based approaches excel for complex layouts but suffer from irregular shapes. To strengthen their merits and overcome their respective demerits, we propose a Complementary Proposal Network (CPN) that seamlessly and parallelly integrates semantic and geometric information for superior performance. The CPN comprises two efficient networks for proposal generation: the Deformable Morphology Semantic Network, which generates semantic proposals employing an innovative deformable morphological operator, and the Balanced Region Proposal Network, which produces geometric proposals with pre-defined anchors. To further enhance the complementarity, we introduce an Interleaved Feature Attention module that enables semantic and geometric features to interact deeply before proposal generation. By leveraging both complementary proposals and features, CPN outperforms state-of-the-art approaches with significant margins under comparable computation cost. Specifically, our approach achieves improvements of 3.6%, 1.3% and 1.0% on challenging benchmarks ICDAR19-ArT, IC15, and MSRA-TD500, respectively. Code for our method will be released.
