Deep Shells: Unsupervised Shape Correspondence with Optimal Transport
About
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.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Shape Matching | FAUST (test) | Mean Geodesic Error0.016 | 85 | |
| 3D Shape Correspondence | FAUST remeshed (test) | Mean Geodesic Error (x100)1.7 | 65 | |
| Shape Correspondence | SCAPE (test) | Shape Correspondence Error0.024 | 54 | |
| Shape Matching | SHREC'19 (test) | Mean Geodesic Error0.211 | 54 | |
| Shape Matching | SCAPE remeshed (test) | Mean Geodesic Error (x100)2.5 | 46 | |
| Non-rigid shape matching | DT4D-H | Mean Geodesic Error (x100)25.8 | 39 | |
| Shape Matching | SHREC19 remeshed (test) | Mean Geodesic Error0.214 | 37 | |
| Near-isometric shape matching | SCAPE (test) | Mean Geodesic Error2.4 | 32 | |
| Non-isometric 3D shape matching | SMAL | Mean Geodesic Error15.2 | 22 | |
| Non-rigid shape matching | SHREC H '07 | Mean Geodesic Error0.306 | 20 |