DcMatch: Unsupervised Multi-Shape Matching with Dual-Level Consistency
Not on the map. Why?
Abstract (arXiv)
Establishing point-to-point correspondences across multiple 3D shapes is a fundamental problem in computer vision and graphics. In this paper, we introduce DcMatch, a novel unsupervised learning framework for non-rigid multi-shape matching. Unlike existing methods that learn a canonical embedding from a single shape, our approach leverages a shape graph attention network to capture the underlying manifold structure of the entire shape collection. This enables the construction of a more expressive and robust shared latent space, leading to more consistent shape-to-universe correspondences via a universe predictor. Simultaneously, we represent these correspondences in both the spatial and spectral domains and enforce their alignment in the shared universe space through a novel cycle consistency loss. This dual-level consistency fosters more accurate and coherent mappings. Extensive experiments on several challenging benchmarks demonstrate that our method consistently outperforms previous state-of-the-art approaches across diverse multi-shape matching scenarios.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 23 of its 53 references that are in the map. First posted on arXiv 1 Sep 2025.
Builds on
23 of 53 references.
References · 23
- 20163D Menagerie: Modeling the 3D shape and pose of animalscited by 312
- 2018Learning Latent Permutations with Gumbel-Sinkhorn Networkscited by 175
- 2020DiffusionNet: Discretization Agnostic Learning on Surfacescited by 164
- 2017Deep Functional Maps: Structured Prediction for Dense Shape Correspondencecited by 134
- 2020Deep Geometric Functional Maps: Robust Feature Learning for Shape Correspondencecited by 125
- 2018Unsupervised Deep Learning for Structured Shape Matchingcited by 81
- 2021NeuroMorph: Unsupervised Shape Interpolation and Correspondence in One Gocited by 81
- 2018Continuous and Orientation-preserving Correspondences via Functional Mapscited by 77
- 2020Deep Shells: Unsupervised Shape Correspondence with Optimal Transportcited by 74
- 2019Smooth Shells: Multi-Scale Shape Registration with Functional Mapscited by 72
- 2023Unsupervised Learning of Robust Spectral Shape Matchingcited by 57
- 2022Smooth Non-Rigid Shape Matching via Effective Dirichlet Energy Optimizationcited by 37
11 more
- 2022Deep Orientation-Aware Functional Maps: Tackling Symmetry Issues in Shape Matchingcited by 36
- 2022Learning Multi-resolution Functional Maps with Spectral Attention for Robust Shape Matchingcited by 35
- 2020Isometric Multi-Shape Matchingcited by 33
- 2017Product Manifold Filter: Non-Rigid Shape Correspondence via Kernel Density Estimation in the Product Spacecited by 30
- 2023Spatially and Spectrally Consistent Deep Functional Mapscited by 30
- 2020Structured Regularization of Functional Map Computationscited by 26
- 2018Higher-order Projected Power Iterations for Scalable Multi-Matchingcited by 24
- 2023Hybrid Functional Maps for Crease-Aware Non-Isometric Shape Matchingcited by 18
- 2018Synchronisation of Partial Multi-Matchings via Non-negative Factorisationscited by 15
- 2025Denoising Functional Maps: Diffusion Models for Shape Correspondencecited by 14
- 2022G-MSM: Unsupervised Multi-Shape Matching with Graph-based Affinity Priorscited by 8
Built on by
Citing papers per year: 2026: 1.
1 paper.