{"title":"Human motion capture data segmentation based on graph partition","authors":"Na Lv, Zhiquan Feng, Xiuyang Zhao","doi":"10.1109/CISP.2013.6745223","DOIUrl":null,"url":null,"abstract":"For better reuse of motion capture data, long motion sequences need to be segmented into multiple motion clips of simple motion types. In this paper, we propose a method for motion capture data segmentation based on graph partition. Each frame of motion sequence is viewed as a node in an undirected weighted graph, and the weight of an edge is the similarity between two frames corresponding to the two nodes connected by the edge. The optimal segmentation is obtained through graph partition algorithm, which makes the similarities of nodes in each subgraph being high, and the similarities between different subgraphs being low. After the segment scores at each frame are calculated, double thresholds decision method is conducted on the score curve to detect segment points. Experimental results show that our method obtains good segmentation results.","PeriodicalId":442320,"journal":{"name":"2013 6th International Congress on Image and Signal Processing (CISP)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 6th International Congress on Image and Signal Processing (CISP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISP.2013.6745223","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
For better reuse of motion capture data, long motion sequences need to be segmented into multiple motion clips of simple motion types. In this paper, we propose a method for motion capture data segmentation based on graph partition. Each frame of motion sequence is viewed as a node in an undirected weighted graph, and the weight of an edge is the similarity between two frames corresponding to the two nodes connected by the edge. The optimal segmentation is obtained through graph partition algorithm, which makes the similarities of nodes in each subgraph being high, and the similarities between different subgraphs being low. After the segment scores at each frame are calculated, double thresholds decision method is conducted on the score curve to detect segment points. Experimental results show that our method obtains good segmentation results.