Sequential Unsupervised Motion Segmentation for Skill Evaluation and Comparison

In recent years, the evaluation of motion skills in fields such as dance and exercise has benefited from the proliferation of motion-capture technologies. This study proposes a computationally efficient method for segmenting and comparing time-series human motion data across individuals with varying skill levels. The method extends the Gaussian process hidden semi-Markov model (GP-HSMM) by incorporating random Fourier features (RFF), enabling motion segments to be modeled through linear regression and significantly reducing computational complexity. We also introduce sequential learning to support the incremental adaptation of the model to new individuals, which facilitates quantitative motion comparisons on a per-segment and per-joint basis. To preserve segmentation accuracy despite the approximation introduced by RFF, we optimize the kernel parameters using the Metropolis-Hastings algorithm within a Markov chain Monte Carlo (MCMC) framework. Experiments on publicly available exercise and dance datasets show that the proposed method achieves segmentation performance similar to GP-HSMM while reducing training time from several days to minutes. Moreover, the method supports the quantitative visualization of motion-skill differences, illustrated through a joint-level analysis of choreographic elements performed by dancers with different skill levels.

Authors

Institutions

Publication Details

Journal
IEEE Access
Published
2025-01-01
DOI
https://doi.org/10.1109/access.2025.3644927
Primary Topic
Human Motion and Animation
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Sequential Unsupervised Motion Segmentation for Skill Evaluation and Comparison

K. Kajiwara, Koki Mimura, Tomoaki Nakamura, Daichi Mochihashi et al.
IEEE Access
Human Motion and Animation
article

Sequential Unsupervised Motion Segmentation for Skill Evaluation and Comparison

K. Kajiwara, Koki Mimura, Tomoaki Nakamura, Daichi Mochihashi, I. Saito
article en

Abstract

In recent years, the evaluation of motion skills in fields such as dance and exercise has benefited from the proliferation of motion-capture technologies. This study proposes a computationally efficient method for segmenting and comparing time-series human motion data across individuals with varying skill levels. The method extends the Gaussian process hidden semi-Markov model (GP-HSMM) by incorporating random Fourier features (RFF), enabling motion segments to be modeled through linear regression and significantly reducing computational complexity. We also introduce sequential learning to support the incremental adaptation of the model to new individuals, which facilitates quantitative motion comparisons on a per-segment and per-joint basis. To preserve segmentation accuracy despite the approximation introduced by RFF, we optimize the kernel parameters using the Metropolis-Hastings algorithm within a Markov chain Monte Carlo (MCMC) framework. Experiments on publicly available exercise and dance datasets show that the proposed method achieves segmentation performance similar to GP-HSMM while reducing training time from several days to minutes. Moreover, the method supports the quantitative visualization of motion-skill differences, illustrated through a joint-level analysis of choreographic elements performed by dancers with different skill levels.

IEEE AccessVol. 13
University of Electro-Communications (JP), National Center of Neurology and Psychiatry (JP), The Institute of Statistical Mathematics (JP)
Openalex Percentile: Top 50%
Human Motion and Animation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.