SHREC'10 Track: Correspondence Finding

The SHREC'10 correspondence finding benchmark simulates a one-to-one shape matching scenario, in which one of the shapes undergoes multiple modifications and transformations. The benchmark allows evaluating how correspondence algorithms cope with certain classes of transformations and what is the strength of the transformations that can be dealt with. The present paper is a report of the 3D Shape Retrieval Contest 2010 (SHREC'10) correspondence finding benchmark results.

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

[2]  Radu Horaud,et al.  Rigid and Articulated Point Registration with Expectation Conditional Maximization , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Raif M. Rustamov,et al.  Laplace-Beltrami eigenfunctions for deformation invariant shape representation , 2007 .

[4]  Alexander M. Bronstein,et al.  Efficient Computation of Isometry-Invariant Distances Between Surfaces , 2006, SIAM J. Sci. Comput..

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

[6]  Radu Horaud,et al.  Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors , 2009, GbRPR.

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

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

[9]  Alexander M. Bronstein,et al.  Symmetries of non-rigid shapes , 2007, 2007 IEEE 11th International Conference on Computer Vision.

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