Zheng Zhang

Dr. Zheng Zhang

orcid

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
3 April 2024 in Symmetry
Verified
Journal Article
Open access
PDF file
XZXiao Zhou
Xiao Zhou
ZZZheng Zhang
Zheng Zhang
XLXinjian Liang
Xinjian Liang
ZSZhan Su
Zhan Su
The commonly used POI route recommendation methods usually ignore the effects of tourists’ interests and transportation geographical conditions, and so may not output the optimal results. To solve the problems, we propose a POI route recommendation model based on symmetrical Naive Bayes classification spatial accessibility (NBCSA) and an improved cockroach swarm optimization algorithm (ICSOA), aiming to recommend POI routes that satisfy tourists’ interests and have the lowest travel costs under tourism transportation geographical conditions. Using the historical POIs visited by tourists as the training set, we construct an improved symmetrical Naive Bayes classification algorithm (NBCA), and the POIs in the destination city are divided into categories by tourists’ preferences. Then we propose an improved NBCSA model to calculate the spatial accessibility field strength (SAFS) for each category’s POIs. Based on the recommended POIs, we propose the ICSOA to recommend optimal POI routes. The experiment verifies that the proposed algorithm can effectively classify the POIs and recommend POIs that best match the tourists’ interests and produce the lowest travel costs. Compared with the TCA and GDA method, the proposed algorithm can output the POI routes with lower travel costs and has higher algorithm execution efficiency. Among the output optimal routes, the proposed algorithm can reduce costs by 5.62% at the lowest and 52.25% at the highest.

9 May 2024 in Electronics
Verified
Journal Article
Open access
PDF file
XZXiao Zhou
Xiao Zhou
ZZZheng Zhang
Zheng Zhang
XLXinjian Liang
Xinjian Liang
ZSZhan Su
Zhan Su
In view of the problems in planning and recommending tour routes, this paper constructs a feature text mining (FTM) method and spatial accessibility model (SAM) as the key factors for scenic spot recommendation (SSR) and tour route recommendation (TRR). The scenic spot clustering algorithm (SSCA) based on FTM was constructed by tourists’ text evaluation data mining. Considering the spatial attributes of scenic spots, the scenic spot topology tree algorithm (SSTTA) based on dynamic buffer spatial accessibility (DBSA) was constructed. The optimal scenic spots were recommended based on interest matching and spatial accessibility optimization. As to the recommended scenic spots, this paper proposes an optimal tour route recommendation algorithm (TRRA) based on SSTTA, which aims to determine the optimal adjacent section path structure tree (ASPST) with the lowest cost under travel constraints and transportation modes. The experiment verifies that the proposed algorithm can recommend scenic spots that match tourists’ interests and have optimal spatial accessibility, and the optimal tour routes with the lowest costs under certain travel constraints. Compared with the searched sub-optimal tour routes, the optimal tour route recommended by the proposed algorithm produces the lowest travel costs, and all the scenic spots in the tour route meet the tourists’ interests. Compared with the commonly used BDMA and GDMA methods, the proposed algorithm can determine the optimal routes with lower travel costs.

Verified
Journal Article
Open access
PDF file
ZZZheng Zhang
Zheng Zhang
CZChenghu Zhou
Chenghu Zhou
MCMinjie Chen
Minjie Chen
YCYibing Cao
Yibing Cao
SFShaojing Fan
Shaojing Fan
Integrating cyberspace and geographic space through map visualization is a valuable approach for revealing distribution patterns and relational dynamics in cyberspace. The interdisciplinary integration of network science and geographic science has gained increasing attention in recent years. However, current geographic information data models are not suitable for representing cyberspace features and their relations, and there is a lack of general and systematic cyberspace map visualization methods. To address these problems, this paper introduces an integrated data model that aligns spatial and cyberspace features based on a “proxy mode”. This model is designed to support both the visualization of data maps and the analysis of complex networks and graph layouts. In addition, a framework for cyberspace map visualization is introduced, comprising three main stages: “cyberspace data processing”, “cyberspace data rendering”, and “base map processing and map layout”. Using the Routers, BrightKite, and Cables datasets, we developed a web-based CMV system and generated a statistical map, a node-link map, an edge bundling map, a flow map, and a feature distribution map. The experimental results showed that the proposed data model and method framework can be effectively applied to represent the distribution and relations of cyberspace features and help reveal the interaction patterns between cyberspace and geographic space.

1 January 2026 in Open Geosciences
Verified
Journal Article
Open access
KMKunyang Ma
Kunyang Ma
YCYi Cheng
Yi Cheng
WGWen Ge
Wen Ge
ZZZheng Zhang
Zheng Zhang
SLShuxue Li
Shuxue Li
With the increasing prevalence of indoor activities and the growing demand for refined spatial information, 3D indoor scene reconstruction has become a core supporting technology for geospatial services, digital twins, and smart cities. This paper presents a comprehensive survey of data-driven approaches for automated 3D indoor modeling. We first systematically summarize the major data modalities, including floor plans, point clouds, RGB-D images, images, and textual descriptions, along with representative open datasets and key spatial data standards. We then provide a structured review of the full technical pipeline, covering permanent building component identification, scene reconstruction, spatial topology construction, and model texture optimization, as well as state-of-the-art learning-based and generative AI methods. Finally, we conduct in-depth comparisons of accuracy, efficiency, and automation across different sensing and modeling paradigms, and discuss the extended values of these techniques for geoscience applications such as indoor navigation, emergency response, building monitoring, and digital twin management. This review aims to clarify the technical evolution, current challenges, and future trends of data-driven indoor 3D reconstruction, providing a systematic reference for researchers in geoinformatics, computer vision, and digital construction.

3 February 2026 in Sensors
Verified
Journal Article
Open access
PDF file
LCLianshuai Cao
Lianshuai Cao
CYCheng Yi
Cheng Yi
ZZZheng Zhang
Zheng Zhang
GZGe Zhu
Ge Zhu
KMKunyang Ma
Kunyang Ma
XXXinyue Xu
Xinyue Xu
Individualization of buildings is one of the key issues in the establishment of three-dimensional (3D) building models. Most existing individualization methods rely on inefficient manual separation, while deep learning approaches require extensive pre-training and are highly influenced by the spatial structure of the models. To address these issues, this paper proposes a novel method for 3D building individualization that integrates SAMPolyBuild with multiple spatial-geometric features. Leveraging the zero-shot learning capability of SAMPolyBuild, the method first performs coarse extraction of individual buildings, then refines the extraction accuracy using multiple spatial-geometric features. Innovatively, two statistical parameters—Jensen-Shannon Divergence and Earth Mover’s Distance—are introduced into the building identification process. To validate the feasibility and effectiveness of the proposed method, experiments were conducted on the Semantic Urban Meshes (SUM) dataset. The results demonstrate that the method can effectively extract individual building models from urban oblique photogrammetric 3D models, achieving an F1-score of approximately 0.83 for buildings with typical spatial structures.