A kinetic energy-based feature for unsupervised motion clustering

Motion databases usually contain sequences of movements and searching these vast databases is not an easy task. Motion clustering can reduce this difficulty by grouping sample movements into various motion groups containing similar actions. The pose distance is often used as a feature during motion-clustering tasks. However, the main weakness of this strategy is its computational complexity. Query motions are also required to cluster motion sequences. To address these problems, we propose a motion-clustering algorithm based on the use of kinetic energy to cluster sample motions. Our method does not require query motions during the clustering process, so the clustering results can be generated without supervision. Our experimental results confirmed that our proposed method delivered comparable performance to pose distance-based methods, while its computational complexity was significantly lower than that of existing methods.

[1]  Zhaoqi Wang,et al.  Indexing and retrieval of human motion data by a hierarchical tree , 2009, VRST '09.

[2]  Lucas Kovar,et al.  Motion Graphs , 2002, ACM Trans. Graph..

[3]  Dimitrios Gunopulos,et al.  Indexing Large Human-Motion Databases , 2004, VLDB.

[4]  Zoran Popovic,et al.  Motion warping , 1995, SIGGRAPH.

[5]  Jessica K. Hodgins,et al.  Interactive control of avatars animated with human motion data , 2002, SIGGRAPH.

[6]  Lucas Kovar,et al.  Automated extraction and parameterization of motions in large data sets , 2004, ACM Trans. Graph..

[7]  Graham Coleman,et al.  Detection and explanation of anomalous activities: representing activities as bags of event n-grams , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[8]  Michael Gleicher,et al.  Automated extraction and parameterization of motions in large data sets , 2004, SIGGRAPH 2004.

[9]  Heng Tao Shen,et al.  Principal Component Analysis , 2009, Encyclopedia of Biometrics.