Kang Zhao

Dr. Kang Zhao


Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
15 October 2024 in Natural Hazards
Verified
Journal Article
Open access
PDF file
JLJia Li
Jia Li
CFChengpeng Fan
Chengpeng Fan
KZKang Zhao
Kang Zhao
ZZZhike Zhang
Zhike Zhang
PDPing Duan
Ping Duan
Research on landslide displacement prediction based on interferometric synthetic aperture radar (InSAR) deformation data involves two main issues. First, InSAR can provide only one-dimensional deformation data along the satellite’s line of sight (LOS), which cannot truly reflect the deformation of the landslide body in the downward direction along the slope. Second, the use of a single prediction model does not adequately account for both long-term and local changes in landslide displacement, affecting the accuracy of the predictions. To address this, in this study, Long Short-Term Memory networks (LSTM) and temporal convolutional network (TCN) models are combined to construct a method (LSTM-TCN) of landslide displacement prediction. This method can consider the long-term and localized changes in landslide displacement. The method is first based on InSAR technology to obtain surface deformation. The deformation of the landslide is subsequently computed in the downward direction along the slope to obtain the landslide displacement time series data. Next, the LSTM-TCN is used for landslide displacement prediction. Finally, the mean absolute error (MAE), root mean square error (RMSE) and coefficient of determination (R2) are used to evaluate the performance of the model. The experiment is conducted on the Xiao Andong landslide in Anshi village, Fengqing County, Lincang City, Yunnan Province, China. The LSTM-TCN model achieves an R2 of 0.75, an RMSE of 0.43 cm, and an MAE of 0.36 cm. Compared with the individual LSTM and TCN models, the LSTM-TCN model exhibits the highest prediction accuracy and the smallest prediction error, which is closer to the true result that in the other models. These results demonstrate that the combined LSTM-TCN model effectively captures the complex features and long-term trends in landslide displacement data, significantly enhancing the accuracy of predictions.

20 April 2022 in IEEE Access
Verified
Journal Article
Open access
KZKang Zhao
Kang Zhao
JLJingjing Liu
Jingjing Liu
QWQingnan Wang
Qingnan Wang
XWXianjun Wu
Xianjun Wu
JTJihui Tu
Jihui Tu
Road is one of important traffic lifelines that could be damaged after disaster by landslide rubble, buildings debris, and collapsed branches of trees. Therefore, road damage detection and assessment using post-Disaster High-Resolution Remote Sensing Images is extremely important for finding optimal paths and conducting rescue missions. In an emergency context, the existing methods based on change detection for road damage detection are difficult to achieve due to the mismatch of different data sources, especially for rural areas where the pre-disaster remote sensing imagery are hard to obtain. In this paper, a novel method based on the Tracking, Learning, and Detector (TLD) framework for detecting the damaged road region from post-disaster high-resolution remote sensing image is presented. First, a spoke wheel operator is employed to define the initial template of road. Then, the TLD framework is used to identify the suspected road damaged areas. Finally, the damaged road areas are extracted by pruning the false damaged roads. The proposed method was evaluated using post-disaster high-resolution remote sensing images collected over Beichuan, China in 2008 and Lushan, China in 2013. The results show that the proposed method is feasible and effective for road damage detection and assessment. Our main conclusion is that such an approach qualifies for practical use.

MYMei Yang
Mei Yang
HFHong Fan
Hong Fan
KZKang Zhao
Kang Zhao
Particulate matter with a diameter of less than 2.5 μ m (PM2.5) has damaged public health globally for a decade. Accurate forecasts of PM2.5 concentration can provide early warnings to prevent the public from hazard exposure. However, existing methods have not considered the available spatiotemporal data sufficiently due to their architecture or inadequate input, and most neglected wind impact on spatiotemporal correlation when selecting related sites. To fill this gap, we proposed a long short-term memory-convolutional neural network based on dynamic wind field distance (LSTM-CNN-DWFD) to predict PM2.5 concentration of a specific site for the next 24 h. A KNN method based on dynamic wind field distance was developed and applied to select highly related sites considering wind impact. A local stateful LSTM model was employed to capture temporal correlations in historical air quality and meteorological data for each related site. Then, these temporal features were integrated as a spatiotemporal matrix, and input into CNN for extracting spatiotemporal correlation features. Weather forecasts were also integrated into the model to promote accuracy. Hourly PM2.5 data from 36 monitoring sites in Beijing, China collected from 1 May 2014 to 30 April 2015 were used as experimental dataset. Six-fold rolling origin method was employed to conduct experiments on each site, and the results of 216 experiments validated the performance of the proposed LSTM-CNN-DWFD model. The mean R 2 values of the next 1–6 h prediction were 0.85, 0.81, 0.76, 0.70, 0.64, and 0.59, respectively, showing a decrease trend, indicating that the prediction accuracy decreases as the prediction time increases. Comparisons of LSTM-CNN-DWFD results to results from six other methods show that it delivered higher accuracy PM2.5 predictions, with the mean RMSE (MAE) of 1–6, 7–12, and 13–24 h prediction were 43.90 (29.17), 57.89 (42.16), and 63.14 (47.64), respectively. The results also demonstrate that the sites selected based on dynamic wind field distance are more related to the central site than that based on geographical distance, also contributing to prediction accuracy.

