MPI Logo SIC Logo Saarland Uni Logo AIGO Logo Saarland Uni Logo Bonn Logo Lamarr Logo 4DQV Logo

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

Adeela Islam1,2,6 Zorah Lähner3,4 Vittorio Murino1,5 Vladislav Golyanik6
1Italian Institute of Technology      2University of Genoa      3University of Bonn
4Lamarr Institute      5University of Verona      6Max Planck Institute for Informatics, SIC

Key Technical Contributions

  • Mesh-Transformer Foundation: Introduces the first transformer-based foundation for 3D shape correspondence, utilising self- and cross-attention.
  • Geometry-Aware Tokenisation: Employs a novel curvature-guided, overlapping patch extraction method to efficiently process irregular mesh data.

Key Properties of TokenMatch

  • Template-Free Design
    A flexible formulation that avoids reliance on shared templates or category assumptions.
  • Masked Pre-training
    Employs self-supervised masked autoencoding, allowing robust generalisation to full shapes without retraining.
  • Fast Inference
    Operates as a single feed-forward network, achieving rapid matching in a fraction of a second.
  • Point Cloud Flexibility
    Naturally generalises beyond meshes to perform unmeshed point cloud correspondence estimation.
  • Token-Level Correspondences
    Effectively learns and aligns shape correspondences directly on the level of structural tokens.
  • Robust to Noise
    Maintains high accuracy and structural integrity even when processing heavily noisy or corrupted input data.

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.

Method Overview

Our framework diverges from standard spatial sampling by prioritising geometric distinctness. First, we compute the local curvature for every vertex. We then construct shape tokens using a geodesic farthest-point sampling weighted by curvature magnitude, ensuring that critical features like fingertips or joint creases are actively tokenised.

Network Architecture Diagram

Figure 1: Overview of our 3D mesh correspondence estimation framework. Given a pair of input meshes, we extract geometry-aware tokens and process them with a transformer encoder to obtain shape features. Cross-attention enables inter-shape interaction, and the resulting representations are used to estimate functional maps. An additional overlap prediction module identifies shared regions between shapes. The model is trained using self-supervised pretraining, functional map supervision, and geometric consistency objectives.

Tokenisation Process

The process begins with a triangular input mesh representing a human body pose, upon which a spectral signal is computed and visualised as a heatmap. Next, points on the mesh are sampled to serve as token centers using a curvature-weighted Farthest Point Sampling (FPS) algorithm. Around these sampled centers, soft, overlapping regions with an influence radius $\sigma$ are established, and the mesh vertices are then softly assigned to these local token regions. Ultimately, the final tokens are represented by their centers as a discrete set for the given shape. A detailed visual key for each component is provided at the bottom of the figure.

Masked Autoencoding Pretraining

This figure visualises the Masked Autoencoding Pretraining on 3D human pose models. It starts with a solid 3D human pose provided as the input shape, which is then decomposed into colorful overlapping patches, or shape tokens. After extracting their centers, a large portion of these tokens is masked, and the resulting partially visible shape is passed through an encoder-decoder ($\mathcal{E}|\mathcal{D}$) network architecture. The network generates a partial reconstruction of the shape from the unmasked patches. Finally, to train the network, a Feature Loss ($\mathcal{L}_{feat}$) and a Chamfer Loss ($\mathcal{L}_{CD}$) are computed by comparing the partial reconstruction against the original full shape and its features.

Ablations & Explorations

Tokenisation design exploration: We compare alternative mesh tokenisation strategies to highlight the trade-offs between global structure, locality, and spatial continuity, ultimately motivating our curvature-guided approach. Click any figure below to expand it.

Curvature-Guided Tokenisation
Spectral Clustering
Heat Kernel Signature
Face-based Splitting
Voronoi Partitioning
Point Cloud Tokenisation

Quantitative Results

Mean IoU (×100) on different partial-to-partial shape matching datasets: CP2P, PSMAL, and BeCoS. Prior methods rely on predefined descriptors (XYZ or DINOv2), while our approach learns features directly from mesh geometry. Best results are shown in bold.

Method Feature Type CP2P24 ↑ PSMAL ↑ BeCoS ↑
SM-COMBXYZ57.8654.7647.04
DINOv238.3836.6148.29
GC-PPSMXYZ69.2964.3449.34
DINOv249.6634.3033.14
DPFMXYZ63.8667.0448.18
DINOv274.1573.6751.02
EchoMatchXYZ80.1072.7152.40
DINOv284.7284.7564.68
Ours Learned (mesh) 85.56 85.21 65.25

Mean geodesic error (×100) on FAUST, SCAPE, and SHREC’19. Best results are shown in bold.

Method FAUST ↓ SCAPE ↓ SHREC’19 ↓
3D-CODED2.5016.1017.30
TransMatch1.7015.3021.00
DUO-FMNet2.504.206.40
GeomFMaps1.902.407.90
AttentiveFMaps1.902.605.80
ConsistentFMaps2.302.603.80
SSL2.003.104.00
DiffZO1.902.404.20
ULRSSM1.602.205.70
SmS1.403.306.20
DenoisFM1.702.103.90
Ours 1.72 2.09 3.45

Comparison of different tokenisation strategies and feature representations. We evaluate classical baselines and our proposed mesh-based tokenisation variants under multiple geometric feature encodings on CP2P24, PSMAL, and BeCoS benchmarks. Best results are shown in bold.

Method Tokenisation Type Feature Type CP2P24 ↑ PSMAL ↑ BeCoS ↑
Ours Curvature-guided (overlapping) Learned (mesh) 85.56 85.21 65.25
Ours Spectral Laplacian Learned (mesh) 76.23 75.81 50.15
Ours HKS clustering Learned (mesh) 75.01 74.65 49.02
Ours Hierarchical Subdivision Learned (mesh) 75.62 75.21 51.23
Ours Curvature-guided (overlapping) Learned (point cloud) 81.05 80.12 59.55

Qualitative Results

Visualising texture transfer between highly non-rigid shape pairs using our predicted dense correspondences.

Partial to Partial Results

Notably, the full-full setting shows that the model trained exclusively on partial-partial data also generalises well to full shapes.

Generalisation Results

Notably, the partial-full setting shows that the model trained exclusively on partial-partial data also generalises well to partial-full shapes.

Generalisation Results

Use the left and right arrows to cycle through additional qualitative comparisons.

Interactive Result 1

Robustness on Noisy Meshes of BeCoS.

Interactive Result 2

Robustness on Noisy Meshes of BeCoS.

Interactive Result 3

Robustness on Noisy Meshes of BeCoS.

Generalisation Results

Dataset

This project extensively evaluates robustness using the BeCoS dataset. For more details on the dataset, its construction, and to access the data, please refer to the official website:

Explore the BeCoS Dataset

BibTeX

@article{islam2026tokenmatch,
  title     = {TokenMatch: 3D Mesh Correspondence Transformer with Curvature-Guided Tokenisation},
  author    = {Islam, Adeela and Lähner, Zorah and Murino, Vittorio and Golyanik, Vladislav},
  journal   = {arXiv preprint},
  year      = {2026}
}