Haizhong Qian

Prof. Haizhong Qian


Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
Verified
Journal Article
Open access
PDF file
DWDi Wang
Di Wang
HQHaizhong Qian
Haizhong Qian
Existing research on automatic river network classification methods has difficulty scientifically quantifying and determining feature threshold settings and evaluating weights when calculating multi-indicator features of the local and overall structures of river reaches. In order to further improve the accuracy of river network classification and evaluate the feature weight, this paper proposes an automatic grading method for river networks based on ensemble learning in CatBoost. First, the graded river network based on expert knowledge is taken as the case; with the support of the existing case results, a total of eight features from the semantic, geometric, and topological aspects of the river network were selected for calculation. Second, the classification model, obtained through learning and training, was used to calculate the classification results of the main stream and tributaries of the river reach to be classified. Furthermore, the main stream river reaches were connected, and the main stream rivers at different levels were hierarchized to achieve river network classification. Finally, the Shapley Additive explanation (SHAP) framework for interpreting machine learning models was introduced to test the influence of feature terms on the classification results from the global and local aspects, so as to improve the interpretability and transparency of the model. Performance evaluation can determine the advantages and disadvantages of the classifier, improve the classification effect and practicability of the classifier, and improve the accuracy and reliability of river network classification. The experiment demonstrates that the proposed method achieves expert-level imitation and has higher accuracy for identifying the main stream and tributaries of river networks. Compared with other classification algorithms, the accuracy was improved by 0.85–5.94%, the precision was improved by 1.82–9.84%, and the F1_Score was improved by 0.8–5.74%. In this paper, CatBoost is used for river network classification for the first time, and SHAP is used to explain the influence of characteristics, which improves the accuracy of river network classification and enhances the interpretability of the classification method. By constructing a reasonable hierarchy, a better grading effect can be achieved, and the intelligence level of automatic grading of river networks can be further improved.

Verified
Journal Article
Open access
PDF file
XGXuan Guo
Xuan Guo
JLJunnan Liu
Junnan Liu
FWFang Wu
Fang Wu
HQHaizhong Qian
Haizhong Qian
As an essential role in cartographic generalization, road network selection produces basic geographic information across map scales. However, the previous selection methods could not simultaneously consider both attribute characteristics and spatial structure. In light of this, an intelligent road network selection method based on a graph neural network (GNN) is proposed in this paper. Firstly, the selection case is designed to construct a sample library. Secondly, some neighbor sampling and aggregation rules are developed to update road features. Then, a GNN-based selection model is designed to calculate classification labels, thus completing road network selection. Finally, a few comparative analyses with different selection methods are conducted, verifying that most of the accuracy values of the GNN model are stable over 90%. The experiments indicate that this method could aggregate stroke nodes and their neighbors together to synchronously preserve semantic, geometric, and topological features of road strokes, and the selection result is closer to the reference map. Therefore, this paper could bridge the distance between deep learning and cartographic generalization, thus facilitating a more intelligent road network selection method.

16 December 2021 in Journal of Geovisualization and Spatial Analysis
Verified
Journal Article
Closed access
PDF file
LYLinyi Yu
Linyi Yu
JDJiawei Du
Jiawei Du
RZRenjian Zhai
Renjian Zhai
FWFang WU
Fang WU
HQHaizhong Qian
Haizhong Qian

