On Partial Shape Correspondence and Functional Maps
- URL: http://arxiv.org/abs/2310.14692v2
- Date: Mon, 13 May 2024 18:49:39 GMT
- Title: On Partial Shape Correspondence and Functional Maps
- Authors: Amit Bracha, Thomas Dagès, Ron Kimmel,
- Abstract summary: We argue that functional maps introduce errors in the estimated match when partiality is invoked.
We propose a novel approach for partial shape matching.
The proposed approach shows superior performance on the SHREC'16 dataset.
- Score: 9.175560202201819
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: While dealing with matching shapes to their parts, we often apply a tool known as functional maps. The idea is to translate the shape matching problem into ``convenient'' spaces by which matching is performed algebraically by solving a least squares problem. Here, we argue that such formulations, though popular in this field, introduce errors in the estimated match when partiality is invoked. Such errors are unavoidable even for advanced feature extraction networks, and they can be shown to escalate with increasing degrees of shape partiality, adversely affecting the learning capability of such systems. To circumvent these limitations, we propose a novel approach for partial shape matching. Our study of functional maps led us to a novel method that establishes direct correspondence between partial and full shapes through feature matching bypassing the need for functional map intermediate spaces. The Gromov distance between metric spaces leads to the construction of the first part of our loss functions. For regularization we use two options: a term based on the area preserving property of the mapping, and a relaxed version that avoids the need to resort to functional maps. The proposed approach shows superior performance on the SHREC'16 dataset, outperforming existing unsupervised methods for partial shape matching. Notably, it achieves state-of-the-art results on the SHREC'16 HOLES benchmark, superior also compared to supervised methods. We demonstrate the benefits of the proposed unsupervised method when applied to a new dataset PFAUST for part-to-full shape correspondence
Related papers
- Memory-Scalable and Simplified Functional Map Learning [32.088809326158554]
We introduce a novel memory-scalable and efficient functional map learning pipeline.
By leveraging the structure of functional maps, we offer the possibility to achieve identical results without ever storing the pointwise map in memory.
Unlike many functional map learning methods, which use this algorithm at a post-processing step, ours can be easily used at train time.
arXiv Detail & Related papers (2024-03-30T12:01:04Z) - Spectral Meets Spatial: Harmonising 3D Shape Matching and Interpolation [50.376243444909136]
We present a unified framework to predict both point-wise correspondences and shape between 3D shapes.
We combine the deep functional map framework with classical surface deformation models to map shapes in both spectral and spatial domains.
arXiv Detail & Related papers (2024-02-29T07:26:23Z) - Revisiting Map Relations for Unsupervised Non-Rigid Shape Matching [18.957179015912402]
We propose a novel unsupervised learning approach for non-rigid 3D shape matching.
We show that our method substantially outperforms previous state-of-the-art methods.
arXiv Detail & Related papers (2023-10-17T17:28:03Z) - Neural Semantic Surface Maps [52.61017226479506]
We present an automated technique for computing a map between two genus-zero shapes, which matches semantically corresponding regions to one another.
Our approach can generate semantic surface-to-surface maps, eliminating manual annotations or any 3D training data requirement.
arXiv Detail & Related papers (2023-09-09T16:21:56Z) - Zero-Shot 3D Shape Correspondence [67.18775201037732]
We propose a novel zero-shot approach to computing correspondences between 3D shapes.
We exploit the exceptional reasoning capabilities of recent foundation models in language and vision.
Our approach produces highly plausible results in a zero-shot manner, especially between strongly non-isometric shapes.
arXiv Detail & Related papers (2023-06-05T21:14:23Z) - Unsupervised Learning of Robust Spectral Shape Matching [12.740151710302397]
We propose a novel learning-based approach for robust 3D shape matching.
Our method builds upon deep functional maps and can be trained in a fully unsupervised manner.
arXiv Detail & Related papers (2023-04-27T02:12:47Z) - Learning Implicit Feature Alignment Function for Semantic Segmentation [51.36809814890326]
Implicit Feature Alignment function (IFA) is inspired by the rapidly expanding topic of implicit neural representations.
We show that IFA implicitly aligns the feature maps at different levels and is capable of producing segmentation maps in arbitrary resolutions.
Our method can be combined with improvement on various architectures, and it achieves state-of-the-art accuracy trade-off on common benchmarks.
arXiv Detail & Related papers (2022-06-17T09:40:14Z) - Multiway Non-rigid Point Cloud Registration via Learned Functional Map
Synchronization [105.14877281665011]
We present SyNoRiM, a novel way to register multiple non-rigid shapes by synchronizing the maps relating learned functions defined on the point clouds.
We demonstrate via extensive experiments that our method achieves a state-of-the-art performance in registration accuracy.
arXiv Detail & Related papers (2021-11-25T02:37:59Z) - DPFM: Deep Partial Functional Maps [28.045544079256686]
We consider the problem of computing dense correspondences between non-rigid shapes with potentially significant partiality.
We propose the first learning method aimed directly at partial non-rigid shape correspondence.
Our approach uses the functional map framework, can be trained in a supervised or unsupervised manner, and learns descriptors directly from the data.
arXiv Detail & Related papers (2021-10-19T14:05:37Z) - Making Affine Correspondences Work in Camera Geometry Computation [62.7633180470428]
Local features provide region-to-region rather than point-to-point correspondences.
We propose guidelines for effective use of region-to-region matches in the course of a full model estimation pipeline.
Experiments show that affine solvers can achieve accuracy comparable to point-based solvers at faster run-times.
arXiv Detail & Related papers (2020-07-20T12:07:48Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.