Adaptive Keypose Extraction from Motion Capture Data
この論文をさがす
抄録
In this paper, we present a novel method to extract keyposes from motion-capture data streams. It adaptively extracts keyposes in response to the motion characteristics of a given data stream. We adopt an approach to detect local minima in the temporal variation of motion speed. In the developed algorithm, the intensity of each local minimum is first evaluated by using a set of signals; it is obtained by applying a set of low-pass filters to a one-dimensional motion-speed data stream. The cut-off frequencies of the filters are distributed over a wide frequency range. By adding up the speed-descent values of each local minimum over all the signals, we exhaustively obtain the information on its intensity provided at all the time-scale levels covered by a given data stream. Then, the obtained intensity values are categorized by a clustering algorithm; the local minima categorized as those of little significance are deleted and the remaining ones are fixed as those giving keyposes. Experimental results showed that the present method provided results comparable to the best of those given by the methods previously proposed. This was achieved without readjusting the values of parameters used in the algorithm. Readjustment was indispensable for the other methods to obtain good results.------------------------------This is a preprint of an article intended for publication Journal ofInformation Processing(JIP). This preprint should not be cited. Thisarticle should be cited as: Journal of Information Processing Vol.22(2014) No.1 (online)DOI http://dx.doi.org/10.2197/ipsjjip.22.67------------------------------
In this paper, we present a novel method to extract keyposes from motion-capture data streams. It adaptively extracts keyposes in response to the motion characteristics of a given data stream. We adopt an approach to detect local minima in the temporal variation of motion speed. In the developed algorithm, the intensity of each local minimum is first evaluated by using a set of signals; it is obtained by applying a set of low-pass filters to a one-dimensional motion-speed data stream. The cut-off frequencies of the filters are distributed over a wide frequency range. By adding up the speed-descent values of each local minimum over all the signals, we exhaustively obtain the information on its intensity provided at all the time-scale levels covered by a given data stream. Then, the obtained intensity values are categorized by a clustering algorithm; the local minima categorized as those of little significance are deleted and the remaining ones are fixed as those giving keyposes. Experimental results showed that the present method provided results comparable to the best of those given by the methods previously proposed. This was achieved without readjusting the values of parameters used in the algorithm. Readjustment was indispensable for the other methods to obtain good results.------------------------------This is a preprint of an article intended for publication Journal ofInformation Processing(JIP). This preprint should not be cited. Thisarticle should be cited as: Journal of Information Processing Vol.22(2014) No.1 (online)DOI http://dx.doi.org/10.2197/ipsjjip.22.67------------------------------
収録刊行物
-
- 情報処理学会論文誌
-
情報処理学会論文誌 54 (12), 2013-12-15
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1050001337904354048
-
- NII論文ID
- 110009646897
-
- NII書誌ID
- AN00116647
-
- ISSN
- 18827764
-
- Web Site
- http://id.nii.ac.jp/1001/00096748/
-
- 本文言語コード
- en
-
- 資料種別
- journal article
-
- データソース種別
-
- IRDB
- CiNii Articles