arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.18924cs.CV

无监督对比学习用于高效且鲁棒的光谱形状匹配

Unsupervised Contrastive Learning for Efficient and Robust Spectral Shape Matching

College of Computer Science and Technology, Zhejiang University(浙江大学计算机科学与技术学院);Research Center for Data Hub and Security, Zhejiang Lab(浙江实验室数据枢纽与安全研究中心)

Feifan Luo, Hongyang Chen

AI总结:

本文提出一种无监督对比学习方法,通过提升嵌入空间中的特征一致性与判别性,实现高效且鲁棒的3D形状匹配,优于现有方法。

摘要:

估计成对非刚性变形3D形状之间的对应关系仍然是计算视觉和图形领域的重要挑战。尽管深度函数映射方法已成为解决此问题的主流方案,但它们主要关注于优化点wise和函数映射,而非直接增强嵌入空间中的特征表示,这常导致特征质量不足和匹配性能不佳。此外,这些方法严重依赖传统函数映射技术,如耗时的函数映射求解器,导致计算成本高。本文首次提出一种基于无监督对比学习的新方法,用于高效且鲁棒的3D形状匹配。我们首先提出一个无监督对比学习框架,通过最大化正相似对的一致性并最小化负相似对的一致性,从而提升所学特征的一致性和判别性。然后设计了一个显著简化的函数映射学习架构,消除了对计算昂贵的函数映射求解器和多个辅助函数映射损失的依赖,大大提高了计算效率。通过将这两个组件整合到统一的双分支管道中,我们的方法在准确性和效率上均达到最先进的水平。大量实验表明,我们的方法不仅计算高效,而且在各种具有挑战性的基准测试中均优于当前最先进的方法,包括近等距、非等距和拓扑不一致场景,甚至超越了监督技术。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