MDND: Unsupervised Learning Guided by Non-Differentiable Refinement for Shape Correspondence
Summary
MDND is a novel Deep Functional Map (DFM) paradigm designed to overcome the limitations of traditional DFM frameworks, which are constrained by their reliance on end-to-end differentiability. This new approach integrates highly accurate, non-differentiable refinement techniques, previously incompatible with DFM's differentiable nature, to improve performance on challenging non-isometric shapes. MDND employs a dual-branch architecture: one non-differentiable branch utilizes a multiscale iterative solver to generate robust correspondences, serving as a refined target. Concurrently, a fully differentiable branch learns to predict correspondences directly from features. The entire system is trained unsupervised, end-to-end, by enforcing a consistency loss that guides the differentiable branch to learn from the superior outputs of its non-differentiable counterpart. Experiments show MDND achieves leading results, demonstrating significant robustness against non-isometric deformations and topological noise.
Key takeaway
For Computer Vision Engineers developing shape correspondence systems, MDND offers a critical advancement. If you are struggling with non-isometric deformations or topological noise, consider adopting MDND's dual-branch approach. This method allows you to integrate highly accurate, non-differentiable refinement techniques, previously inaccessible, into your unsupervised learning pipelines. You can achieve superior robustness and leading performance by leveraging a consistency loss to guide your differentiable models.
Key insights
Merging differentiable and non-differentiable components enables unsupervised learning for robust shape correspondence.
Principles
- Differentiability constraints limit DFM performance.
- Non-differentiable refinement improves robustness.
- Consistency loss can guide unsupervised learning.
Method
MDND uses a dual-branch architecture: a non-differentiable branch with a multiscale iterative solver generates refined targets, while a differentiable branch learns from these via a consistency loss in unsupervised training.
In practice
- Integrate non-differentiable solvers into DFM.
- Use consistency loss for unsupervised learning.
- Apply to non-isometric shape matching tasks.
Topics
- Deep Functional Maps
- Shape Correspondence
- Unsupervised Learning
- Non-Differentiable Refinement
- Computer Vision
- MDND
Best for: Research Scientist, AI Scientist, Machine Learning Engineer, Computer Vision Engineer
Related on AIssential
See Counsel's argued verdicts on the open AI decisions leaders are weighing →
Editorial summary, takeaway, and curation by AIssential. Original article published by Computer Vision and Pattern Recognition.