Suthasinee Nopparit, N. Pantuwong, Masanori Sugimoto
{"title":"一种基于动能的无监督运动聚类特征","authors":"Suthasinee Nopparit, N. Pantuwong, Masanori Sugimoto","doi":"10.1109/ICITEED.2013.6676202","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":204082,"journal":{"name":"2013 International Conference on Information Technology and Electrical Engineering (ICITEE)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A kinetic energy-based feature for unsupervised motion clustering\",\"authors\":\"Suthasinee Nopparit, N. Pantuwong, Masanori Sugimoto\",\"doi\":\"10.1109/ICITEED.2013.6676202\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":204082,\"journal\":{\"name\":\"2013 International Conference on Information Technology and Electrical Engineering (ICITEE)\",\"volume\":\"116 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Information Technology and Electrical Engineering (ICITEE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICITEED.2013.6676202\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Information Technology and Electrical Engineering (ICITEE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICITEED.2013.6676202","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.