论文标题

使用高斯突变的粒子群优化的新型基于骨架的人类活动发现

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

论文作者

Hadikhani, Parham, Lai, Daphne Teck Ching, Ong, Wee-Hong

论文摘要

人类活动发现旨在将人类所做的活动聚集,而无需任何有关定义每个活动的事先信息。在人类活动识别中介绍的大多数方法都是监督的,其中标有训练系统的输入。实际上,由于其庞大的量和人类活动的多样性,很难标记活动数据。本文提出了一个无监督的框架,以在3D骨骼序列中进行人类活动发现。首先,提出了数据预处理的方法。在此阶段,根据动能选择了重要的框架。接下来,提取关节,统计位移,角度和方向特征的位移以表示活动信息。由于并非所有提取的功能都具有有用的信息,因此使用PCA缩小了功能的尺寸。为人类活动发现提出的大多数方法并未完全无监督。在对活动进行分类之前,他们使用预分段的视频。为了解决这个问题,我们使用了一个滑动时间窗口来细分一些重叠的时间序列。然后,我们提出的使用高斯突变和K-均值(HPGMK)算法的杂种粒子群优化(PSO)发现了活动,以提供多种溶液。 PSO由于其直接的想法和强大的全球搜索能力而被使用,可以在一些迭代中识别理想的解决方案。最后,将k均值应用于PSO的每次迭代的结果质心,以克服PSO的缓​​慢收敛速率。五个数据集的实验结果表明,与其他最先进的方法相比,所提出的框架在发现活动方面具有较高的性能,并且平均准确性至少为4%。

Human activity discovery aims to cluster the activities performed by humans without any prior information on what defines each activity. Most methods presented in human activity recognition are supervised, where there are labeled inputs to train the system. In reality, it is difficult to label activities data because of its huge volume and the variety of human activities. This paper proposes an unsupervised framework to perform human activity discovery in 3D skeleton sequences. First, an approach for data pre-processing is presented. In this stage, important frames are selected based on kinetic energy. Next, the displacement of joints, statistical displacements, angles, and orientation features are extracted to represent the activities information. Since not all extracted features have useful information, the dimension of features is reduced using PCA. Most methods proposed for human activity discovery are not fully unsupervised. They use pre-segmented videos before categorizing activities. To deal with this, we have used a sliding time window to segment the time series of activities with some overlapping. Then, activities are discovered by our proposed Hybrid Particle swarm optimization (PSO) with Gaussian Mutation and K-means (HPGMK) algorithm to provide diverse solutions. PSO is used due to its straightforward idea and powerful global search capability which can identify the ideal solution in a few iterations. Finally, k-means is applied to the outcome centroids from each iteration of the PSO to overcome the slow convergence rate of PSO. The experiment results on five datasets show that the proposed framework has superior performance in discovering activities compared to the other state-of-the-art methods and has increased accuracy of at least 4% on average.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源