The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - Nov. (2012 vol.34)
pp: 2203-2215
Y. Sahillioglu , Dept. of Comput. Eng., Koc Univ., Istanbul, Turkey
Y. Yemez , Dept. of Comput. Eng., Koc Univ., Istanbul, Turkey
ABSTRACT
We present a purely isometric method that establishes 3D correspondence between two (nearly) isometric shapes. Our method evenly samples high-curvature vertices from the given mesh representations, and then seeks an injective mapping from one vertex set to the other that minimizes the isometric distortion. We formulate the problem of shape correspondence as combinatorial optimization over the domain of all possible mappings, which then reduces in a probabilistic setting to a log-likelihood maximization problem that we solve via the Expectation-Maximization (EM) algorithm. The EM algorithm is initialized in the spectral domain by transforming the sampled vertices via classical Multidimensional Scaling (MDS). Minimization of the isometric distortion, and hence maximization of the log-likelihood function, is then achieved in the original 3D euclidean space, for each iteration of the EM algorithm, in two steps: by first using bipartite perfect matching, and then a greedy optimization algorithm. The optimal mapping obtained at convergence can be one-to-one or many-to-one upon choice. We demonstrate the performance of our method on various isometric (or nearly isometric) pairs of shapes for some of which the ground-truth correspondence is available.
INDEX TERMS
Shape, Three dimensional displays, Optimization, Minimization, Spectral analysis, Approximation methods, Probabilistic logic, EM algorithm, 3D isometric shape correspondence, multidimensional scaling, spectral embedding, isometric distortion, greedy optimization, bipartite perfect matching
CITATION
Y. Sahillioglu, Y. Yemez, "Minimum-Distortion Isometric Shape Correspondence Using EM Algorithm", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.34, no. 11, pp. 2203-2215, Nov. 2012, doi:10.1109/TPAMI.2012.26
REFERENCES
[1] O. van Kaick, H. Zhang, G. Hamarneh, and D. Cohen-Or, "A Survey on Shape Correspondence," Computer Graphics Forum, vol. 30, pp. 1681-1707, 2011.
[2] M. Alexa, "Recent Advances in Mesh Morphing," Computer Graphics Forum, vol. 21, pp. 173-196, 2002.
[3] V. Kraevoy and A. Sheffer, "Cross-Parameterization and Compatible Remeshing of 3D Models," ACM Trans. Graphics, vol. 23, no. 3, pp. 861-869, 2004.
[4] R.W. Sumner and J. Popovic, "Deformation Transfer for Triangle Meshes," ACM Trans. Graphics, vol. 23, no. 3, pp. 399-405, 2004.
[5] D. Anguelov, P. Srinivasan, H. Pang, D. Koller, S. Thrun, and J. Davis, "The Correlated Correspondence Algorithm for Unsupervised Registration of Nonrigid Surfaces," Neural Information Processing Systems, vol. 37, pp. 33-40, 2004.
[6] M. Hilaga, Y. Shinagawa, T. Kohmura, and T. Kunii, "Topology Matching for Fully Automatic Similarity Estimation of 3D Shapes," Proc. ACM Siggraph, pp. 203-212, 2001.
[7] A. Elad and R. Kimmel, "On Bending Invariant Signatures for Surfaces," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 25, no. 10, pp. 1285-1295, Oct. 2003.
[8] A. Zaharescu, E. Boyer, K. Varanasi, and R. Horaud, "Surface Feature Detection and Description with Applications to Mesh Matching," Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2009.
[9] B.C. Munsell, P. Dalal, and S. Wang, "Evaluating Shape Correspondence for Statistical Shape Analysis: A Benchmark Study," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 30, no. 11, pp. 2023-2039, Nov. 2008.
[10] V. Jain and H. Zhang, "Robust 3D Shape Correspondence in the Spectral Domain," Proc. IEEE Int'l Conf. Shape Modeling and Applications, pp. 118-129, 2006.
[11] M. Carcassoni and E.R. Hancock, "Correspondence Matching with Modal Clusters," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 25, no. 12, pp. 1609-1615, Dec. 2003.
[12] M. Leordeanu and M. Hebert, "A Spectral Technique for Correspondence Problems Using Pairwise Constraints," Proc. IEEE Int'l Conf. Computer Vision, pp. 1482-1489, 2005.
[13] S. Wuhrer, C. Shu, and P. Bose, "Posture Invariant Correspondence of Triangular Meshes in Shape Space," Proc. Int'l Conf. 3D Digital Imaging and Modeling, 2009.
[14] D. Mateus, R. Horaud, D. Knossow, F. Cuzzolin, and E. Boyer, "Articulated Shape Matching Using Laplacian Eigenfunctions and Unsupervised Point Registration," Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 1-8, 2008.
[15] Y. Lipman and T. Funkhouser, "Mobius Voting for Surface Correspondence," ACM Trans. Graphics, vol. 28, no. 3, p. 72, 2009.
[16] Y. Sahillioğlu and Y. Yemez, "3D Shape Correspondence by Isometry-Driven Greedy Optimization," Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 453-458, 2010.
[17] A.M. Bronstein, M.M. Bronstein, and R. Kimmel, Numerical Geometry of Non-Rigid Shapes. Springer, 2008.
[18] A.M. Bronstein, M.M. Bronstein, and R. Kimmel, "Efficient Computation of Isometry-Invariant Distances between Surfaces," SIAM J. Scientific Computing, vol. 28, no. 5, pp. 1812-1836, 2006.
[19] M. Ovsjanikov, J. Sun, and L. Guibas, "Global Intrinsic Symmetries of Shapes," Computer Graphics Forum, vol. 27, no. 5, pp. 1341-1348, 2007.
[20] M. Ovsjanikov, Q. Mérigot, F. Mémoli, and L. Guibas, "One Point Isometric Matching with the Heat Kernel," Computer Graphics Forum, vol. 29, no. 5, pp. 1555-1564, 2010.
[21] A. Sharma and R.P. Horaud, "Shape Matching Based on Diffusion Embedding and on Mutual Isometric Consistency," Proc. Workshop Nonrigid Shape Analysis and Deformable Image Alignment, 2010.
[22] Y. Zeng, C. Wang, Y. Wang, X. Gu, D. Samaras, and N. Paragios, "Dense Non-Rigid Surface Registration Using High-Order Graph Matching," Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2010.
[23] V. Kim, Y. Lipman, and T. Funkhouser, "Blended Intrinsic Maps," ACM Trans. Graphics, vol. 30, no. 4, Article 79, 2011.
[24] A.M. Bronstein, M.M. Bronstein, and R. Kimmel, "Generalized Multidimensional Scaling: A Framework for Isometry Invariant Partial Surface Matching," Proc. Nat'l Academy of Sciences USA, vol. 103, no. 5, pp. 1168-1172, 2006.
[25] H. Chui and A. Rangarajan, "A New Point Matching Algorithm for Non-Rigid Registration," Computer Vision and Image Understanding, vol. 89, pp. 114-141, 2003.
[26] L. Torresani, V. Kolmogorov, and C. Rother, "Feature Correspondence via Graph Matching: Models and Global Optimization," Proc. 10th European Conf. Computer Vision, pp. 596-609, 2008.
[27] T. Funkhouser and P. Shilane, "Partial Matching of 3D Shapes with Priority-Driven Search," Proc. Symp. Geometry Processing, 2006.
[28] A. Tevs, M. Bokeloh, M. Wand, A. Schilling, and H.-P. Seidel, "Isometric Registration of Ambiguous and Partial Data," Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2009.
[29] S. Belongie, J. Malik, and J. Puzicha, "Shape Matching and Object Recognition Using Shape Contexts," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 4, pp. 509-522, Apr. 2002.
[30] H. Zhang, A. Sheffer, D. Cohen-Or, Q. Zhou, O. van Kaick, and A. Tagliasacchil, "Deformation-Driven Shape Correspondence," Proc. Symp. Geometry Processing, pp. 1431-1439, 2008.
[31] Q. Huang, B. Adams, M. Wicke, and L. Guibas, "Non-Rigid Registration under Isometric Deformations," Proc. Symp. Geometry Processing, pp. 1149-1458, 2008.
[32] O.K.-C. Au, D. Cohen-Or, C.-L. Tai, H. Fu, and Y. Zheng, "Electors Voting for Fast Automatic Shape Correspondence," Computer Graphics Forum, vol. 29, no. 2, pp. 645-654, 2010.
[33] C. Wang, M.M. Bronstein, A.M. Bronstein, and N. Paragios, "Discrete Minimum Distortion Correspondence Problems for Non-Rigid Shape Matching," Proc. Third Int'l Conf. Scale Space and Variational Methods in Computer Vision, 2011.
[34] Y. Sahillioğlu and Y. Yemez, "Coarse-to-Fine Combinatorial Matching for Dense Isometric Shape Correspondence," Computer Graphics Forum, vol. 30, no. 5, pp. 1461-1470, 2011.
[35] M. Meyer, M. Desbrun, P. Schröder, and A. Barr, "Discrete Differential-Geometry Operators for Triangulated 2-Manifolds," Proc. Int'l Workshop Visualization and Math., 2002.
[36] G. Peyré and L.D. Cohen, "Geodesic Remeshing Using Front Propagation," Proc. IEEE Workshop Variational, Geometric and Level Set Methods, pp. 33-40, 2003.
[37] A.P. Dempster, N.M. Laird, and D.B. Rubin, "Maximum Likelihood from Incomplete Data via the EM Algorithm," J. Royal Statistical Soc.: Series B, vol. 39, pp. 1-38, 1977.
[38] J.C. Gower, "Some Distance Properties of Latent Root and Vector Methods Used in Multivariate Analysis," Biometrika, vol. 53, pp. 325-338, 1966.
[39] V. Kolmogorov, "Blossom V: A New Implementation of a Minimum Cost Perfect Matching Algorithm," Math. Programming Computation, vol. 1, pp. 43-67, 2009.
[40] P. Sand, L. McMillan, and J. Popovic, "Continuous Capture of Skin Deformation," Proc. Int'l Conf. Computer Graphics and Interactive Techniques, 2003.
[41] E. de Aguiar, C. Stoll, C. Theobalt, N. Ahmed, H.P. Seidel, and S. Thrun, "Performance Capture from Sparse Multi-View Video," ACM Trans. Graphics, vol. 27, no. 3, 2008.
[42] X. Chen, A. Golovinskiy, and T. Funkhouser, "A Benchmark for 3D Mesh Segmentation," ACM Trans. Graphics, vol. 28, 2009.
[43] O. Weber, Y.S. Devir, A.M. Bronstein, M.M. Bronstein, and R. Kimmel, "Parallel Algorithms for Approximation of Distance Maps on Parametric Surfaces," ACM Trans. Graphics, vol. 27, no. 4, pp. 1-16, 2008.
[44] R. Liu, V. Jain, and H. Zhang, "Subsampling for Efficient Spectral Mesh Processing," Proc. 24th Int'l Conf. Advances in Computer Graphics , 2006.
[45] V.G. Kim, Y. Lipman, X. Chen, and T. Funkhouser, "Mobius Transformations for Global Intrinsic Symmetry Analysis," Computer Graphics Forum, vol. 29, no. 5, pp. 1555-1564, 2010.
36 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool