A Novel Skeleton-Based Human Activity Discovery Using Particle Swarm Optimization With Gaussian Mutation

被引:4
作者
Hadikhani, Parham [1 ]
Lai, Daphne Teck Ching [1 ]
Ong, Wee-Hong [1 ]
机构
[1] Univ Brunei Darussalam, Sch Digital Sci, BE-1410 Gadong, Brunei
关键词
Feature extraction; Data mining; Principal component analysis; Clustering algorithms; Training; Convolutional neural networks; Skeleton; Clustering; dimension reduction; feature extraction; human activity discovery; particle swarm optimization (PSO); skeleton sequence; unsupervised learning; EVOLUTIONARY COMPUTATION; ACTION RECOGNITION; ALGORITHM; CLASSIFICATION; ENSEMBLE;
D O I
10.1109/THMS.2023.3269047
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Human activity discovery aims to cluster human activities without any prior knowledge of what defines each activity. However, most existing methods for human activity recognition are supervised, relying on labeled inputs for training. In reality, it is challenging to label human activity data due to its large volume and the diversity of human activities. To address this issue, this article proposes an unsupervised framework for human activity discovery in 3-D skeleton sequences. The framework includes a data preprocessing step that selects important frames based on kinetic energy and extracts relevant features, such as joint displacement, statistical displacement, angles, and orientation. To reduce the dimensionality of the extracted features, the framework uses principle component analysis. Unlike many other methods for human activity discovery, the proposed framework is fully unsupervised and does not rely on presegmented videos. To segment the time series of activities, the framework uses a sliding time window with some overlapping. The hybrid particle swarm optimization (PSO) with Gaussian mutation and K-means algorithm is then proposed to discover the activities. PSO is chosen for its powerful global search capability and simple implementation. To further improve the convergence rate of PSO, K-means is applied to the outcome centroids from each iteration of PSO. The experimental results on five datasets demonstrate that the proposed framework has superior performance in discovering activities compared to other state-of-the-art methods. The framework achieves an average increase in accuracy of at least 4%.
引用
收藏
页码:538 / 548
页数:11
相关论文
共 62 条
[51]  
Wanget, 2021, IEEE T CIRC SYST VID, V32, P210
[52]   Multi-Scale Mixed Dense Graph Convolution Network for Skeleton-Based Action Recognition [J].
Xia, Hailun ;
Gao, Xinkai .
IEEE ACCESS, 2021, 9 (09) :36475-36484
[53]  
Xia L., 2012, 2012 IEEE COMP SOC C, P20
[54]   Triple Archives Particle Swarm Optimization [J].
Xia, Xuewen ;
Gui, Ling ;
Yu, Fei ;
Wu, Hongrun ;
Wei, Bo ;
Zhang, Ying-Long ;
Zhan, Zhi-Hui .
IEEE TRANSACTIONS ON CYBERNETICS, 2020, 50 (12) :4862-4875
[55]   Skeleton-based human activity recognition using ConvLSTM and guided feature learning [J].
Yadav, Santosh Kumar ;
Tiwari, Kamlesh ;
Pandey, Hari Mohan ;
Akbar, Shaik Ali .
SOFT COMPUTING, 2022, 26 (02) :877-890
[56]   Synergetic information bottleneck for joint multi-view and ensemble clustering [J].
Yan, Xiaoqiang ;
Ye, Yangdong ;
Qiu, Xueying ;
Yu, Hui .
INFORMATION FUSION, 2020, 56 :15-27
[57]  
Yang B, 2017, PR MACH LEARN RES, V70
[58]  
Yari M., 2020, J. Telecommun. Digit. Economy, V8, P68
[59]   Learning-Aided Evolution for Optimization [J].
Zhan, Zhi-Hui ;
Li, Jian-Yu ;
Kwong, Sam ;
Zhang, Jun .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2023, 27 (06) :1794-1808
[60]   A survey on evolutionary computation for complex continuous optimization [J].
Zhan, Zhi-Hui ;
Shi, Lin ;
Tan, Kay Chen ;
Zhang, Jun .
ARTIFICIAL INTELLIGENCE REVIEW, 2022, 55 (01) :59-110