Multidimensional Time Series Segmentation of Human Activity Without Prior Knowledge

With the advancement of science and technology, human activity recognition (HAR) has emerged as an important auxiliary technology for smart homes, holding broad application prospects in security monitoring, aging at home, and human-computer interaction. An essential prerequisite for continuous HAR is the segmentation of human activities, where precise segmentation is crucial for accurate recognition. To address this issue, this paper proposes a human activity segmentation method that does not require prior knowledge, i.e., an adaptive human activity multidimensional time series segmentation method based on sample entropy dual-layer hidden Markov model (SEDHM). This method primarily includes an adaptive dimension selection strategy for multidimensional sequences based on sample entropy, a multidimensional sequence segmentation algorithm based on a dual-layer hidden Markov model (HMM), and a weighted cost function for iterative optimization of the algorithm. To validate the effectiveness and robustness of this method, the paper conducts segmentation calibration of continuous human activities in a activity capture dataset using MotionBuilder. Specifically, experimental results indicate that the proposed SEDHM reduces the root mean square error (RMSE) of human activity segmentation by 14.5% compared to four other segmentation algorithms.

Authors

Institutions

Publication Details

Journal
IEEE Internet of Things Journal
Published
2025-04-21
DOI
https://doi.org/10.1109/jiot.2025.3562749
Citations
1
Primary Topic
Time Series Analysis and Forecasting
Type
article
Field-Weighted Citation Impact
1.49
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multidimensional Time Series Segmentation of Human Activity Without Prior Knowledge

Ping Li, Jiye Huang, Ming Jiang, Xudong Lv et al.
1 citations
IEEE Internet of Things Journal
Time Series Analysis and Forecasting
1.49
article

Multidimensional Time Series Segmentation of Human Activity Without Prior Knowledge

Ping Li, Jiye Huang, Ming Jiang, Xudong Lv, Huipin Lin
article en
1 citations

Abstract

With the advancement of science and technology, human activity recognition (HAR) has emerged as an important auxiliary technology for smart homes, holding broad application prospects in security monitoring, aging at home, and human-computer interaction. An essential prerequisite for continuous HAR is the segmentation of human activities, where precise segmentation is crucial for accurate recognition. To address this issue, this paper proposes a human activity segmentation method that does not require prior knowledge, i.e., an adaptive human activity multidimensional time series segmentation method based on sample entropy dual-layer hidden Markov model (SEDHM). This method primarily includes an adaptive dimension selection strategy for multidimensional sequences based on sample entropy, a multidimensional sequence segmentation algorithm based on a dual-layer hidden Markov model (HMM), and a weighted cost function for iterative optimization of the algorithm. To validate the effectiveness and robustness of this method, the paper conducts segmentation calibration of continuous human activities in a activity capture dataset using MotionBuilder. Specifically, experimental results indicate that the proposed SEDHM reduces the root mean square error (RMSE) of human activity segmentation by 14.5% compared to four other segmentation algorithms.

IEEE Internet of Things JournalVol. 12(14)
Hangzhou Dianzi University (CN)
Openalex Percentile: Top 20%
Time Series Analysis and Forecasting
1.49
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.