Revisiting Map Relations for Unsupervised Non-Rigid Shape Matching

• URL: http://arxiv.org/abs/2310.11420v1
• Date: Tue, 17 Oct 2023 17:28:03 GMT
• Title: Revisiting Map Relations for Unsupervised Non-Rigid Shape Matching
• Authors: Dongliang Cao, Paul Roetzer, Florian Bernard
• Abstract summary: 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.
• Score: 18.957179015912402
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose a novel unsupervised learning approach for non-rigid 3D shape matching. Our approach improves upon recent state-of-the art deep functional map methods and can be applied to a broad range of different challenging scenarios. Previous deep functional map methods mainly focus on feature extraction and aim exclusively at obtaining more expressive features for functional map computation. However, the importance of the functional map computation itself is often neglected and the relationship between the functional map and point-wise map is underexplored. In this paper, we systematically investigate the coupling relationship between the functional map from the functional map solver and the point-wise map based on feature similarity. To this end, we propose a self-adaptive functional map solver to adjust the functional map regularisation for different shape matching scenarios, together with a vertex-wise contrastive loss to obtain more discriminative features. Using different challenging datasets (including non-isometry, topological noise and partiality), we demonstrate that our method substantially outperforms previous state-of-the-art methods.

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)
• Zero-Shot Image Feature Consensus with Deep Functional Maps [20.988872402347756]
  We show that a better correspondence strategy is available, which directly imposes structure on the correspondence field: the functional map. We demonstrate that our technique yields correspondences that are not only smoother but also more accurate, with the possibility of better reflecting the knowledge embedded in the large-scale vision models that we are studying.
  arXiv  Detail & Related papers  (2024-03-18T17:59:47Z)
• 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)
• Deep Frequency-Aware Functional Maps for Robust Shape Matching [17.276162941967943]
  We propose a novel unsupervised learning-based framework called Deep Frequency-Aware Functional Maps. We first introduce a general constraint called Spectral Filter Operator Preservation to compute desirable functional maps. We then directly utilize the proposed constraint as a loss function to supervise functional maps, pointwise maps, and filter functions simultaneously.
  arXiv  Detail & Related papers  (2024-02-06T11:16:18Z)
• 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)
• Understanding and Improving Features Learned in Deep Functional Maps [31.61255365182462]
  We show that features learned within deep functional map approaches can be used as point-wise descriptors across different shapes. We propose effective modifications to the standard deep functional map pipeline, which promote structural properties of learned features.
  arXiv  Detail & Related papers  (2023-03-29T08:32:16Z)
• Neural Eigenfunctions Are Structured Representation Learners [93.53445940137618]
  This paper introduces a structured, adaptive-length deep representation called Neural Eigenmap. We show that, when the eigenfunction is derived from positive relations in a data augmentation setup, applying NeuralEF results in an objective function. We demonstrate using such representations as adaptive-length codes in image retrieval systems.
  arXiv  Detail & Related papers  (2022-10-23T07:17:55Z)
• Smooth Non-Rigid Shape Matching via Effective Dirichlet Energy Optimization [46.30376601157526]
  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.
  arXiv  Detail & Related papers  (2022-10-05T14:07:17Z)
• 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)
• CAMERAS: Enhanced Resolution And Sanity preserving Class Activation Mapping for image saliency [61.40511574314069]
  Backpropagation image saliency aims at explaining model predictions by estimating model-centric importance of individual pixels in the input. We propose CAMERAS, a technique to compute high-fidelity backpropagation saliency maps without requiring any external priors.
  arXiv  Detail & Related papers  (2021-06-20T08:20:56Z)

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.