mlsanityData to 14 Oct 2026

MeshLoom: Feed-Forward Non-Rigid Registration of Mesh Sequences

arXiv 2606.17027 ↗First posted 15 Jun 2026cs.CVcited by 1

Not on the map. Why?

Abstract (arXiv)

We present MeshLoom, a feed-forward registration network that directly reconstructs vertex deformations across mesh sequences. Our approach advances non-rigid registration beyond existing models, which are typically constrained by costly per-instance optimization, narrow object categories, pairwise-only inputs, or merely intermediate outputs. The network is simple and efficient, registering multiple meshes within seconds. At its core lies a topology-aware encoder--decoder design. Specifically, we first introduce a topology-aware point representation that encodes the anchor (reference) mesh's topology into its per-vertex features. This representation strengthens the network's understanding of the anchor-mesh geometry and disambiguates points that are Euclidean-close yet geodesically distant. We then propose a multi-modal encoder that fuses this anchor-mesh representation with complementary cues from each frame, such as shape latents and image features. These multi-source signals are compressed into a compact global motion embedding that captures dense inter-frame correspondence. A lightweight decoder then queries this global embedding with the anchor-mesh point representation, retrieving per-vertex deformations at target timestamps. Through extensive experiments across diverse motions and object categories, we show that MeshLoom achieves state-of-the-art results on non-rigid registration. In addition, we find that our global embedding-then-query paradigm naturally enables the network to generate deformations at intermediate timestamps, which extends MeshLoom to motion interpolation and mesh morphing. Project page: https://meshloom.github.io/ .

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 24 of its 51 references that are in the map. First posted on arXiv 15 Jun 2026.

Builds on

24 of 51 references.

References · 24

  1. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  3. 2018The Unreasonable Effectiveness of Deep Features as a Perceptual Metriccited by 11,177
  4. 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,703
  5. 2017FiLM: Visual Reasoning with a General Conditioning Layercited by 2,333
  6. 2025DINOv3cited by 1,414
  7. 20233DShape2VecSet: A 3D Shape Representation for Neural Fields and Generative Diffusion Modelscited by 458
  8. 2025Hunyuan3D 2.0: Scaling Diffusion Models for High Resolution Textured 3D Assets Generationcited by 356
  9. 20183D-CODED : 3D Correspondences by Deep Deformationcited by 160
  10. 2022A Survey of Non-Rigid 3D Registrationcited by 59
  11. 2021Shape registration in the time of transformerscited by 51
  12. 2025TexVerse: A Universe of 3D Objects with High-Resolution Texturescited by 45
12 more
  1. 2022Non-rigid Point Cloud Registration with Neural Deformation Pyramidcited by 42
  2. 2025V2M4: 4D Mesh Animation Reconstruction from a Single Monocular Videocited by 33
  3. 2023Spatially and Spectrally Consistent Deep Functional Mapscited by 30
  4. 2018FARM: Functional Automatic Registration Method for 3D Human Bodiescited by 26
  5. 2024Spectral Meets Spatial: Harmonising 3D Shape Matching and Interpolationcited by 26
  6. 2023NICP: Neural ICP for 3D Human Registration at Scalecited by 21
  7. 2023Non-Rigid Shape Registration via Deep Functional Maps Priorcited by 12
  8. 2024Deformation Recovery: Localized Learning for Detail-Preserving Deformationscited by 11
  9. 2024Correspondence-Free Non-Rigid Point Set Registration Using Unsupervised Clustering Analysiscited by 10
  10. 2022Reduced Representation of Deformation Fields for Effective Non-rigid Shape Matchingcited by 8
  11. 2025Occlusion-aware Non-Rigid Point Cloud Registration via Unsupervised Neural Deformation Correntropycited by 4
  12. 2026RINO: Rotation-Invariant Non-Rigid Correspondencescited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.