提出可学习谱基的统一框架,提升3D形状匹配效率与鲁棒性。
From Feature Learning to Spectral Basis Learning: A Unifying and Flexible Framework for Efficient and Robust Shape Matching
- 用可学习的抑制函数优化谱基,替代固定基函数。
- 在非等距和拓扑噪声下显著优于现有方法,速度更快。
- 适合需要高效鲁棒形状匹配的研究者与工业应用。
形状匹配是计算机图形学与视觉中的基础任务,深度函数映射已成为主流范式。然而,现有方法主要关注通过约束点对和函数映射来学习信息丰富的特征表示,却忽视了谱基这一函数映射流程中的关键组件的优化,常导致次优结果。此外,多数方法依赖传统耗时的函数映射求解器,带来显著计算开销。为此,我们提出高级函数映射(Advanced Functional Maps)框架,通过将固定基函数替换为可学习基函数,推广标准函数映射,并提供严格的理论保障。具体地,谱基通过一组可学习的抑制函数进行优化。基于此,我们首次提出无监督谱基学习方法,实现特征提取与基函数的端到端联合优化。方法引入新颖的热扩散模块与无监督损失函数,采用简化架构,跳过昂贵求解器与辅助损失。大量实验表明,该方法在非等距及拓扑噪声场景下显著优于当前最优特征学习方法,同时保持高效率。最后,我们揭示优化谱基等价于谱卷积,抑制函数充当滤波器。这一洞察启发了受谱图网络启发的增强表示,为未来研究开辟新路径。代码已公开于 https://github.com/LuoFeifan77/Unsupervised-Spectral-Basis-Learning。
原文摘要 · Abstract (English)
Shape matching is a fundamental task in computer graphics and vision, with deep functional maps becoming a prominent paradigm. However, existing methods primarily focus on learning informative feature representations by constraining pointwise and functional maps, while neglecting the optimization of the spectral basis-a critical component of the functional map pipeline. This oversight often leads to suboptimal matching results. Furthermore, many current approaches rely on conventional, time-consuming functional map solvers, incurring significant computational overhead. To bridge these gaps, we introduce Advanced Functional Maps, a framework that generalizes standard functional maps by replacing fixed basis functions with learnable ones, supported by rigorous theoretical guarantees. Specifically, the spectral basis is optimized through a set of learned inhibition functions. Building on this, we propose the first unsupervised spectral basis learning method for robust non-rigid 3D shape matching, enabling the joint, end-to-end optimization of feature extraction and basis functions. Our approach incorporates a novel heat diffusion module and an unsupervised loss function, alongside a streamlined architecture that bypasses expensive solvers and auxiliary losses. Extensive experiments demonstrate that our method significantly outperforms state-of-the-art feature-learning approaches, particularly in challenging non-isometric and topological noise scenarios, while maintaining high efficiency. Finally, we reveal that optimizing basis functions is equivalent to spectral convolution, where inhibition functions act as filters. This insight enables enhanced representations inspired by spectral graph networks, opening new avenues for future research. Our code is available at https://github.com/LuoFeifan77/Unsupervised-Spectral-Basis-Learning.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。