arXiv:2603.18924cs.CV2026-03AAAI

用无监督对比学习提升3D形状匹配的效率与鲁棒性

Unsupervised Contrastive Learning for Efficient and Robust Spectral Shape Matching

  • 通过正负样本对比学习优化嵌入特征的一致性和区分度
  • 无需复杂求解器,计算效率显著提升,准确率超越现有方法
  • 适合需要高效精准形状匹配的科研与工业场景

非刚性可变形3D形状之间的对应关系估计仍是计算机视觉与图形学中的重大挑战。尽管深度函数映射方法已成为主流解决方案,但其主要聚焦于点对点或函数映射的优化,而非直接提升嵌入空间中的特征表示质量,常导致特征质量不足和匹配性能不佳。此外,这些方法严重依赖传统函数映射技术(如耗时的函数映射求解器),带来巨大计算开销。本文首次提出一种基于无监督对比学习的新型3D形状匹配方法。我们设计了一个无监督对比学习框架,通过最大化正样本对间的一致性、最小化负样本对间的相似性,提升学习特征的连贯性与判别力。同时,构建了大幅简化的函数映射学习架构,摒弃了高成本的函数映射求解器及多个辅助损失项,极大提升计算效率。将二者整合为统一双分支流程,本方法在准确率与效率上均达到当前最优。大量实验表明,该方法不仅计算高效,在近等距、非等距及拓扑不一致等复杂场景下均优于现有最先进方法,甚至超越部分有监督技术。

原文摘要 · Abstract (English)

Estimating correspondences between pairs of non-rigid deformable 3D shapes remains a significant challenge in computer vision and graphics. While deep functional map methods have become the go-to solution for addressing this problem, they primarily focus on optimizing pointwise and functional maps either individually or jointly, rather than directly enhancing feature representations in the embedding space, which often results in inadequate feature quality and suboptimal matching performance. Furthermore, these approaches heavily rely on traditional functional map techniques, such as time-consuming functional map solvers, which incur substantial computational costs. In this work, we introduce, for the first time, a novel unsupervised contrastive learning-based approach for efficient and robust 3D shape matching. We begin by presenting an unsupervised contrastive learning framework that promotes feature learning by maximizing consistency within positive similarity pairs and minimizing it within negative similarity pairs, thereby improving both the consistency and discriminability of the learned features.We then design a significantly simplified functional map learning architecture that eliminates the need for computationally expensive functional map solvers and multiple auxiliary functional map losses, greatly enhancing computational efficiency. By integrating these two components into a unified two-branch pipeline, our method achieves state-of-the-art performance in both accuracy and efficiency. Extensive experiments demonstrate that our approach is not only computationally efficient but also outperforms current state-of-the-art methods across various challenging benchmarks, including near-isometric, non-isometric, and topologically inconsistent scenarios, even surpassing supervised techniques.

3D匹配对比学习无监督形状分析

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