Smooth Non-Rigid Shape Matching via Effective Dirichlet Energy Optimization

• URL: http://arxiv.org/abs/2210.02870v1
• Date: Wed, 5 Oct 2022 14:07:17 GMT
• Title: Smooth Non-Rigid Shape Matching via Effective Dirichlet Energy Optimization
• Authors: Robin Magnet, Jing Ren, Olga Sorkine-Hornung, Maks Ovsjanikov
• Abstract summary: We introduce pointwise map smoothness via the Dirichlet energy into the functional map pipeline. We propose an algorithm for optimizing it efficiently, which leads to high-quality results in challenging settings.
• Score: 46.30376601157526
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce pointwise map smoothness via the Dirichlet energy into the functional map pipeline, and propose an algorithm for optimizing it efficiently, which leads to high-quality results in challenging settings. Specifically, we first formulate the Dirichlet energy of the pulled-back shape coordinates, as a way to evaluate smoothness of a pointwise map across discrete surfaces. We then extend the recently proposed discrete solver and show how a strategy based on auxiliary variable reformulation allows us to optimize pointwise map smoothness alongside desirable functional map properties such as bijectivity. This leads to an efficient map refinement strategy that simultaneously improves functional and point-to-point correspondences, obtaining smooth maps even on non-isometric shape pairs. Moreover, we demonstrate that several previously proposed methods for computing smooth maps can be reformulated as variants of our approach, which allows us to compare different formulations in a consistent framework. Finally, we compare these methods both on existing benchmarks and on a new rich dataset that we introduce, which contains non-rigid, non-isometric shape pairs with inter-category and cross-category correspondences. Our work leads to a general framework for optimizing and analyzing map smoothness both conceptually and in challenging practical settings.

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)
• Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and Optimal Algorithms [64.10576998630981]
  We show the first tight characterization of the optimal Hessian-dependent sample complexity. A Hessian-independent algorithm universally achieves the optimal sample complexities for all Hessian instances. The optimal sample complexities achieved by our algorithm remain valid for heavy-tailed noise distributions.
  arXiv  Detail & Related papers  (2023-06-21T17:03:22Z)
• 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)
• Linearization Algorithms for Fully Composite Optimization [61.20539085730636]
  This paper studies first-order algorithms for solving fully composite optimization problems convex compact sets. We leverage the structure of the objective by handling differentiable and non-differentiable separately, linearizing only the smooth parts.
  arXiv  Detail & Related papers  (2023-02-24T18:41:48Z)
• Non-Isometric Shape Matching via Functional Maps on Landmark-Adapted Bases [27.403848280099027]
  We propose a principled approach for non-isometric landmark-preserving non-rigid shape matching. We focus instead on near-conformal maps that preserve landmarks exactly. Our method is descriptor-free, efficient and robust to significant variability mesh.
  arXiv  Detail & Related papers  (2022-05-10T11:02: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)
• Temporally-Consistent Surface Reconstruction using Metrically-Consistent Atlases [131.50372468579067]
  We propose a method for unsupervised reconstruction of a temporally-consistent sequence of surfaces from a sequence of time-evolving point clouds. We represent the reconstructed surfaces as atlases computed by a neural network, which enables us to establish correspondences between frames. Our approach outperforms state-of-the-art ones on several challenging datasets.
  arXiv  Detail & Related papers  (2021-11-12T17:48:25Z)

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.