通过知识约束优化传输提升多标签图像识别准确率
Recover and Match: Open-Vocabulary Multi-Label Recognition through Knowledge-Constrained Optimal Transport
- 设计阶梯局部适配器恢复局部语义,避免全局预训练干扰
- 用知识约束最优传输匹配区域与标签,减少错误关联
- 适用于开放词汇多标签识别,尤其适合复杂场景应用
在图像中识别多个新类别(即开放词汇多标签识别)是计算机视觉中的难题。现有方法依赖于CLIP等视觉语言模型,但存在两大挑战:(1) CLIP的全局预训练目标破坏了局部语义,导致区域预测不可靠;(2) 忽视图像区域与候选标签间的匹配关系,仅用平均池化聚合特征,引发无关区域带来的误判。本文提出RAM(Recover And Match)框架,针对第一问题,引入阶梯局部适配器(LLA),以轻量方式恢复局部语义;针对第二问题,提出知识约束最优传输(KCOT),将匹配任务建模为最优传输问题,抑制非真实标签的无效匹配。实验表明,RAM在三个不同领域的多个数据集上达到当前最佳性能,且可有效提升现有方法表现。代码已开源。
原文摘要 · Abstract (English)
Identifying multiple novel classes in an image, known as open-vocabulary multi-label recognition, is a challenging task in computer vision. Recent studies explore the transfer of powerful vision-language models such as CLIP. However, these approaches face two critical challenges: (1) The local semantics of CLIP are disrupted due to its global pre-training objectives, resulting in unreliable regional predictions. (2) The matching property between image regions and candidate labels has been neglected, relying instead on naive feature aggregation such as average pooling, which leads to spurious predictions from irrelevant regions. In this paper, we present RAM (Recover And Match), a novel framework that effectively addresses the above issues. To tackle the first problem, we propose Ladder Local Adapter (LLA) to enforce refocusing on local regions, recovering local semantics in a memory-friendly way. For the second issue, we propose Knowledge-Constrained Optimal Transport (KCOT) to suppress meaningless matching to non-GT labels by formulating the task as an optimal transport problem. As a result, RAM achieves state-of-the-art performance on various datasets from three distinct domains, and shows great potential to boost the existing methods. Code: https://github.com/EricTan7/RAM.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。