Extracting a functional representation from a dictionary for non-rigid shape matching
Not on the map. Why?
Abstract (arXiv)
Shape matching is a fundamental problem in computer graphics with many applications. Functional maps translate the point-wise shape-matching problem into its functional counterpart and have inspired numerous solutions over the last decade. Nearly all the solutions based on functional maps rely on the eigenfunctions of the Laplace-Beltrami Operator (LB) to describe the functional spaces defined on the surfaces and then convert the functional correspondences into point-wise correspondences. However, this final step is often error-prone and inaccurate in tiny regions and protrusions, where the energy of LB does not uniformly cover the surface. We propose a new functional basis Principal Components of a Dictionary (PCD) to address such intrinsic limitation. PCD constructs an orthonormal basis from the Principal Component Analysis (PCA) of a dictionary of functions defined over the shape. These dictionaries can target specific properties of the final basis, such as achieving an even spreading of energy. Our experimental evaluation compares seven different dictionaries on established benchmarks, showing that PCD is suited to target different shape-matching scenarios, resulting in more accurate point-wise maps than the LB basis when used in the same pipeline. This evidence provides a promising alternative for improving correspondence estimation, confirming the power and flexibility of functional maps.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 13 of its 49 references that are in the map. First posted on arXiv 17 May 2023.
Builds on
13 of 49 references.
References · 13
- 2017Deep Functional Maps: Structured Prediction for Dense Shape Correspondencecited by 134
- 2020Deep Geometric Functional Maps: Robust Feature Learning for Shape Correspondencecited by 125
- 2018Continuous and Orientation-preserving Correspondences via Functional Mapscited by 77
- 2020Correspondence Learning via Linearly-invariant Embeddingcited by 48
- 2019ZoomOut: Spectral Upsampling for Efficient Shape Correspondencecited by 30
- 2020Structured Regularization of Functional Map Computationscited by 26
- 2021Complex Functional Maps : a Conformal Link Between Tangent Bundlescited by 17
- 2014On the optimality of shape and data representation in the spectral domaincited by 14
- 2017Localized Manifold Harmonics for Spectral Shape Analysiscited by 12
- 2020MapTree: Recovering Multiple Solutions in the Space of Mapscited by 11
- 2015Point-wise Map Recovery and Refinement from Functional Correspondencecited by 10
- 2020Wavelet-based Heat Kernel Derivatives: Towards Informative Localized Shape Analysiscited by 8
1 more
Built on by
Not cited yet.