Deep Shells: Unsupervised Shape Correspondence with Optimal Transport

10/28/2020
by   Marvin Eisenberger, et al.
0

We propose a novel unsupervised learning approach to 3D shape correspondence that builds a multiscale matching pipeline into a deep neural network. This approach is based on smooth shells, the current state-of-the-art axiomatic correspondence method, which requires an a priori stochastic search over the space of initial poses. Our goal is to replace this costly preprocessing step by directly learning good initializations from the input surfaces. To that end, we systematically derive a fully differentiable, hierarchical matching pipeline from entropy regularized optimal transport. This allows us to combine it with a local feature extractor based on smooth, truncated spectral convolution filters. Finally, we show that the proposed unsupervised method significantly improves over the state-of-the-art on multiple datasets, even in comparison to the most recent supervised methods. Moreover, we demonstrate compelling generalization results by applying our learned filters to examples that significantly deviate from the training set.

READ FULL TEXT

page 6

page 8

research
02/03/2022

Bending Graphs: Hierarchical Shape Matching using Gated Optimal Transport

Shape matching has been a long-studied problem for the computer graphics...
research
10/20/2019

Differentiable Deep Clustering with Cluster Size Constraints

Clustering is a fundamental unsupervised learning approach. Many cluster...
research
06/17/2021

NeuroMorph: Unsupervised Shape Interpolation and Correspondence in One Go

We present NeuroMorph, a new neural network architecture that takes as i...
research
05/29/2019

Smooth Shells: Multi-Scale Shape Registration with Functional Maps

We propose a novel 3D shape correspondence method based on the iterative...
research
11/09/2021

Graph Matching via Optimal Transport

The graph matching problem seeks to find an alignment between the nodes ...
research
12/24/2019

Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport

Hierarchical abstractions are a methodology for solving large-scale grap...
research
07/11/2022

Demystifying Unsupervised Semantic Correspondence Estimation

We explore semantic correspondence estimation through the lens of unsupe...

Please sign up or login with your details

Forgot password? Click here to reset