Spatially and Spectrally Consistent Deep Functional Maps

• URL: http://arxiv.org/abs/2308.08871v2
• Date: Tue, 5 Sep 2023 03:21:26 GMT
• Title: Spatially and Spectrally Consistent Deep Functional Maps
• Authors: Mingze Sun and Shiwei Mao and Puhua Jiang and Maks Ovsjanikov and Ruqi Huang
• Abstract summary: Cycle consistency has long been exploited as a powerful prior for jointly optimizing maps within a collection of shapes. In this paper, we investigate its utility in the approaches of Deep Functional Maps, which are considered state-of-the-art in non-rigid shape matching. We present a novel design of unsupervised Deep Functional Maps, which effectively enforces the harmony of learned maps under the spectral and the point-wise representation.
• Score: 26.203493922746546
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Cycle consistency has long been exploited as a powerful prior for jointly optimizing maps within a collection of shapes. In this paper, we investigate its utility in the approaches of Deep Functional Maps, which are considered state-of-the-art in non-rigid shape matching. We first justify that under certain conditions, the learned maps, when represented in the spectral domain, are already cycle consistent. Furthermore, we identify the discrepancy that spectrally consistent maps are not necessarily spatially, or point-wise, consistent. In light of this, we present a novel design of unsupervised Deep Functional Maps, which effectively enforces the harmony of learned maps under the spectral and the point-wise representation. By taking advantage of cycle consistency, our framework produces state-of-the-art results in mapping shapes even under significant distortions. Beyond that, by independently estimating maps in both spectral and spatial domains, our method naturally alleviates over-fitting in network training, yielding superior generalization performance and accuracy within an array of challenging tests for both near-isometric and non-isometric datasets. Codes are available at https://github.com/rqhuang88/Spatiallyand-Spectrally-Consistent-Deep-Functional-Maps.

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)
• 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)
• Hi-Map: Hierarchical Factorized Radiance Field for High-Fidelity Monocular Dense Mapping [51.739466714312805]
  We introduce Hi-Map, a novel monocular dense mapping approach based on Neural Radiance Field (NeRF) Hi-Map is exceptional in its capacity to achieve efficient and high-fidelity mapping using only posed RGB inputs.
  arXiv  Detail & Related papers  (2024-01-06T12:32:25Z)
• 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)
• 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)
• 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)
• ICON: Learning Regular Maps Through Inverse Consistency [19.27928605302463]
  We explore what induces regularity for spatial transformations, e.g., when computing image registrations. We find that deep networks combined with an inverse consistency loss and randomized off-grid yield well behaved, approximately diffeomorphic, spatial transformations. Despite the simplicity of this approach, our experiments present compelling evidence, on both synthetic and real data, that regular maps can be obtained without carefully tuned explicit regularizers and competitive registration performance.
  arXiv  Detail & Related papers  (2021-05-10T15:52:12Z)
• Efficient Depth Completion Using Learned Bases [94.0808155168311]
  We propose a new global geometry constraint for depth completion. By assuming depth maps often lay on low dimensional subspaces, a dense depth map can be approximated by a weighted sum of full-resolution principal depth bases.
  arXiv  Detail & Related papers  (2020-12-02T11:57:37Z)
• Deep Structured Prediction for Facial Landmark Detection [59.60946775628646]
  This paper proposes a method for deep structured facial landmark detection based on combining a deep Convolutional Network with a Conditional Random Field. We demonstrate its superior performance to existing state-of-the-art techniques in facial landmark detection.
  arXiv  Detail & Related papers  (2020-10-18T17:09:24Z)

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.