期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Physical-barrier detection based collective motion analysis
1
作者 Gaoqi HE Qi CHEN +2 位作者 Dongxu JIANG Yubo YUAN Xingjian LU 《Frontiers of Computer Science》 SCIE EI CSCD 2019年第2期426-436,共11页
Collective motion is one of the most fascinating phenomena and mainly caused by the interactions between individuals. Physical-barriers, as the particular facilities which divide the crowd into different lanes, greatl... Collective motion is one of the most fascinating phenomena and mainly caused by the interactions between individuals. Physical-barriers, as the particular facilities which divide the crowd into different lanes, greatly affect the measurement of such interactions. In this paper we propose the physical-barrier detection based collective motion analysis (PDCMA) approach. The main idea is that the interaction between spatially adjacent pedestrians actually does not exist if they are separated by the physical-barrier. Firstly, the physical-barriers are extracted by two-stage clustering. The scene is automatically divided into several motion regions. Secondly, local region collectiveness is calculated to represent the interactions between pedestrians in each region. Finally, extensive evaluations use the three typical methods, i.e., the PDCMA, the Collectiveness, and the average normalized Velocity, to show the efficiency and efficacy of our approach in the scenes with and without physical barriers. Moreover, several escalator scenes are selected as the typical physical-barrier test scenes to demonstrate the performance of our approach. Compared with the current collective motion analysis methods, our approach better adapts to the scenes with physical barriers. 展开更多
关键词 crowd behavior analysis COLLECTIVE motion physical-barrier DETECTION TWO-STAGE CLUSTERING local region collectiveness
原文传递
Over-Smoothing Algorithm and Its Application to GCN Semi-supervised Classification
2
作者 Mingzhi Dai Weibin Guo Xiang Feng 《国际计算机前沿大会会议论文集》 2020年第2期197-215,共19页
The feature information of the local graph structure and the nodes may be over-smoothing due to the large number of encodings,which causes the node characterization to converge to one or several values.In other words,... The feature information of the local graph structure and the nodes may be over-smoothing due to the large number of encodings,which causes the node characterization to converge to one or several values.In other words,nodes from different clusters become difficult to distinguish,as two different classes of nodes with closer topological distance are more likely to belong to the same class and vice versa.To alleviate this problem,an over-smoothing algorithm is proposed,and a method of reweighted mechanism is applied to make the tradeoff of the information representation of nodes and neighborhoods more reasonable.By improving several propagation models,including Chebyshev polynomial kernel model and Laplace linear 1st Chebyshev kernel model,a new model named RWGCN based on different propagation kernels was proposed logically.The experiments show that satisfactory results are achieved on the semi-supervised classification task of graph type data. 展开更多
关键词 GCN Chebyshev polynomial kernel model Laplace linear 1st Chebyshev kernel model Over-smoothing Reweighted mechanism
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部