arXiv:2605.08814cs.CV2026-05

通过全局-局部双分支对齐,实现零样本中文字符识别的高效高准确率

Zero-Shot Chinese Character Recognition via Global-Local Dual-Branch Alignment and Hierarchical Inference

论文配图:Zero-Shot Chinese Character Recognition via Global-Local Dual-Branch Alignment and Hierarchical Inference
图 1 · 摘自论文原文
  • 构建全局-局部双分支网络,联合学习字符图像与字形描述的跨模态表示
  • 在多个零样本分割上表现优异,低资源下仍保持高精度,推理成本显著降低
  • 适合需要高效处理大规模未见中文字符的开放世界场景应用

中文字符类别极为庞大,开放世界中常出现未见过的字符,使零样本中文字符识别成为重要但具挑战性的问题。现有基于字形描述序列(IDS)的检索方法通常将字符图像与字形描述编码为单一全局向量进行匹配,虽高效但常忽略局部部件差异。直接引入补丁-标记级细粒度交互则受字形结构操作符噪声及全候选检索高成本影响。为此,我们提出全局-局部层次感知网络(GL-HPN),在统一跨模态对齐框架下联合学习字符图像与IDS序列的全局和局部表示。全局分支支持高效粗粒度召回,局部分支通过补丁-标记交互提升部件级区分能力。进一步引入结构过滤掩码,抑制局部相似性聚合中具有结构意义但无视觉实体的IDS操作符。在此基础上,设计从粗到精的层次化推理策略:先在全候选集上进行全局检索,再仅对前K个候选进行局部重排序,并通过归一化后验分数的无参数乘法融合。实验表明,GL-HPN在多个零样本分割上表现竞争力,尤其在低资源设置下表现突出,且大幅降低大规模候选检索的推理开销。

原文摘要 · Abstract (English)

Chinese character categories are extremely large, and unseen characters frequently arise in open-world scenarios, making zero-shot Chinese character recognition an important yet challenging problem. Existing IDS-based retrieval methods usually encode a character image and its ideographic description sequence into a single global vector for matching. Although efficient, such holistic alignment often under-models local component differences. Moreover, directly introducing patch-token level fine-grained interaction suffers from both the noise of structural operators in IDS and the high cost of full-candidate retrieval.To address these issues, we propose a Global-Local Hierarchical Perception Network (GL-HPN), which jointly learns global and local representations of character images and IDS sequences within a unified cross-modal alignment framework. The global branch supports efficient coarse recall, while the local branch improves component-level discrimination through patch-token interaction. We further introduce a structure filtering mask to suppress structurally meaningful but visually non-entity IDS operators in local similarity aggregation. On top of this, we design a coarse-to-fine hierarchical inference strategy that performs global retrieval over the full candidate set and local reranking only on Top-$K$ candidates, followed by parameter-free multiplicative fusion of normalized posterior scores. Experimental results show that GL-HPN achieves competitive performance across multiple zero-shot splits, performs especially well under low-resource settings, and substantially reduces the inference cost of large-scale candidate retrieval.

零样本识别中文字符跨模态对齐层次推理

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