One Point Isometric Matching with the Heat Kernel

A common operation in many geometry processing algorithms consists of finding correspondences between pairs of shapes by finding structure‐preserving maps between them. A particularly useful case of such maps is isometries, which preserve geodesic distances between points on each shape. Although several algorithms have been proposed to find approximately isometric maps between a pair of shapes, the structure of the space of isometries is not well understood. In this paper, we show that under mild genericity conditions, a single correspondence can be used to recover an isometry defined on entire shapes, and thus the space of all isometries can be parameterized by one correspondence between a pair of points. Perhaps surprisingly, this result is general, and does not depend on the dimensionality or the genus, and is valid for compact manifolds in any dimension. Moreover, we show that both the initial correspondence and the isometry can be recovered efficiently in practice. This allows us to devise an algorithm to find intrinsic symmetries of shapes, match shapes undergoing isometric deformations, as well as match partial and incomplete models efficiently.

[1]  H. Urakawa,et al.  GENERIC PROPERTIES OF THE EIGENVALUE OF THE LAPLACIAN FOR COMPACT RIEMANNIAN MANIFOLDS , 1983 .

[2]  P. Bérard,et al.  Embedding Riemannian manifolds by their heat kernel , 1994 .

[3]  Akshay K. Singh,et al.  Deformable models in medical image analysis , 1996, Proceedings of the Workshop on Mathematical Methods in Biomedical Image Analysis.

[4]  Haim J. Wolfson,et al.  Geometric hashing: an overview , 1997 .

[5]  Sunil Arya,et al.  ANN: library for approximate nearest neighbor searching , 1998 .

[6]  Roger B. Sidje,et al.  Expokit: a software package for computing matrix exponentials , 1998, TOMS.

[7]  A. Grigor’yan Escape rate of brownian motion on riemanian manifolds , 1998 .

[8]  Mark Meyer,et al.  Discrete Differential-Geometry Operators for Triangulated 2-Manifolds , 2002, VisMath.

[9]  Zoran Popovic,et al.  The space of human body shapes: reconstruction and parameterization from range scans , 2003, ACM Trans. Graph..

[10]  Guillermo Sapiro,et al.  A Theoretical and Computational Framework for Isometry Invariant Recognition of Point Cloud Data , 2005, Found. Comput. Math..

[11]  D. Levin,et al.  Linear rotation-invariant coordinates for meshes , 2005, ACM Trans. Graph..

[12]  Dragomir Anguelov,et al.  SCAPE: shape completion and animation of people , 2005, ACM Trans. Graph..

[13]  Niklas Peinecke,et al.  Laplace-Beltrami spectra as 'Shape-DNA' of surfaces and solids , 2006, Comput. Aided Des..

[14]  Ron Kimmel,et al.  Generalized multidimensional scaling: A framework for isometry-invariant partial surface matching , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[15]  Hao Zhang,et al.  Non-Rigid Spectral Correspondence of Triangle Meshes , 2007, Int. J. Shape Model..

[16]  Leonidas J. Guibas,et al.  Eurographics Symposium on Geometry Processing (2007) Reconstruction of Deforming Geometry from Time-varying Point Clouds , 2022 .

[17]  M. Kilian,et al.  Geometric modeling in shape space , 2007, SIGGRAPH 2007.

[18]  M. Maggioni,et al.  Universal Local Parametrizations via Heat Kernels and Eigenfunctions of the Laplacian , 2007, 0709.1975.

[19]  Leonidas J. Guibas,et al.  Global Intrinsic Symmetries of Shapes , 2008, Comput. Graph. Forum.

[20]  N. Mitra,et al.  4-points congruent sets for robust pairwise surface registration , 2008, SIGGRAPH 2008.

[21]  Christian Rössl,et al.  Dense correspondence finding for parametrization-free animation reconstruction from video , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[22]  Michael Garland,et al.  Efficient Sparse Matrix-Vector Multiplication on CUDA , 2008 .

[23]  Leonidas J. Guibas,et al.  Non-Rigid Registration Under Isometric Deformations , 2008 .

[24]  Radu Horaud,et al.  Articulated shape matching using Laplacian eigenfunctions and unsupervised point registration , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[25]  Mikhail Belkin,et al.  Discrete laplace operator on meshed surfaces , 2008, SCG '08.

[26]  Daniel Cohen-Or,et al.  Deformation‐Driven Shape Correspondence , 2008, Comput. Graph. Forum.

[27]  Wojciech Matusik,et al.  Articulated mesh animation from multi-view silhouettes , 2008, ACM Trans. Graph..

[28]  Luiz Velho,et al.  A Hierarchical Segmentation of Articulated Bodies , 2008, Comput. Graph. Forum.

[29]  Hao Li,et al.  Global Correspondence Optimization for Non‐Rigid Registration of Depth Scans , 2008, Comput. Graph. Forum.

[30]  Thomas A. Funkhouser,et al.  Möbius voting for surface correspondence , 2009, ACM Trans. Graph..

[31]  Leonidas J. Guibas,et al.  A concise and provably informative multi-scale signature based on heat diffusion , 2009 .

[32]  Hans-Peter Seidel,et al.  A probabilistic framework for partial intrinsic symmetries in geometric data , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[33]  Martin Reuter,et al.  Hierarchical Shape Segmentation and Registration via Topological Features of Laplace-Beltrami Eigenfunctions , 2010, International Journal of Computer Vision.

[34]  Rasmus Larsen,et al.  Shape Analysis Using the Auto Diffusion Function , 2009 .

[35]  Alexander M. Bronstein,et al.  Numerical Geometry of Non-Rigid Shapes , 2009, Monographs in Computer Science.

[36]  Facundo Mémoli,et al.  Spectral Gromov-Wasserstein distances for shape matching , 2009, 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops.

[37]  H. Seidel,et al.  Isometric registration of ambiguous and partial data , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.

[38]  M. Ben-Chen,et al.  A multi-resolution approach to heat kernels on discrete surfaces , 2010, SIGGRAPH 2010.

[39]  M. Ben-Chen,et al.  A multi-resolution approach to heat kernels on discrete surfaces , 2010, ACM Trans. Graph..

[40]  Y. Gliklikh Stochastic Analysis on Manifolds , 2011 .

[41]  Radu Horaud,et al.  SHREC '11: Robust Feature Detection and Description Benchmark , 2011, 3DOR@Eurographics.

[42]  S. Zelditch EIGENFUNCTIONS AND NODAL SETS , 2012, 1205.2812.