将不可微优化融入深度学习,提升形状对应精度。
MDND: Unsupervised Learning Guided by Non-Differentiable Refinement for Shape Correspondence

- 双分支架构:可微分支学习特征,不可微分支用多尺度迭代求解器生成高质量对应。
- 无监督训练中,可微分支通过一致性损失学习不可微分支的优质结果。
- 在非等距变形和拓扑噪声下表现优异,适合复杂形状匹配任务。
基于深度函数映射(DFM)的形状对应方法虽强大,但受限于端到端可微性,难以融合高精度但不可微的优化技术,导致性能受限,尤其在非等距变形形状上表现不佳。为此,我们提出MDND,一种融合可微与不可微组件的新范式。其采用双分支结构:不可微分支利用新型多尺度迭代求解器生成鲁棒对应,作为精修目标;可微分支则从特征中预测对应。整个系统在无监督下端到端训练,通过一致性损失强制可微分支学习不可微分支的优解。大量实验表明,MDND达到新基准,在非等距形变与拓扑噪声下表现出显著鲁棒性。
原文摘要 · Abstract (English)
Deep functional map frameworks (DFM) for shape correspondence are powerful, yet fundamentally limited by their reliance on end-to-end differentiability. This constraint prevents the integration of highly accurate, non-differentiable refinement techniques, capping their overall performance, especially on challenging non-isometric shapes. To overcome this, we introduce MDND, a novel DFM paradigm built on the principle of merging differentiable and non-differentiable components. Our framework facilitates unsupervised learning guided by an internal, non-differentiable refinement. Specifically, MDND employs a dual-branch architecture: a non-differentiable refinement branch leverages a novel, multiscale iterative solver to produce highly robust correspondences, acting as a refined target. Concurrently, a fully differentiable branch learns to predict correspondences from features. The entire system is trained end-to-end without supervision by enforcing a consistency loss that compels the differentiable branch to learn from the superior, refined results of the non-differentiable branch. Extensive experiments show that MDND sets a new state-of-the-art, demonstrating remarkable robustness on shapes with non-isometric deformations and topological noise.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。