DcMatch: Unsupervised Multi-Shape Matching with Dual-Level Consistency
Tianwei Ye, Yong Ma, Xiaoguang Mei
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 03cec6e6-1254-4f9f-a6fe-ede061862fa6Builds on19
- How Attentive are Graph Attention Networks?Shaked Brody, Uri Alon, Eran YahavICLR 2022 · 1,717 citations
- Unsupervised Deep Learning for Structured Shape MatchingJean-Michel Roufosse, Abhishek Sharma, Maks OvsjanikovICCV 2019 · 160 citations
- Deep Shells: Unsupervised Shape Correspondence with Optimal TransportMarvin Eisenberger, Aysim Toker, Laura Leal-Taixé, Daniel CremersNeurIPS 2020 · 107 citations
- Learning Multi-resolution Functional Maps with Spectral Attention for Robust Shape MatchingLei Li, Nicolas Donati, Maks OvsjanikovNeurIPS 2022 · 57 citations
- Unsupervised Learning of Robust Spectral Shape MatchingDongliang Cao, Paul Roetzer, Florian BernardSIGGRAPH 2023 · 45 citations
Related papers
- G-MSM: Unsupervised Multi-Shape Matching with Graph-Based Affinity PriorsMarvin Eisenberger, Aysim Toker, Laura Leal-Taixé, Daniel CremersCVPR 2023
- Universe Points Representation Learning for Partial Multi-Graph MatchingZhakshylyk Nurlanov, Frank R. Schmidt, Florian BernardAAAI 2023 · 6 citations
- Unsupervised Contrastive Learning for Efficient and Robust Spectral Shape MatchingFeifan Luo, Hongyang ChenAAAI 2026
- Probabilistic Deformation Consistency for Unsupervised Shape MatchingYifan Xia, Tianwei Ye, Jun Huang, Xiaoguang Mei et al.AAAI 2026
- Spatially and Spectrally Consistent Deep Functional MapsMingze Sun, Shiwei Mao, Puhua Jiang, Maks Ovsjanikov et al.ICCV 2023 · 37 citations
