Abstract
We present a theoretical and computational framework for matching of two-dimensional articulated shapes. Assuming that articulations can be modeled as near-isometries, we show an axiomatic construction of an articulation-invariant distance between shapes, formulated as a generalized multidimensional scaling (GMDS) problem and solved efficiently. Some numerical results demonstrating the accuracy of our method are presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Geiger, D., Basri, R., Costa, L., Jacobs, D.: Determining the similarity of deformable shapes. Vision Research 38, 2365–2385 (1998)
Gdalyahu, Y., Weinshall, D.: Flexible syntactic matching of curves and its application to automatic hierarchical classification of silhouettes. IEEE Trans. PAMI 21, 1312–1328 (1999)
Belongie, S., Malik, J., Puzicha, J.: Shape matching and object recognition using shape context. IEEE Trans. PAMI 24, 509–522 (2002)
Zhang, J., Collins, R., Liu, Y.: Representation and matching of articulated shapes. In: Proc. CVPR, vol. 2, pp. 342–349 (June 2004)
Ling, H., Jacobs, D.: Using the inner-distance for classification of articulated shapes. In: Proc. CVPR (2005)
Elad, A., Kimmel, R.: Bending invariant representations for surfaces. In: Proc. CVPR, pp. 168–174 (2001)
Gromov, M.: Structures métriques pour les variétés riemanniennes. Number 1 in Textes Mathématiques (1981)
Mémoli, F., Sapiro, G.: A theoretical and computational framework for isometry invariant recognition of point cloud data. In: Foundations of Computational Mathematics (to appear, 2005)
Bronstein, A.M., Bronstein, M.M., Kimmel, R.: Efficient computation of isometry-invariant distances between surfaces. Technical report, Dept. of Computer Science, Technion, Israel (submitted, 2005)
Bronstein, A.M., Bronstein, M.M., Kimmel, R.: Generalized multidimensional scaling: a framework for isometry-invariant partial surface matching. Proc. National Academy of Sciences 103(5), 1168–1172 (2006)
Jacobs, D., Weinshall, D., Gdalyahu, Y.: Class representation and image retrieval with non-metric distances. IEEE Trans. PAMI 22, 583–600 (2000)
Sethian, J.A.: A review of the theory, algorithms, and applications of level set method for propagating surfaces. Acta numerica, 309–395 (1996)
Kimmel, R., Sethian, J.A.: Computing geodesic on manifolds. Proc. US National Academy of Science 95, 8431–8435 (1998)
Borg, I., Groenen, P.: Modern multidimensional scaling - theory and applications. Springer, Heidelberg (1997)
Bertsekas, D.: Nonlinear programming, 2nd edn. Atlanta Scientific (1999)
Bronstein, M.M., Bronstein, A.M., Kimmel, R., Yavneh, I.: Multigrid multidimensional scaling. Numerical Linear Algebra with Applications (NLAA) 13, 149–171 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bronstein, A.M., Bronstein, M.M., Bruckstein, A.M., Kimmel, R. (2006). Matching Two-Dimensional Articulated Shapes Using Generalized Multidimensional Scaling. In: Perales, F.J., Fisher, R.B. (eds) Articulated Motion and Deformable Objects. AMDO 2006. Lecture Notes in Computer Science, vol 4069. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11789239_6
Download citation
DOI: https://doi.org/10.1007/11789239_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36031-5
Online ISBN: 978-3-540-36032-2
eBook Packages: Computer ScienceComputer Science (R0)