Understanding and Improving Features Learned in Deep Functional Maps
Souhaib Attaiki, Maks Ovsjanikov
Abstract
Deep functional maps have recently emerged as a successful paradigm for non-rigid 3D shape correspondence tasks. An essential step in this pipeline consists in learning feature functions that are used as constraints to solve for a functional map inside the network. However, the precise nature of the information learned and stored in these functions is not yet well understood. Specifically, a major question is whether these features can be used for any other objective, apart from their purely algebraic role in solving for functional map matrices. In this paper, we show that under some mild conditions, the features learned within deep functional map approaches can be used as point-wise descriptors and thus are directly comparable across different shapes, even without the necessity of solving for a functional map at test time. Furthermore, informed by our analysis, we propose effective modifications to the standard deep functional map pipeline, which promote structural properties of learned features, significantly improving the matching results. Finally, we demonstrate that previously unsuccessful attempts at using extrinsic architectures for deep functional map feature extraction can be remedied via simple architectural changes, which encourage the theoretical properties suggested by our analysis. We thus bridge the gap between intrinsic and extrinsic surface-based learning, suggesting the necessary and sufficient conditions for successful shape matching. Our code is available at https://github.com/pvnieo/clover.
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.
Cited by top-tier papers15
- Non-Rigid Shape Registration via Deep Functional Maps PriorPuhua Jiang, Mingze Sun, Ruqi HuangNeurIPS 2023 · 23 citations
- Wormhole Loss for Partial Shape MatchingAmit Bracha, Thomas Dagès, Ron KimmelNeurIPS 2024 · 20 citations
- Shape Non-rigid Kinematics (SNK): A Zero-Shot Method for Non-Rigid Shape Matching via Unsupervised Functional Map Regularized ReconstructionSouhaib Attaiki, Maks OvsjanikovNeurIPS 2023 · 19 citations
- Memory-Scalable and Simplified Functional Map LearningRobin Magnet, Maks OvsjanikovCVPR 2024 · 10 citations
- SpiderMatch: 3D Shape Matching with Global Optimality and Geometric ConsistencyPaul Roetzer, Florian BernardCVPR 2024 · 8 citations
Builds on18
- KPConv: Flexible and Deformable Convolution for Point CloudsHugues Thomas, Charles R. Qi, Jean-Emmanuel Deschaud, Beatriz Marcotegui et al.ICCV 2019 · 3,193 citations
- Rethinking Network Design and Local Geometry in Point Cloud: A Simple Residual MLP FrameworkXu Ma, Can Qin, Haoxuan You, Haoxi Ran et al.ICLR 2022 · 841 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
- Correspondence learning via linearly-invariant embeddingRiccardo Marin, Marie-Julie Rakotosaona, Simone Melzi, Maks OvsjanikovNeurIPS 2020 · 82 citations
Related papers
- Deep Geometric Functional Maps: Robust Feature Learning for Shape CorrespondenceNicolas Donati, Abhishek Sharma, Maks OvsjanikovCVPR 2020
- Unsupervised Learning of Robust Spectral Shape MatchingDongliang Cao, Paul Roetzer, Florian BernardSIGGRAPH 2023 · 45 citations
- Weakly Supervised Deep Functional Maps for Shape MatchingAbhishek Sharma, Maks OvsjanikovNeurIPS 2020 · 58 citations
- Unsupervised Contrastive Learning for Efficient and Robust Spectral Shape MatchingFeifan Luo, Hongyang ChenAAAI 2026
- DiffuMatch: Category-Agnostic Spectral Diffusion Priors for Robust Non-Rigid Shape MatchingEmery Pierson, Lei Li, Angela Dai, Maks OvsjanikovICCV 2025 · 5 citations
