Interactive optimization of near-isometric shape correspondence

In this paper, we present an interactive approach for near-isometric shape correspondence. Our key motivation is that the intention of the users in the correspondence problem is valuable, which helps to not only reduce search space for finding the matching pairs but also increase the accuracy of matching results. In our implementation, a cost matrix is introduced, which is updated according to the constraints given by the users. We then combine the cost matrix with an initial similarity matrix to form a joint matrix, and based on which, we formulate a linear assignment objective function to solve the correspondence problem. The experiments show that our method is fast, intuitive and can produce pleasing results.

[1]  Stella X. Yu,et al.  Linear solution to scale and rotation invariant object matching , 2009, CVPR.

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

[3]  Vladimir Kolmogorov,et al.  Blossom V: a new implementation of a minimum cost perfect matching algorithm , 2009, Math. Program. Comput..

[4]  Thomas Funkhouser,et al.  A benchmark for 3D mesh segmentation , 2009, SIGGRAPH 2009.

[5]  Thomas A. Funkhouser,et al.  A benchmark for 3D mesh segmentation , 2009, ACM Trans. Graph..

[6]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[7]  Gary K. L. Tam,et al.  Diffusion pruning for rapidly and robustly selecting global correspondences using local isometry , 2014, ACM Trans. Graph..

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

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

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

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

[12]  A. Bronstein,et al.  Shape Google : a computer vision approach to invariant shape retrieval , 2009 .

[13]  Stella X. Yu,et al.  Linear solution to scale and rotation invariant object matching , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.

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

[15]  Radu Horaud,et al.  Shape matching based on diffusion embedding and on mutual isometric consistency , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Workshops.

[16]  Leonidas J. Guibas,et al.  Shape Google: a computer vision approach to isometry invariant shape retrieval , 2009, 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops.

[17]  Nikos Paragios,et al.  Discrete Minimum Distortion Correspondence Problems for Non-rigid Shape Matching , 2011, SSVM.

[18]  Amnon Shashua,et al.  Probabilistic graph and hypergraph matching , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

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

[20]  Taku Komura,et al.  Topology matching for fully automatic similarity estimation of 3D shapes , 2001, SIGGRAPH.

[21]  Jean Ponce,et al.  A Tensor-Based Algorithm for High-Order Graph Matching , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

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

[24]  Radu Horaud,et al.  Topologically-robust 3D shape matching based on diffusion geometry and seed growing , 2011, CVPR 2011.

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