MDND: Unsupervised Learning Guided by Non-Differentiable Refinement for Shape Correspondence
Qinsong Li, Jing Meng, Haibo Wang, Shengjun Liu
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext a82311bb-69ac-4249-9ac0-16a15e89b9eeBuilds on17
- Unsupervised Deep Learning for Structured Shape MatchingJean-Michel Roufosse, Abhishek Sharma, Maks OvsjanikovICCV 2019 · 160 citations
- Deep Shells: Unsupervised Shape Correspondence with Optimal TransportMarvin Eisenberger, Aysim Toker, Laura Leal-Taixé, Daniel CremersNeurIPS 2020 · 107 citations
- Learning Multi-resolution Functional Maps with Spectral Attention for Robust Shape MatchingLei Li, Nicolas Donati, Maks OvsjanikovNeurIPS 2022 · 57 citations
- Unsupervised Learning of Robust Spectral Shape MatchingDongliang Cao, Paul Roetzer, Florian BernardSIGGRAPH 2023 · 45 citations
- Spatially and Spectrally Consistent Deep Functional MapsMingze Sun, Shiwei Mao, Puhua Jiang, Maks Ovsjanikov et al.ICCV 2023 · 37 citations
Related papers
- Unsupervised Contrastive Learning for Efficient and Robust Spectral Shape MatchingFeifan Luo, Hongyang ChenAAAI 2026
- Memory-Scalable and Simplified Functional Map LearningRobin Magnet, Maks OvsjanikovCVPR 2024 · 10 citations
- Weakly Supervised Deep Functional Maps for Shape MatchingAbhishek Sharma, Maks OvsjanikovNeurIPS 2020 · 58 citations
- Deep Geometric Functional Maps: Robust Feature Learning for Shape CorrespondenceNicolas Donati, Abhishek Sharma, Maks OvsjanikovCVPR 2020
- Non-Rigid Shape Registration via Deep Functional Maps PriorPuhua Jiang, Mingze Sun, Ruqi HuangNeurIPS 2023 · 23 citations
