The Community for Technology Leaders
RSS Icon
Issue No.03 - May/June (2009 vol.15)
pp: 481-492
Edmond S.L. Ho , University of Edinburgh, Edinburgh
Taku Komura , University of Edinburgh, Edinburgh
Human motion indexing and retrieval are important for animators due to the need to search for motions in the database which can be blended and concatenated. Most of the previous researches of human motion indexing and retrieval compute the Euclidean distance of joint angles or joint positions. Such approaches are difficult to apply for cases in which multiple characters are closely interacting with each other, as the relationships of the characters are not encoded in the representation. In this research, we propose a topology-based approach to index the motions of two human characters in close contact. We compute and encode how the two bodies are tangled based on the concept of rational tangles. The encoded relationships, which we define as {\it TangleList}, are used to determine the similarity of the pairs of postures. Using our method, we can index and retrieve motions such as one person piggy-backing another, one person assisting another in walking, and two persons dancing / wrestling. Our method is useful to manage a motion database of multiple characters. We can also produce motion graph structures of two characters closely interacting with each other by interpolating and concatenating topologically similar postures and motion clips, which are applicable to 3D computer games and computer animation.
Animation, Face and gesture recognition
Edmond S.L. Ho, Taku Komura, "Indexing and Retrieving Motions of Characters in Close Contact", IEEE Transactions on Visualization & Computer Graphics, vol.15, no. 3, pp. 481-492, May/June 2009, doi:10.1109/TVCG.2008.199
[1] J. Conway, An Enumeration of Knots and Links. Pergamon Press, 1969.
[2] O. Arikan and D. Forsyth, “Motion Generation from Examples,” ACM Trans. Graphics, vol. 21, no. 3, pp. 483-490, 2002.
[3] J. Lee, J. Chai, P.S.A. Reitsma, J.K. Hodgins, and N.S. Pollard, “Interactive Control of Avatars Animated with Human Motion data,“ ACM Trans. Graphics, vol. 21, no. 3, pp. 491-500, 2002.
[4] L. Kovar, M. Gleicher, and F. Pighin, “Motion Graphs,” ACM Trans. Graphics, vol. 21, no. 3, pp. 473-482, 2002.
[5] O. Arikan, D.A. Forsyth, and J. O'Brien, “Motion Synthesis from Annotations,” ACM Trans. Graphics (Proc. ACM SIGGRAPH '03), vol. 33, no. 3, pp. 402-408, 2003.
[6] F. Liu, Y. Zhuang, F. Wu, and Y. Pan, “3D Motion Retrieval with Motion Index Tree,” Computer Vision and Image Understanding, vol. 92, no. 2-3, pp. 265-284, 2003.
[7] L. Kovar and M. Gleicher, “Flexible Automatic Motion Blending with Registration Curves,” Proc. ACM SIGGRAPH/Eurographics Symp. Computer Animation, pp. 214-224, 2003.
[8] L. Kovar and M. Gleicher, “Automated Extraction and Parameterization of Motions in Large Data Sets,” ACM Trans. Graphics, vol. 23, no. 3, pp. 559-568, 2004.
[9] E.J. Keogh, T. Palpanas, V.B. Zordan, D. Gunopulos, and M. Cardle, “Indexing Large Human-Motion Databases,” Proc. 30th VLDB Conf., pp. 780-791, 2004.
[10] M. Muller, T. Roder, and M. Clausen, “Efficient Content-Based Retrieval of Motion Capture Data,” ACM Trans. Graphics, vol. 24, no. 3, pp. 677-685, 2005.
[11] M. Muller and T. Roder, “Motion Templates for Automatic Classification and Retrieval of Motion Capture Data,” Proc. 2006 ACM SIGGRAPH/Eurographics Symp. Computer Animation, pp. 137-146, 2006.
[12] Y. Shinagawa and T.L. Kunii, “The Homotopy Model: A Generalized Model for Smooth Surface Generation from Cross Sectional Data,” Visual Computer, vol. 7, nos. 2-3, pp. 72-86, 1991.
[13] Y. Shinagawa, Y.L. Kergosien, and T.L. Kunii, “Surface Coding Based on Morse Theory,” IEEE Computer Graphics and Applications, vol. 11, no. 5, pp. 66-78, 1991.
[14] Y. Shinagawa and T.L. Kunii, “Constructing a Reeb Graph Automatically from Cross Sections,” IEEE Computer Graphics and Applications, vol. 11, no. 6, pp. 44-51, 1991.
[15] S. Takahashi, Y. Shinagawa, and T. Kunii, “A Feature-Based Approach for Smooth Surfaces,” Proc. ACM Symp. Solid Modeling, pp. 97-110, 1997.
[16] Y. Shinagawa and T.L. Kunii, “Unconstrained Automatic Image Matching Using Multiresolutional Critical-Point Filters,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, no. 9, pp. 994-1010, Sept. 1998.
[17] I. Fujishiro, Y. Takeshima, T. Azuma, and S. Takahashi, “Volume Data Mining Using 3D Field Topology Analysis,” IEEE Computer Graphics and Applications, vol. 20, no. 5, pp. 46-51, Sept./Oct. 2000.
[18] M. Hilaga, Y. Shinagawa, T. Komura, and T.L. Kunii, “Topology Matching for Full Automatic Similarity Estimation of 3D Shapes,” Proc. ACM SIGGRAPH '01, pp. 203-212, 2001.
[19] G. Reeb, “Sur Les Points Singuliers d'fune Forme de Pfaff Completement Integrable ou d'fune Fonction Numerique [on the Singular Points of a Completely Integrable Pfaff form or of a Numerical Function],” Comptes Randus Acad. Sciences Paris, vol. 222, pp. 847-849, 1946.
[20] D. DeCarlo and J. Gallier, “Topological Evoloution of Surfaces,” Graphics Interface, pp. 194-203, 1996.
[21] S. Takahashi, Y. Kokojima, and R. Ohbuchi, “Explicit Control of Topological Transitions in Morphing Shapes of 3D Meshes,” Proc. Ninth Pacific Conf. Computer Graphics and Applications (PG '01), p.0070, 2001.
[22] C.C. Adams, The Knot Book. W.H. Freeman and Co., 1994.
[23] M. Vazquez and D.W. Sumners, “Tangle Analysis of Gin Site-Specific Recombination,” Math. Proc. Cambridge Philosophical Soc., vol. 136, pp. 565-582, 2004.
[24] E.S.L. Ho and T. Komura, “Wrestle Alone: Creating Tangled Motions of Multiple Avatars from Individually Captured Motions,” Proc. Pacific Graphics 2007, pp. 427-430, 2007.
[25] E.S.L. Ho and T. Komura, “Planning Tangling Motions for Humanoids,” Proc. Humanoids 2007, 2007.
[26] M. Levitt, “Protein Folding by Restrained Energy Minimization and Molecular Dynamics,” J. Molecular Biology, vol. 170, pp. 723-764, 1983.
[27] K. Klenin and J. Langowski, “Computation of Writhe in Modeling of Supercoiled DNA,” Biopolymers, vol. 54, pp. 307-317, 2000.
26 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool