Bayesian Inference of Bijective Non-Rigid Shape Correspondence

Many algorithms for the computation of correspondences between deformable shapes rely on some variant of nearest neighbor matching in a descriptor space. Such are, for example, various point-wise correspondence recovery algorithms used as a postprocessing stage in the functional correspondence framework. In this paper, we show that such frequently used techniques in practice suffer from lack of accuracy and result in poor surjectivity. We propose an alternative recovery technique guaranteeing a bijective correspondence and producing significantly higher accuracy. We derive the proposed method from a statistical framework of Bayesian inference and demonstrate its performance on several challenging deformable 3D shape matching datasets.

[1]  Yücel Yemez,et al.  Eurographics Symposium on Geometry Processing 2011 Coarse-to-fine Combinatorial Matching for Dense Isometric Shape Correspondence , 2022 .

[2]  Ron Kimmel,et al.  Spectral Generalized Multi-dimensional Scaling , 2013, International Journal of Computer Vision.

[3]  Vladimir G. Kim,et al.  Blended intrinsic maps , 2011, SIGGRAPH 2011.

[4]  Ann B. Lee,et al.  Geometric diffusions as a tool for harmonic analysis and structure definition of data: diffusion maps. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[5]  Martial Hebert,et al.  A spectral technique for correspondence problems using pairwise constraints , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[6]  Gérard G. Medioni,et al.  Object modeling by registration of multiple range images , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[7]  Ghassan Hamarneh,et al.  A Survey on Shape Correspondence , 2011, Comput. Graph. Forum.

[8]  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.

[9]  Daniel Cremers,et al.  The wave kernel signature: A quantum mechanical approach to shape analysis , 2011, 2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops).

[10]  Iasonas Kokkinos,et al.  Scale-invariant heat kernel signatures for non-rigid shape recognition , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[11]  Paul J. Besl,et al.  A Method for Registration of 3-D Shapes , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  R. Horaud,et al.  Surface feature detection and description with applications to mesh matching , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.

[13]  Ronen Basri,et al.  Tight relaxation of quadratic matching , 2015, SGP '15.

[14]  Y. Aflalo,et al.  On convex relaxation of graph isomorphism , 2015, Proceedings of the National Academy of Sciences.

[15]  Daniel Cremers,et al.  Geometrically consistent elastic matching of 3D shapes: A linear programming solution , 2011, 2011 International Conference on Computer Vision.

[16]  I. Daubechies,et al.  Conformal Wasserstein distances: Comparing surfaces in polynomial time , 2011, 1103.4408.

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

[18]  Hans-Peter Seidel,et al.  Intrinsic Shape Matching by Planned Landmark Sampling , 2011, Comput. Graph. Forum.

[19]  J A Sethian,et al.  Computing geodesic paths on manifolds. , 1998, Proceedings of the National Academy of Sciences of the United States of America.

[20]  Ron Kimmel,et al.  Spectral multidimensional scaling , 2013, Proceedings of the National Academy of Sciences.

[21]  Ron Kimmel,et al.  Bending invariant representations for surfaces , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

[22]  Shinji Umeyama,et al.  An Eigendecomposition Approach to Weighted Graph Matching Problems , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[23]  Daniel Cremers,et al.  Robust Region Detection via Consensus Segmentation of Deformable Shapes , 2014, Comput. Graph. Forum.

[24]  Dimitri P. Bertsekas,et al.  Network optimization : continuous and discrete models , 1998 .

[25]  Keenan Crane,et al.  Geodesics in heat: A new approach to computing distance based on heat flow , 2012, TOGS.

[26]  Maks Ovsjanikov,et al.  Functional maps , 2012, ACM Trans. Graph..

[27]  Xavier Bresson,et al.  Functional correspondence by matrix completion , 2014, 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

[28]  Vladlen Koltun,et al.  Robust Nonrigid Registration by Convex Optimization , 2015, 2015 IEEE International Conference on Computer Vision (ICCV).

[29]  Sebastian Thrun,et al.  SCAPE: shape completion and animation of people , 2005, SIGGRAPH 2005.

[30]  Daniel Cremers,et al.  Dense Non-rigid Shape Correspondence Using Random Forests , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.

[31]  Ron Kimmel,et al.  Computing geodesic paths on , 1998 .

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

[33]  Roi Poranne,et al.  Lifted bijections for low distortion surface mappings , 2014, ACM Trans. Graph..

[34]  Nikos Paragios,et al.  Dense non-rigid surface registration using high-order graph matching , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[35]  Michael Möller,et al.  Point-wise Map Recovery and Refinement from Functional Correspondence , 2015, VMV.

[36]  Vladimir G. Kim,et al.  Möbius Transformations For Global Intrinsic Symmetry Analysis , 2010, Comput. Graph. Forum.

[37]  Andriy Myronenko,et al.  Point Set Registration: Coherent Point Drift , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[38]  Vladimir Kolmogorov,et al.  Feature Correspondence Via Graph Matching: Models and Global Optimization , 2008, ECCV.

[39]  Leonidas J. Guibas,et al.  Soft Maps Between Surfaces , 2012, Comput. Graph. Forum.

[40]  Vladimir G. Kim,et al.  Blended intrinsic maps , 2011, ACM Trans. Graph..

[41]  Facundo Mémoli,et al.  Gromov–Wasserstein Distances and the Metric Approach to Object Matching , 2011, Found. Comput. Math..

[42]  Ron Kimmel,et al.  Matching LBO eigenspace of non-rigid shapes via high order statistics , 2013, Axioms.

[43]  Alexander M. Bronstein,et al.  Parallel algorithms for approximation of distance maps on parametric surfaces , 2008, TOGS.

[44]  Alexander M. Bronstein,et al.  A game-theoretic approach to deformable shape matching , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[45]  Guillermo Sapiro,et al.  Sparse Modeling of Intrinsic Correspondences , 2012, Comput. Graph. Forum.

[46]  Leonidas J. Guibas,et al.  One Point Isometric Matching with the Heat Kernel , 2010, Comput. Graph. Forum.

[47]  Michael J. Black,et al.  FAUST: Dataset and Evaluation for 3D Mesh Registration , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.