Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Data augmentation method for abnormal elevator passenger behaviors based on dynamic graph convolutional network
Shixiong KUANG, Junbo YAO, Jiawei LU, Qibing WANG, Gang XIAO
Journal of Computer Applications    2025, 45 (10): 3187-3194.   DOI: 10.11772/j.issn.1001-9081.2024101445
Abstract74)   HTML0)    PDF (3930KB)(29)       Save

The problems of low accuracy and poor generalization performance in recognizing abnormal behaviors of elevator passengers are due to the lack of sufficient diverse abnormal behavior data. To address these issues, a Dynamic Graph Convolutional Network-based Behavior data Augmentation (DGCN-BA) method was proposed. Firstly, a dynamic graph convolutional network was constructed to capture spatial relationships and motion correlations among different human joints in the behaviors of elevator passengers. Secondly, these features were utilized to enhance pose data, thereby generating richer and more reasonable pose sequences. Finally, the pose sequences were used to construct human actions in a virtual elevator scene, and lot of abnormal behavior video data for elevator passengers were generated. To validate the effectiveness of DGCN-BA, experiments were conducted on public datasets Human3.6M, 3DHP, MuPoTS-3D, and a self-constructed dataset. Experimental results show that compared to data augmentation methods JMDA (Joint Mixing Data Augmentation) and DDPMs (Denoising Diffusion Probabilistic Models), DGCN-BA reduces the Mean Per Joint Position Error (MPJPE) on the Human3.6M dataset by 2.9 mm and 1.5 mm, respectively. It can be seen that DGCN-BA can complete pose estimation tasks more effectively, generates diverse and reasonable abnormal behavior data, and improves the recognition effect of video-based elevator passenger abnormal behaviors significantly.

Table and Figures | Reference | Related Articles | Metrics
An RNA Secondary Structure Prediction Algorithm Based on Fast Dynamic Weighted Matching
Jiawei LUO Zheng PENG
Journal of Computer Applications   
Abstract1492)      PDF (609KB)(1048)       Save
On the basis of dynamic weighted matching algorithm, this paper introduced an RNA secondary structure prediction algorithm based on fast dynamic weighted matching. In order to reduce time complicated degree and to improve the ability of pseudoknot prediction, we employed fast searching of max dynamic weight stem algorithm and expanded searching area of pseudoknot respectively. As a result, compared with dynamic weighted matching algorithm, the fast dynamic weighted matching algorithm not only has better time complicated degree which is O(n3), but also can predict more possibly existing pseudoknots.
Related Articles | Metrics