Coarse-to-Fine: A Hybrid Self-Supervised Method for Non-rigid 3D Shape Matching

• URL: http://arxiv.org/abs/2606.26557v2
• Date: Fri, 26 Jun 2026 07:02:22 GMT
• Title: Coarse-to-Fine: A Hybrid Self-Supervised Method for Non-rigid 3D Shape Matching
• Abstract summary: Non-rigid 3D shape matching is a fundamental task in computer vision and graphics.<n>We propose a hybrid self-supervised method based on a coarse-to-fine strategy.<n>Our approach achieves state-of-the-art performance across a variety of challenging scenarios.
• Score: 33.83928014984301
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Non-rigid 3D shape matching is a fundamental task in computer vision and graphics. In this paper, we propose a hybrid self-supervised method based on a coarse-to-fine strategy, which ensures consistency between the coarse mapping and the refined correspondence produced by our refinement module. The architecture features a dual-branch design, consisting of two symmetric functional map learning streams: one based on the Laplacian basis and the other utilizing the elastic basis. Extensive experiments show that our approach not only maintains computational efficiency, but also achieves state-of-the-art performance across a variety of challenging scenarios, including non-isometric deformations and topological noise. Finally, we rigorously demonstrate that contrastive energies promote feature discrimination. Furthermore, integrating these energies with existing methods yields consistent improvements, validating the overall efficacy of our approach. Our code is available at https://github.com/LuoFeifan77/Coarse-to-Fine-Hybrid-Self-Supervised-Matching.

Related papers

• Unsupervised Contrastive Learning for Efficient and Robust Spectral Shape Matching [35.320288409500314]
  Estimating correspondences between pairs of non-rigid deformable 3D shapes remains a significant challenge in computer vision and graphics.<n>We introduce, for the first time, a novel unsupervised contrastive learning-based approach for efficient and robust 3D shape matching.
  arXiv  Detail & Related papers  (2026-03-19T14:02:12Z)
• CSMCIR: CoT-Enhanced Symmetric Alignment with Memory Bank for Composed Image Retrieval [54.15776146365823]
  Composed Image Retrieval (CIR) enables users to search for target images using both a reference image and manipulation text.<n>We propose CSMCIR, a unified representation framework that achieves efficient query-target alignment through three synergistic components.
  arXiv  Detail & Related papers  (2026-01-07T09:21:38Z)
• Hephaestus: Mixture Generative Modeling with Energy Guidance for Large-scale QoS Degradation [44.97875113025023]
  We study the Quality of Service Degradation (QoSD) problem, in which an adversary perturbs edge weights to degrade network performance.<n>No prior model directly tackles the RefineD problem under nonlinear edge-weight functions.<n>This work proposes PIMMA, a self-reinforcing framework that synthesizes feasible solutions in latent space.
  arXiv  Detail & Related papers  (2025-10-19T22:48:35Z)
• 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)
• Hybrid Functional Maps for Crease-Aware Non-Isometric Shape Matching [42.0728900164228]
  We propose a novel approach of combining the non-orthogonal extrinsic basis of eigenfunctions of the elastic thin-shell hessian with the intrinsic ones of the Laplace-Beltrami operator (LBO) eigenmodes. We show extensive evaluations across various supervised and unsupervised settings and demonstrate significant improvements.
  arXiv  Detail & Related papers  (2023-12-06T18:41:01Z)
• DiscoMatch: Fast Discrete Optimisation for Geometrically Consistent 3D Shape Matching [32.896242822749834]
  We propose to combine the advantages of learningbased and formalisms for 3D shape matching.<n>Our solver is massively parallelisable powered by a quasi-Newton method.
  arXiv  Detail & Related papers  (2023-10-12T11:23:07Z)
• Dynamic Kernel-Based Adaptive Spatial Aggregation for Learned Image Compression [63.56922682378755]
  We focus on extending spatial aggregation capability and propose a dynamic kernel-based transform coding. The proposed adaptive aggregation generates kernel offsets to capture valid information in the content-conditioned range to help transform. Experimental results demonstrate that our method achieves superior rate-distortion performance on three benchmarks compared to the state-of-the-art learning-based methods.
  arXiv  Detail & Related papers  (2023-08-17T01:34:51Z)
• Uncertainty Guided Adaptive Warping for Robust and Efficient Stereo Matching [77.133400999703]
  Correlation based stereo matching has achieved outstanding performance. Current methods with a fixed model do not work uniformly well across various datasets. This paper proposes a new perspective to dynamically calculate correlation for robust stereo matching.
  arXiv  Detail & Related papers  (2023-07-26T09:47:37Z)
• ECO-TR: Efficient Correspondences Finding Via Coarse-to-Fine Refinement [80.94378602238432]
  We propose an efficient structure named Correspondence Efficient Transformer (ECO-TR) by finding correspondences in a coarse-to-fine manner. To achieve this, multiple transformer blocks are stage-wisely connected to gradually refine the predicted coordinates. Experiments on various sparse and dense matching tasks demonstrate the superiority of our method in both efficiency and effectiveness against existing state-of-the-arts.
  arXiv  Detail & Related papers  (2022-09-25T13:05:33Z)
• A Model for Multi-View Residual Covariances based on Perspective Deformation [88.21738020902411]
  We derive a model for the covariance of the visual residuals in multi-view SfM, odometry and SLAM setups. We validate our model with synthetic and real data and integrate it into photometric and feature-based Bundle Adjustment.
  arXiv  Detail & Related papers  (2022-02-01T21:21:56Z)
• 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)

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.