Zhongming Jin

Zhongming Jin

Auto-generated profile, based on publicly available information

Zhongming Jin

Alibaba Damo Academy, Alibaba Group, Hangzhou, China

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 September 2020 in IEEE Access
Verified
Journal Article
Open access
KCKen Chen
Ken Chen
FCFei Chen
Fei Chen
BLBaisheng Lai
Baisheng Lai
ZJZhongming Jin
Zhongming Jin
YLYong Liu
Yong Liu
XHXian-Sheng Hua
Xian-Sheng Hua
Forecasting future traffic flows from previous ones is a challenging problem because of their complex and dynamic nature of spatio-temporal structures. Most existing graph-based CNNs attempt to capture the static relations while largely neglecting the dynamics underlying sequential data. In this paper, we present dynamic spatio-temporal graph-based CNNs (DST-GCNNs) by learning expressive features to represent spatiotemporal structures and predict future traffic flows from surveillance video data. In particular, DST-GCNN is a two stream network. In the flow prediction stream, we present a novel graph-based spatio-temporal convolutional layer to extract features from a graph representation of traffic flows. Then several such layers are stacked together to predict future flows over time. Meanwhile, the relations between traffic flows in the graph are often time variant as the traffic condition changes over time. To capture the graph dynamics, we use the graph prediction stream to predict the dynamic graph structures, and the predicted structures are fed into the flow prediction stream. Experiments on real datasets demonstrate that the proposed model achieves competitive performances compared with the other state-of-the-art methods.

9 December 2019 in IEEE Access
Verified
Journal Article
Open access
LWLong Wei
Long Wei
ZYZhengxu Yu
Zhengxu Yu
ZJZhongming Jin
Zhongming Jin
LXLiang Xie
Liang Xie
JHjianqiang huang
jianqiang huang
XHXian-Sheng Hua
Xian-Sheng Hua
Traffic forecasting is the task of predicting future traffic based on historical traffic data. It is challenging due to the complex spatial-temporal correlation on road networks. Most existing research works use sequential Graph Neural Networks (GNN) to model traffic inference. However, they only focus on nodes (intersections) or edges (road segments) traffic forecasting alone. As a result, they could hardly provide a complete description of future traffic on road networks. Actually, nodes and edges traffic are interrelated. Both of them are important for traffic safety and efficiency, and neither one is negligible. In this paper, we exploit nodes and edges information together and make traffic forecasting on nodes and edges simultaneously. We propose a novel dual graph framework, called DualGraph, to model the propagation behavior of traffic on road networks. Inside our framework, we develop a DualMap block to simulate the recursive interactions between nodes and edges. The interaction process is realized by a message passing mechanism of nearby information flow. We employ the Simulation of Urban MObility (SUMO) software to generate real-world traffic data to illustrate the effectiveness of our method. We also empirically evaluate our model on public traffic datasets. The results show that even for node or edge traffic forecasting alone, our model still outperforms compared ones, especially for long term (one hour) prediction.

1 January 2015 in Neurocomputing
Verified
Journal Article
Closed access
YHYao Hu
Yao Hu
ZJZhongming Jin
Zhongming Jin
YSYi Shi
Yi Shi
DZDebing Zhang
Debing Zhang
DCDeng Cai
Deng Cai
XHXiaofei He
Xiaofei He

14 April 2021 in IEEE Access
Verified
Journal Article
Open access
KCKen Chen
Ken Chen
YTYong Tang
Yong Tang
LWLong Wei
Long Wei
Pengfei WangPengfei Wang
Pengfei Wang
YLYong Liu
Yong Liu
ZJZhongming Jin
Zhongming Jin
In the past few years, sparse subspace clustering (SSC) has gained many studies and found wide applications. However, SSC suffers from the limitation in scalability. Furthermore, current SSC methods could hardly tackle stream data where the structure of subspaces may change along time. In this paper, we propose a novel method to extend SSC to stream data (StreamSSC). Our method is based on maintaining a small subset of representatives to characterize the structure of the underlying subspaces during stream data. StreamSSC is efficient in both computation and memory. Experimental results on both synthetic and real-world streams demonstrate the effectiveness of StreamSSC. For efficiency, StreamSSC is faster than existing online subspace clustering methods by roughly a magnitude.