Symmetry Robust Descriptor for Non-Rigid Surface Matching

In this paper, we propose a novel shape descriptor that is robust in differentiating intrinsic symmetric points on geometric surfaces. Our motivation is that even the state-of-theart shape descriptors and non-rigid surface matching algorithms suffer from symmetry flips. They cannot differentiate surface points that are symmetric or near symmetric. Hence a left hand of one human model may be matched to a right hand of another. Our Symmetry Robust Descriptor (SRD) is based on a signed angle field, which can be calculated from the gradient fields of the harmonic fields of two point pairs. Experiments show that the proposed shape descriptor SRD results in much less symmetry flips compared to alternative methods. We further incorporate SRD into a stand-alone algorithm to minimize symmetry flips in finding sparse shape correspondences. SRD can also be used to augment other modern non-rigid shape matching algorithms with ease to alleviate symmetry confusions.

[1]  Thomas A. Funkhouser,et al.  Fuzzy Geodesics and Consistent Sparse Correspondences For: eformable Shapes , 2010 .

[2]  Remco C. Veltkamp,et al.  SHREC2006: 3D Shape Retrieval Contest , 2006 .

[3]  Daniel Cohen-Or,et al.  4-points congruent sets for robust pairwise surface registration , 2008, ACM Trans. Graph..

[4]  T. Funkhouser,et al.  Möbius voting for surface correspondence , 2009, SIGGRAPH 2009.

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

[6]  Leonidas J. Guibas,et al.  Shape Matching via Quotient Spaces , 2013 .

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

[8]  Yücel Yemez,et al.  Coarse‐to‐Fine Isometric Shape Correspondence by Tracking Symmetric Flips , 2013, Comput. Graph. Forum.

[9]  Christian Rössl,et al.  Laplacian surface editing , 2004, SGP '04.

[10]  Hao Zhang,et al.  Robust 3D Shape Correspondence in the Spectral Domain , 2006, IEEE International Conference on Shape Modeling and Applications 2006 (SMI'06).

[11]  Vladimir G. Kim,et al.  Finding Surface Correspondences Using Symmetry Axis Curves , 2012, Comput. Graph. Forum.

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

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

[14]  Ghassan Hamarneh,et al.  Bilateral Maps for Partial Matching , 2013, Comput. Graph. Forum.

[15]  Yücel Yemez,et al.  Minimum-Distortion Isometric Shape Correspondence Using EM Algorithm , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  Ron Kimmel,et al.  On Bending Invariant Signatures for Surfaces , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

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

[18]  Eugene Zhang,et al.  Pairwise Harmonics for Shape Analysis , 2013, IEEE Transactions on Visualization and Computer Graphics.

[19]  Michael Garland,et al.  Harmonic functions for quadrilateral remeshing of arbitrary manifolds , 2005, Comput. Aided Geom. Des..

[20]  Thomas A. Funkhouser,et al.  Symmetry factored embedding and distance , 2010, ACM Transactions on Graphics.

[21]  Remco C. Veltkamp,et al.  A survey of content based 3D shape retrieval methods , 2004, Proceedings Shape Modeling Applications, 2004..

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

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

[24]  Daniel Cohen-Or,et al.  Electors Voting for Fast Automatic Shape Correspondence , 2010, Comput. Graph. Forum.