Deep Geometric Functional Maps: Robust Feature Learning for Shape Correspondence

• URL: http://arxiv.org/abs/2003.14286v1
• Date: Tue, 31 Mar 2020 15:20:17 GMT
• Title: Deep Geometric Functional Maps: Robust Feature Learning for Shape Correspondence
• Authors: Nicolas Donati and Abhishek Sharma and Maks Ovsjanikov
• Abstract summary: We present a novel learning-based approach for computing correspondences between non-rigid 3D shapes. Key to our method is a feature-extraction network that learns directly from raw shape geometry.
• Score: 31.840880075039944
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a novel learning-based approach for computing correspondences between non-rigid 3D shapes. Unlike previous methods that either require extensive training data or operate on handcrafted input descriptors and thus generalize poorly across diverse datasets, our approach is both accurate and robust to changes in shape structure. Key to our method is a feature-extraction network that learns directly from raw shape geometry, combined with a novel regularized map extraction layer and loss, based on the functional map representation. We demonstrate through extensive experiments in challenging shape matching scenarios that our method can learn from less training data than existing supervised approaches and generalizes significantly better than current descriptor-based learning methods. Our source code is available at: https://github.com/LIX-shape-analysis/GeomFmaps.

Related papers

• 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)
• Unsupervised Representation Learning for Diverse Deformable Shape Collections [30.271818994854353]
  We introduce a novel learning-based method for encoding and manipulating 3D surface meshes. Our method is specifically designed to create an interpretable embedding space for deformable shape collections.
  arXiv  Detail & Related papers  (2023-10-27T13:45:30Z)
• 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)
• 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)
• Cut-and-Approximate: 3D Shape Reconstruction from Planar Cross-sections with Deep Reinforcement Learning [0.0]
  We present to the best of our knowledge the first 3D shape reconstruction network to solve this task. Our method is based on applying a Reinforcement Learning algorithm to learn how to effectively parse the shape.
  arXiv  Detail & Related papers  (2022-10-22T17:48:12Z)
• PatchRD: Detail-Preserving Shape Completion by Learning Patch Retrieval and Deformation [59.70430570779819]
  We introduce a data-driven shape completion approach that focuses on completing geometric details of missing regions of 3D shapes. Our key insight is to copy and deform patches from the partial input to complete missing regions. We leverage repeating patterns by retrieving patches from the partial input, and learn global structural priors by using a neural network to guide the retrieval and deformation steps.
  arXiv  Detail & Related papers  (2022-07-24T18:59:09Z)
• Bending Graphs: Hierarchical Shape Matching using Gated Optimal Transport [80.64516377977183]
  Shape matching has been a long-studied problem for the computer graphics and vision community. We investigate a hierarchical learning design, to which we incorporate local patch-level information and global shape-level structures. We propose a novel optimal transport solver by recurrently updating features on non-confident nodes to learn globally consistent correspondences between the shapes.
  arXiv  Detail & Related papers  (2022-02-03T11:41:46Z)
• 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)
• Deep Shells: Unsupervised Shape Correspondence with Optimal Transport [52.646396621449]
  We propose a novel unsupervised learning approach to 3D shape correspondence. We show that the proposed method significantly improves over the state-of-the-art on multiple datasets.
  arXiv  Detail & Related papers  (2020-10-28T22:24:07Z)
• Neural Subdivision [58.97214948753937]
  This paper introduces Neural Subdivision, a novel framework for data-driven coarseto-fine geometry modeling. We optimize for the same set of network weights across all local mesh patches, thus providing an architecture that is not constrained to a specific input mesh, fixed genus, or category. We demonstrate that even when trained on a single high-resolution mesh our method generates reasonable subdivisions for novel shapes.
  arXiv  Detail & Related papers  (2020-05-04T20:03:21Z)

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.