SIGMA: Scale-Invariant Global Sparse Shape Matching
Maolin Gao, Paul Roetzer, Marvin Eisenberger, Zorah Lähner, Michael Moeller, Daniel Cremers, Florian Bernard
TL;DR
SIGMA tackles sparse non-rigid shape matching by formulating a global mixed-integer program that is invariant to rigid motions and global scaling. It introduces the projected Laplace-Beltrami operator ($\Delta^{(\mathcal{X})}_{\mathrm{proj}}$) that blends intrinsic geometry with extrinsic coordinates, enabling a deformation prior that avoids oversmoothing. The final objective combines a reconstruction term, a PLBO-based deformation term, and an orientation-aware term over a permutation matrix $\mathbf{P}$, yielding provable invariances and often global optimality within a 1-hour budget. Empirically, SIGMA achieves state-of-the-art performance on isometric and non-isometric benchmarks, including mesh-to-point-cloud matching, and scales favorably with mesh resolution, demonstrating robust applicability to challenging 3D geometry problems.
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.
