Deformation-Guided Unsupervised Non-Rigid Shape Matching

• URL: http://arxiv.org/abs/2311.15668v1
• Date: Mon, 27 Nov 2023 09:55:55 GMT
• Title: Deformation-Guided Unsupervised Non-Rigid Shape Matching
• Authors: Aymen Merrouche, Joao Regateiro, Stefanie Wuhrer, Edmond Boyer
• Abstract summary: We present an unsupervised data-driven approach for non-rigid shape matching. Our approach is particularly robust when matching digitized shapes using 3D scanners.
• Score: 7.327850781641328
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: We present an unsupervised data-driven approach for non-rigid shape matching. Shape matching identifies correspondences between two shapes and is a fundamental step in many computer vision and graphics applications. Our approach is designed to be particularly robust when matching shapes digitized using 3D scanners that contain fine geometric detail and suffer from different types of noise including topological noise caused by the coalescence of spatially close surface regions. We build on two strategies. First, using a hierarchical patch based shape representation we match shapes consistently in a coarse to fine manner, allowing for robustness to noise. This multi-scale representation drastically reduces the dimensionality of the problem when matching at the coarsest scale, rendering unsupervised learning feasible. Second, we constrain this hierarchical matching to be reflected in 3D by fitting a patch-wise near-rigid deformation model. Using this constraint, we leverage spatial continuity at different scales to capture global shape properties, resulting in matchings that generalize well to data with different deformations and noise characteristics. Experiments demonstrate that our approach obtains significantly better results on raw 3D scans than state-of-the-art methods, while performing on-par on standard test scenarios.

Related papers

• Synchronous Diffusion for Unsupervised Smooth Non-Rigid 3D Shape Matching [15.843208029973175]
  We propose a synchronous diffusion process which we use as regularisation to achieve smoothness in non-rigid 3D shape matching problems. We demonstrate that our novel regularisation can substantially improve the state-of-the-art in shape matching, especially in the presence of topological noise.
  arXiv  Detail & Related papers  (2024-07-11T07:45:06Z)
• 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)
• Robust 3D Tracking with Quality-Aware Shape Completion [67.9748164949519]
  We propose a synthetic target representation composed of dense and complete point clouds depicting the target shape precisely by shape completion for robust 3D tracking. Specifically, we design a voxelized 3D tracking framework with shape completion, in which we propose a quality-aware shape completion mechanism to alleviate the adverse effect of noisy historical predictions.
  arXiv  Detail & Related papers  (2023-12-17T04:50:24Z)
• Geometrically Consistent Partial Shape Matching [50.29468769172704]
  Finding correspondences between 3D shapes is a crucial problem in computer vision and graphics. An often neglected but essential property of matching geometrics is consistency. We propose a novel integer linear programming partial shape matching formulation.
  arXiv  Detail & Related papers  (2023-09-10T12:21:42Z)
• 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)
• Flattening-Net: Deep Regular 2D Representation for 3D Point Cloud Analysis [66.49788145564004]
  We present an unsupervised deep neural architecture called Flattening-Net to represent irregular 3D point clouds of arbitrary geometry and topology. Our methods perform favorably against the current state-of-the-art competitors.
  arXiv  Detail & Related papers  (2022-12-17T15:05:25Z)
• Dense Non-Rigid Structure from Motion: A Manifold Viewpoint [162.88686222340962]
  Non-Rigid Structure-from-Motion (NRSfM) problem aims to recover 3D geometry of a deforming object from its 2D feature correspondences across multiple frames. We show that our approach significantly improves accuracy, scalability, and robustness against noise.
  arXiv  Detail & Related papers  (2020-06-15T09:15:54Z)
• ProAlignNet : Unsupervised Learning for Progressively Aligning Noisy Contours [12.791313859673187]
  "ProAlignNet" accounts for large scale misalignments and complex transformations between the contour shapes. It learns by training with a novel loss function which is derived an upperbound of a proximity-sensitive and local shape-dependent similarity metric. In two real-world applications, the proposed models consistently perform superior to state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-05-23T14:56:14Z)

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.