TokenMatch: 3D Mesh Correspondence Transformer with Curvature-Guided Tokenisation

• URL: http://arxiv.org/abs/2609.04202v1
• Date: Thu, 03 Sep 2026 17:59:55 GMT
• Title: TokenMatch: 3D Mesh Correspondence Transformer with Curvature-Guided Tokenisation
• Abstract summary: TokenMatch is a new transformer-based unified model for estimating 3D shape correspondences.<n>Our feed-forward approach trained exclusively on BeCoS, a challenging non-isometric partial-to-partial shape-matching dataset, can generalise to matching full shapes without retraining or fine-tuning.<n>We evaluate TokenMatch on standard benchmarks for partial and full shape matching, including CP2P, PSMAL, BeCoS, FAUST, SCAPE, and SHREC'19.
• Score: 39.05672576418673
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: While data-driven 3D shape correspondence estimation has recently seen substantial progress, robust matching under partial observations and strong non-isometric deformations remains challenging. Existing learning-based approaches often rely on hand-crafted descriptors or template-based representations, whereas recent generative models over functional maps suffer from high inference cost, limited interpretability, and poor generalisation to partial shapes. In response to these limitations, this paper introduces TokenMatch, a new transformer-based unified model for estimating 3D shape correspondences. Our feed-forward approach trained exclusively on BeCoS, a challenging non-isometric partial-to-partial shape-matching dataset, can generalise to matching full shapes without retraining or fine-tuning. TokenMatch uses self- and cross-attention mechanisms to efficiently learn patch-level and point-level relations as well as dense correspondences between shape pairs. Our core insight is that meshes can be adaptively tokenised into patches using shape curvature guidance, enabling effective learning of shape-specific geometric descriptors for correspondence estimation. We evaluate TokenMatch on standard benchmarks for partial and full shape matching, including CP2P, PSMAL, BeCoS, FAUST, SCAPE, and SHREC'19. Our method achieves consistently high performance, in most cases outperforming existing methods for partial and full shape matching in the mean geodesic error and intersection-over-union metrics, while also running faster at sub-second inference speeds.

Related papers

• An Integer Linear Programming Approach to Geometrically Consistent Partial-Partial Shape Matching [69.56116761337786]
  We introduce the first integer linear programming approach specifically designed to address the challenges of partial-partial shape matching.<n>Our approach achieves high-quality matching results both in terms of matching error and smoothness.
  arXiv  Detail & Related papers  (2026-02-06T10:34:52Z)
• Matching Shapes Under Different Topologies: A Topology-Adaptive Deformation Guided Approach [6.851721795186258]
  Non-rigid 3D mesh matching is a critical step in computer vision and computer graphics pipelines.<n>We tackle matching meshes that contain topological artefacts which can break the assumption made by current approaches.<n>We are motivated by real-world scenarios such as per-frame multi-view reconstructions, often suffering from topological artefacts.<n>We show that, while not relying on any data-driven prior, our approach applies to highly non-isometric shapes and shapes with topological artefacts, including noisy per-frame multi-view reconstructions, even outperforming methods trained on large datasets in 3D alignment quality.
  arXiv  Detail & Related papers  (2025-09-08T16:29:44Z)
• NFR: Neural Feature-Guided Non-Rigid Shape Registration [1.5677990844097902]
  Our key insight is to incorporate neural features learned by deep learning-based shape matching networks into an iterative, geometric shape registration pipeline.<n>Our pipeline achieves state-of-the-art results on several benchmarks of non-rigid point cloud matching and partial shape matching.
  arXiv  Detail & Related papers  (2025-05-28T15:08:49Z)
• Efficient Autoregressive Shape Generation via Octree-Based Adaptive Tokenization [68.07464514094299]
  Existing methods encode all shapes into a fixed-size token, disregarding the inherent variations in scale and complexity across 3D data.<n>We introduce Octree-based Adaptive Tokenization, a novel framework that adjusts the dimension of latent representations according to shape complexity.<n>Our approach reduces token counts by 50% compared to fixed-size methods while maintaining comparable visual quality.
  arXiv  Detail & Related papers  (2025-04-03T17:57:52Z)
• 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)
• Deformation-Guided Unsupervised Non-Rigid Shape Matching [7.327850781641328]
  We present an unsupervised data-driven approach for non-rigid shape matching. Our approach is particularly robust when matching digitized shapes using 3D scanners.
  arXiv  Detail & Related papers  (2023-11-27T09:55:55Z)
• Non-Rigid Shape Registration via Deep Functional Maps Prior [1.9249120068573227]
  We propose a learning-based framework for non-rigid shape registration without correspondence supervision. We deform source mesh towards the target point cloud, guided by correspondences induced by high-dimensional embeddings. Our pipeline achieves state-of-the-art results on several benchmarks of non-rigid point cloud matching.
  arXiv  Detail & Related papers  (2023-11-08T06:52:57Z)
• G-MSM: Unsupervised Multi-Shape Matching with Graph-based Affinity Priors [52.646396621449]
  G-MSM is a novel unsupervised learning approach for non-rigid shape correspondence. We construct an affinity graph on a given set of training shapes in a self-supervised manner. We demonstrate state-of-the-art performance on several recent shape correspondence benchmarks.
  arXiv  Detail & Related papers  (2022-12-06T12:09:24Z)
• 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)
• Learning Canonical Embedding for Non-rigid Shape Matching [36.85782408336389]
  This paper provides a novel framework that learns canonical embeddings for non-rigid shape matching. Our framework is trained end-to-end and thus avoids instabilities and constraints associated with the commonly-used Laplace-Beltrami basis.
  arXiv  Detail & Related papers  (2021-10-06T18:09:13Z)

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.