arXiv:2511.07078cs.CV2025-11中稿 · SCIENCE CHINA Info…

用新架构提升两视图匹配点去噪精度,无需额外模块

LeCoT: revisiting network architecture for two-view correspondence pruning

  • 引入空间-通道融合注意力块,自然捕获匹配点全局上下文
  • 多阶段预测块逐步优化置信度,减少信息丢失
  • 在姿态估计、三维重建等任务中超越当前最佳方法

两视图对应点去噪旨在准确剔除初始匹配中的错误对应(离群点),广泛应用于各类计算机视觉任务。当前主流方法采用多层感知机(MLP)作为主干,并辅以额外模块增强上下文建模能力,但MLP本身对上下文建模存在固有局限。本文提出一种新视角,在不依赖额外模块的前提下捕捉对应点的上下文信息。为此,设计了名为LeCoT的两视图对应点去噪网络,可自然地在不同阶段利用全局上下文信息。核心组件为新提出的空间-通道融合变换器块(Spatial-Channel Fusion Transformer block),能高效利用稀疏对应点间的空间与通道全局上下文信息。此外,引入预测块,利用中间层对应特征生成概率集合,作为后续学习阶段的引导信息,使网络更有效捕获鲁棒的全局上下文。该预测块逐步精炼概率集合,缓解传统方法中常见的信息损失问题。大量实验表明,LeCoT在对应点去噪、相对位姿估计、单应性估计、视觉定位和3D重建任务中均优于现有最先进方法。

原文摘要 · Abstract (English)

Two-view correspondence pruning aims to accurately remove incorrect correspondences (outliers) from initial ones and is widely applied to various computer vision tasks. Current popular strategies adopt multilayer perceptron (MLP) as the backbone, supplemented by additional modules to enhance the network ability to handle context information, which is a known limitation of MLPs. In contrast, we introduce a novel perspective for capturing correspondence context information without extra design modules. To this end, we design a two-view correspondence pruning network called LeCoT, which can naturally leverage global context information at different stages. Specifically, the core design of LeCoT is the Spatial-Channel Fusion Transformer block, a newly proposed component that efficiently utilizes both spatial and channel global context information among sparse correspondences. In addition, we integrate the proposed prediction block that utilizes correspondence features from intermediate stages to generate a probability set, which acts as guiding information for subsequent learning phases, allowing the network to more effectively capture robust global context information. Notably, this prediction block progressively refines the probability set, thereby mitigating the issue of information loss that is common in the traditional one. Extensive experiments prove that the proposed LeCoT outperforms state-of-the-art methods in correspondence pruning, relative pose estimation, homography estimation, visual localization, and $3$D~reconstruction tasks. The code is provided in https://github.com/Dailuanyuan2024/LeCoT-Revisiting-Network-Architecture-for-Two-View-Correspondence-Pruning.

图像匹配结构化推理注意力机制

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