MDND: Unsupervised Learning Guided by Non-Differentiable Refinement for Shape Correspondence

TL;DR

MDND combines differentiable and non-differentiable methods for unsupervised shape correspondence, significantly improving accuracy on non-isometric shapes.

cs.CV 🔴 Advanced 2026-07-17 4 views
Qinsong Li Jing Meng Haibo Wang Shengjun Liu
shape correspondence deep learning unsupervised learning functional map non-isometric shapes

Key Findings

Methodology

MDND employs a dual-branch architecture combining differentiable and non-differentiable methods. The non-differentiable branch uses a multiscale iterative solver to produce robust correspondences, serving as a refined target. The differentiable branch predicts correspondences from features, and the entire system is trained unsupervised with a consistency loss.

Key Results

  • MDND achieved state-of-the-art performance on multiple datasets, significantly reducing mean geodesic error in non-isometric deformation and topological noise scenarios.
  • Compared to methods like ULRSSM and HybridFMaps, MDND shows higher accuracy and consistency on complex shapes.
  • Ablation studies indicate that integrating non-differentiable refinement significantly enhances initial prediction quality.

Significance

MDND breaks the reliance on end-to-end differentiability in traditional deep functional map frameworks, effectively integrating non-differentiable refinement methods into deep learning, significantly improving shape matching accuracy, especially for complex non-isometric shapes.

Technical Contribution

MDND introduces non-differentiable refinement as a supervisory signal, overcoming limitations of existing methods, providing new theoretical guarantees and engineering possibilities, particularly in efficiently handling complex shape matching tasks.

Novelty

MDND is the first to integrate non-differentiable refinement into the deep functional map framework, breaking the differentiability constraint of existing methods, significantly improving matching accuracy.

Limitations

  • May still face accuracy degradation when handling extremely complex shapes, particularly in high-frequency details.
  • High memory requirements for high-resolution meshes may affect large-scale applications.

Future Work

Future research could explore applications on larger scales and more complex shapes, and further optimize the efficiency and robustness of non-differentiable refinement methods.

AI Executive Summary

Shape correspondence is a fundamental problem in computer vision and graphics, where existing methods often underperform on non-isometric shapes.

MDND proposes a novel deep functional map framework by combining differentiable and non-differentiable components for unsupervised learning. This method employs a dual-branch architecture, where the non-differentiable branch uses a multiscale iterative solver to produce robust correspondences as a refined target, while the differentiable branch predicts correspondences from features.

Experimental results show that MDND achieves state-of-the-art performance on multiple datasets, particularly excelling in non-isometric deformation and topological noise scenarios. However, future research needs to address challenges in applying it to extremely complex shapes.

Deep Analysis

Background

Shape correspondence has broad applications in computer vision and graphics, such as texture transfer, shape interpolation, and animation. Despite various proposed methods, challenges remain in handling non-isometric shapes.

Core Problem

Existing deep functional map frameworks rely on end-to-end differentiability, limiting the integration of high-precision non-differentiable refinement techniques, resulting in constrained performance on complex shapes.

Innovation

MDND breaks the differentiability constraint of existing frameworks by integrating non-differentiable methods, effectively incorporating non-differentiable refinement into deep learning for the first time.

Methodology

  • �� Non-differentiable branch: Uses a multiscale iterative solver to produce robust correspondences.
  • �� Differentiable branch: Predicts correspondences from features.
  • �� Consistency loss: Forces the differentiable branch to learn from the refined results of the non-differentiable branch.

Experiments

Experiments were conducted on multiple datasets, including non-isometric deformation and topological noise scenarios, using mean geodesic error as the evaluation metric, compared against various state-of-the-art methods.

Results

MDND achieved state-of-the-art performance on multiple datasets, particularly excelling in handling complex shapes, significantly reducing mean geodesic error.

Applications

MDND can be used in texture transfer, shape interpolation, and animation, particularly advantageous in handling complex non-isometric shapes.

Limitations & Outlook

Although MDND performs well in various scenarios, challenges remain in applying it to extremely complex shapes, and future research needs to further optimize its efficiency.

Plain Language Accessible to non-experts

Imagine you're in a kitchen cooking. MDND is like a smart chef assistant that helps you slice ingredients more finely, even those with odd shapes. Traditional methods are like regular knives that can only cut simple shapes. MDND combines the benefits of regular knives and advanced slicers, making it better at handling complex ingredient shapes.

ELI14 Explained like you're 14

Imagine you're playing a puzzle game. MDND is like a super helper that quickly finds the spots for oddly shaped puzzle pieces. Traditional methods are like regular puzzle helpers that can only handle simple pieces. MDND combines the benefits of regular and advanced helpers, making it better at handling complex puzzle shapes.

Glossary

Functional Map

A method representing correspondences between shapes as a small matrix, typically on the spectral basis of the Laplace-Beltrami Operator (LBO).

Used to represent correspondences between shapes.

Non-Isometric Deformation

Refers to shape deformations that do not preserve isometric properties, leading to changes in the local or global structure of the shape.

MDND excels in handling such deformations.

Consistency Loss

A loss function that enforces consistency between outputs of different branches, improving model learning effectiveness.

Used for unsupervised training of MDND.

Multiscale Iterative Solver

An algorithm for generating robust correspondences through iterative optimization, enhancing accuracy.

Core component of MDND's non-differentiable branch.

Laplace-Beltrami Operator

An operator used to compute intrinsic geometric properties of shapes, commonly used in spectral bases for functional maps.

Used to construct the spectral basis for functional maps.

Open Questions Unanswered questions from this research

  • 1 How to further improve accuracy on extremely complex shapes, as current methods still fall short on high-frequency details.
  • 2 How to reduce memory requirements for high-resolution meshes for large-scale applications.

Applications

Immediate Applications

Texture Transfer

MDND can be used to transfer textures from one shape to another, excelling on complex shapes.

Long-term Vision

Animation Production

MDND can be used to generate more natural animation effects, especially when handling complex character shapes.

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.

cs.CV