Verified
Journal Article
Open access
PDF file
KZKang Zhao
Kang Zhao
BJBaoxuan Jin
Baoxuan Jin
HFHong Fan
Hong Fan
WSWeiwei Song
Weiwei Song
SZSunyu Zhou
Sunyu Zhou
YJYuanyi Jiang
Yuanyi Jiang
Overlay analysis is a common task in geographic computing that is widely used in geographic information systems, computer graphics, and computer science. With the breakthroughs in Earth observation technologies, particularly the emergence of high-resolution satellite remote-sensing technology, geographic data have demonstrated explosive growth. The overlay analysis of massive and complex geographic data has become a computationally intensive task. Distributed parallel processing in a cloud environment provides an efficient solution to this problem. The cloud computing paradigm represented by Spark has become the standard for massive data processing in the industry and academia due to its large-scale and low-latency characteristics. The cloud computing paradigm has attracted further attention for the purpose of solving the overlay analysis of massive data. These studies mainly focus on how to implement parallel overlay analysis in a cloud computing paradigm but pay less attention to the impact of spatial data graphics complexity on parallel computing efficiency, especially the data skew caused by the difference in the graphic complexity. Geographic polygons often have complex graphical structures, such as many vertices, composite structures including holes and islands. When the Spark paradigm is used to solve the overlay analysis of massive geographic polygons, its calculation efficiency is closely related to factors such as data organization and algorithm design. Considering the influence of the shape complexity of polygons on the performance of overlay analysis, we design and implement a parallel processing algorithm based on the Spark paradigm in this paper. Based on the analysis of the shape complexity of polygons, the overlay analysis speed is improved via reasonable data partition, distributed spatial index, a minimum boundary rectangular filter and other optimization processes, and the high speed and parallel efficiency are maintained.

Verified
Journal Article
Open access
PDF file
YYYuqi Yang
Yuqi Yang
XZXiaoqing Zuo
Xiaoqing Zuo
KZKang Zhao
Kang Zhao
YLyongfa li
yongfa li
The widespread use of Light Detection and Ranging (LiDAR) technology has led to a surge in three-dimensional point cloud data; although, it also poses challenges in terms of data storage and indexing. Efficient storage and management of LiDAR data are prerequisites for data processing and analysis for various LiDAR-based scientific applications. Traditional relational database management systems and centralized file storage struggle to meet the storage, scaling, and specific query requirements of massive point cloud data. However, NoSQL databases, known for their scalability, speed, and cost-effectiveness, provide a viable solution. In this study, a 3D point cloud indexing strategy for mobile LiDAR point cloud data that integrates Hilbert curves, R*-trees, and B+-trees was proposed to support MongoDB-based point cloud storage and querying from the following aspects: (1) partitioning the point cloud using an adaptive space partitioning strategy to improve the I/O efficiency and ensure data locality; (2) encoding partitions using Hilbert curves to construct global indices; (3) constructing local indexes (R*-trees) for each point cloud partition so that MongoDB can natively support indexing of point cloud data; and (4) a MongoDB-oriented storage structure design based on a hierarchical indexing structure. We evaluated the efficacy of chunked point cloud data storage with MongoDB for spatial querying and found that the proposed storage strategy provides higher data encoding, index construction and retrieval speeds, and more scalable storage structures to support efficient point cloud spatial query processing compared to many mainstream point cloud indexing strategies and database systems.

MYMei Yang
Mei Yang
HFHong Fan
Hong Fan
KZKang Zhao
Kang Zhao
Aiming at improving the air quality and protecting public health, policies such as restricting factories, motor vehicles, and fireworks have been widely implemented. However, fine-grained spatiotemporal analysis of these policies’ effectiveness is lacking. This paper collected the hourly meteorological and PM2.5 data for three typical emission scenarios in Hubei, Beijing–Tianjin–Hebei (BTH), and Yangtze River Delta (YRD). Then, this study simulated the PM2.5 concentration under the same meteorological conditions and different emission scenarios based on a reliable hourly spatiotemporal random forest model ( R 2 exceeded 0.84). Finally, we investigated the fine-grained spatiotemporal impact of restricting factories, vehicles, and fireworks on PM2.5 concentrations from the perspective of hours, days, regions, and land uses, excluding meteorological interference. On average, restricting factories and vehicles reduced the PM2.5 concentration at 02:00, 08:00, 14:00, and 20:00 by 18.57, 16.22, 25.00, and 19.07 μ g / m 3 , respectively. Spatially, it had the highest and quickest impact on Hubei, with a 27.05 μ g / m 3 decrease of PM2.5 concentration and 17 day lag to begin to show significant decline. This was followed by YRD, which experienced a 23.52 μ g / m 3 decrease on average and a 23 day lag. BTH was the least susceptible; the PM2.5 concentration decreased by only 8.2 μ g / m 3 . In addition, influenced by intensive human activities, the cultivated, urban, and rural lands experienced a larger decrease in PM2.5 concentration. These empirical results revealed that restricting factories, vehicles, and fireworks is effective in alleviating air pollution and the effect showed significant spatiotemporal heterogeneity. The policymakers should further investigate influential factors of hourly PM2.5 concentrations, combining with local geographical and social environment, and implement more effective and targeted policies to improve local air quality, especially for BTH and the air quality at morning and night.