24 September 2021 in Sustainability
Verified
Journal Article
Open access
PDF file
XGXuan Guo
Xuan Guo
HQHaizhong Qian
Haizhong Qian
FWFang Wu
Fang Wu
JLJunnan Liu
Junnan Liu
Global problems all occur at a particular location on or near the Earth’s surface. Sitting at the junction of artificial intelligence (AI) and big data, knowledge graphs (KGs) organize, interlink, and create semantic knowledge, thus attracting much attention worldwide. Although the existing KGs are constructed from internet encyclopedias and contain abundant knowledge, they lack exact coordinates and geographical relationships. In light of this, a geographical knowledge graph (GeoKG) construction method based on multisource data is proposed, consisting of a modeling schema layer and a filling data layer. This method has two advantages: (1) the knowledge can be extracted from geographic datasets; (2) the knowledge on multisource data can be represented and integrated. Firstly, the schema layer is designed to represent geographical knowledge. Then, the methods of extraction and integration from multisource data are designed to fill the data layer, and a storage method is developed to associate semantics with geospatial knowledge. Finally, the GeoKG is verified through linkage rate, semantic relationship rate, and application cases. The experiments indicate that the method could automatically extract and integrate knowledge from multisource data. Additionally, our GeoKG has a higher success rate of linking web pages with geographic datasets, and its exact coordinates have increased to 100%. This paper could bridge the distance between a Geographic Information System and a KG, thus facilitating more geospatial applications.

Verified
Journal Article
Open access
PDF file
HQHaizhong Qian
Haizhong Qian
Meng ZhangMeng Zhang
Meng Zhang
FWFang WU
Fang WU
As one of the key operators of automated map generalization, algorithms for the line simplification have been widely researched in the past decades. Although many of the currently available algorithms have revealed satisfactory simplification performances with certain data types and selected test areas, it still remains a challenging task to solve the problems of (a) how to properly divide a cartographic line when it is too long to be dealt with directly; and (b) how to make adaptable parameterizations for various geo-data in different areas. In order to solve these two problems, a new line-simplification approach based on the Oblique-Dividing-Curve (ODC) method has been proposed in this paper. In this proposed model, one cartographic line is divided into a series of monotonic curves by the ODC method. Then, the curves are categorized into different groups according to their shapes, sizes and other geometric characteristics. The curves in different groups will trigger different strategies as well as the associated criteria for line simplification. Whenever a curve is simplified, the whole simplified cartographic line will be re-divided and the simplification process restarts again, i.e., the proposed simplification approach is iteratively operated until the final simplification result is achieved. Experiment evidence demonstrates that the proposed approach is able to handle the holistic bend-trend of the whole cartographic line during the simplification process and thereby provides considerably improved simplification performance with respect to maintaining the essential shape/salient characteristics and keeping the topological consistency. Moreover, the produced simplification results are not sensitive to the parameterizations of the proposed approach.

24 December 2022 in Remote Sensing
Verified
Journal Article
Open access
PDF file
Yue QiuYue Qiu
Yue Qiu
FWFang WU
Fang WU
HQHaizhong Qian
Haizhong Qian
RZRenjian Zhai
Renjian Zhai
XGXianyong Gong
Xianyong Gong
AWandong wang
andong wang
Convolutional neural networks (CNNs) perform well in tasks of segmenting buildings from remote sensing images. However, the intraclass heterogeneity of buildings is high in images, while the interclass homogeneity between buildings and other nonbuilding objects is low. This leads to an inaccurate distinction between buildings and complex backgrounds. To overcome this challenge, we propose an Attentional Feature Learning Network (AFL-Net) that can accurately extract buildings from remote sensing images. We designed an attentional multiscale feature fusion (AMFF) module and a shape feature refinement (SFR) module to improve building recognition accuracy in complex environments. The AMFF module adaptively adjusts the weights of multi-scale features through the attention mechanism, which enhances the global perception and ensures the integrity of building segmentation results. The SFR module captures the shape features of the buildings, which enhances the network capability for identifying the area between building edges and surrounding nonbuilding objects and reduces the over-segmentation of buildings. An ablation study was conducted with both qualitative and quantitative analyses, verifying the effectiveness of the AMFF and SFR modules. The proposed AFL-Net achieved 91.37, 82.10, 73.27, and 79.81% intersection over union (IoU) values on the WHU Building Aerial Imagery, Inria Aerial Image Labeling, Massachusetts Buildings, and Building Instances of Typical Cities in China datasets, respectively. Thus, the AFL-Net offers the prospect of application for successful extraction of buildings from remote sensing images.