English

SIGMA: Scale-Invariant Global Sparse Shape Matching

Computer Vision and Pattern Recognition 2024-04-04 v2

Abstract

We propose a novel mixed-integer programming (MIP) formulation for generating precise sparse correspondences for highly non-rigid shapes. To this end, we introduce a projected Laplace-Beltrami operator (PLBO) which combines intrinsic and extrinsic geometric information to measure the deformation quality induced by predicted correspondences. We integrate the PLBO, together with an orientation-aware regulariser, into a novel MIP formulation that can be solved to global optimality for many practical problems. In contrast to previous methods, our approach is provably invariant to rigid transformations and global scaling, initialisation-free, has optimality guarantees, and scales to high resolution meshes with (empirically observed) linear time. We show state-of-the-art results for sparse non-rigid matching on several challenging 3D datasets, including data with inconsistent meshing, as well as applications in mesh-to-point-cloud matching.

Keywords

Cite

@article{arxiv.2308.08393,
  title  = {SIGMA: Scale-Invariant Global Sparse Shape Matching},
  author = {Maolin Gao and Paul Roetzer and Marvin Eisenberger and Zorah Lähner and Michael Moeller and Daniel Cremers and Florian Bernard},
  journal= {arXiv preprint arXiv:2308.08393},
  year   = {2024}
}

Comments

14 pages

R2 v1 2026-06-28T11:57:05.314Z