Jie Wan

Mr. Jie Wan

orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
24 May 2021 in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
Verified
Journal Article
Open access
JWJie Wan
Jie Wan
Zhong XieZhong Xie
Zhong Xie
Yongyang XuYongyang Xu
Yongyang Xu
SCSiqiong Chen
Siqiong Chen
QQQinjun Qiu
Qinjun Qiu
Recent advances in deep-learning methods have shown extraordinary performance in road extraction from high resolution satellite imagery. However, most existing deep-learning network models yield discontinuous and incomplete results because of shadows and occlusions. To address this problem, a dual-attention road extraction network (DA-RoadNet) with a certain semantic reasoning ability is proposed. First, DA-RoadNet is designed based on a shallow encoder-to-decoder network with densely connected blocks, which can minimize the loss of road structure information caused by multiple down-sampling operations. Moreover, by constructing a novel attention mechanism module, the proposed network is able to explore and integrate the invisible correlations among road features with their global dependency in spatial and channel dimension respectively. Finally, considering that the proportion of road samples is small in the satellite imagery, a hybrid loss function is appended to handle class imbalance, which enables the network model to train stablely and avoid local optimum. The validation experiments using two open road datasets demonstrate that the proposed DA-RoadNet can effectively solve discontinuous problems and preserve integrity of the extracted roads, thus resulting in a higher accuracy of road extraction compared with other developed state-of-the-arts. The considerable performance on the two challenging benchmarks also proves the powerful generation ability of our method.

18 January 2024 in Expert Systems with Applications
Verified
Journal Article
Closed access
ZZZiyin Zeng
Ziyin Zeng
Yongyang XuYongyang Xu
Yongyang Xu
ZXZhong Xie
Zhong Xie
WTWei Tang
Wei Tang
JWJie Wan
Jie Wan
WWWeichao Wu
Weichao Wu

19 August 2022 in Remote Sensing
Verified
Journal Article
Open access
PDF file
ZZZiyin Zeng
Ziyin Zeng
Yongyang XuYongyang Xu
Yongyang Xu
Zhong XieZhong Xie
Zhong Xie
JWJie Wan
Jie Wan
WWWei Chao Wu
Wei Chao Wu
WDWenxia Dai
Wenxia Dai
Point cloud semantic segmentation, a challenging task in 3D data processing, is popular in many realistic applications. Currently, deep learning methods are gradually being applied to point cloud semantic segmentation. However, as it is difficult to manually label point clouds in 3D scenes, it remains difficult to obtain sufficient training samples for the supervised deep learning network. Although an increasing number of excellent methods have been proposed in recent years, few of these have focused on the problem of semantic segmentation with insufficient samples. To address this problem, this paper proposes a random graph based on graph convolution network, referred to as RG-GCN. The proposed network consists of two key components: (1) a random graph module is proposed to perform data augmentation by changing the topology of the built graphs; and (2) a feature extraction module is proposed to obtain local significant features by aggregating point spatial information and multidimensional features. To validate the performance of the RG-GCN, the indoor dataset S3DIS and outdoor dataset Toronto3D are used to validate the proposed network via a series of experiments. The results show that the proposed network achieves excellent performance for point cloud semantic segmentation of the two different datasets.

2 September 2021 in Remote Sensing
Verified
Journal Article
Open access
PDF file
JWJie Wan
Jie Wan
Zhong XieZhong Xie
Zhong Xie
Yongyang XuYongyang Xu
Yongyang Xu
ZZZiyin Zeng
Ziyin Zeng
DYDing Yuan
Ding Yuan
QQQinjun Qiu
Qinjun Qiu
Feature extraction on point clouds is an essential task when analyzing and processing point clouds of 3D scenes. However, there still remains a challenge to adequately exploit local fine-grained features on point cloud data due to its irregular and unordered structure in a 3D space. To alleviate this problem, a Dilated Graph Attention-based Network (DGANet) with a certain feature for learning ability is proposed. Specifically, we first build a local dilated graph-like region for each input point to establish the long-range spatial correlation towards its corresponding neighbors, which allows the proposed network to access a wider range of geometric information of local points with their long-range dependencies. Moreover, by integrating the dilated graph attention module (DGAM) implemented by a novel offset–attention mechanism, the proposed network promises to highlight the differing importance on each edge of the constructed local graph to uniquely learn the discrepancy feature of geometric attributes between the connected point pairs. Finally, all the learned edge attention features are further aggregated, allowing the most significant geometric feature representation of local regions by the graph–attention pooling to fully extract local detailed features for each point. The validation experiments using two challenging benchmark datasets demonstrate the effectiveness and powerful generation ability of our proposed DGANet in both 3D object classification and segmentation tasks.

12 December 2023 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
ZLZiwei Luo
Ziwei Luo
ZZZiyin Zeng
Ziyin Zeng
WTWei Tang
Wei Tang
JWJie Wan
Jie Wan
Zhong XieZhong Xie
Zhong Xie
Yongyang XuYongyang Xu
Yongyang Xu
Semantic segmentation of large-scale point clouds provides foundational knowledge for various geodetic and cartographic applications, including autonomous driving, smart cities, and indoor navigation. However, point cloud data’s unstructured and inherently disordered characteristics pose challenges in extracting accurate 3-D semantic information. In this study, we introduce a novel semantic segmentation network for large-scale point cloud scenes, referred to as dense dual-branch cross attention network (D2CAN). We propose a local multidimensional feature aggregation (LMFA) module to increase multidimensional feature representation types and preserve rich local details. Based on the augmented local features, an expanded dual-branch cross attention (EDCA) module establishes internal deep connections between multidimensional attributes and semantic features. This assists the network in reducing boundary ambiguities and expanding the receptive field, enabling the parallel capture of long-range contexts specifically adapted for large-scale scene point cloud segmentation. These two modules work collaboratively to constitute a local context deep perception (LCDP) block. To reduce information loss during feature sampling and propagation, we propose a global feature pyramid dense fusion (GFDF) block. This block adaptively integrates features across different scales and effectively captures global context with long-range dependencies. In conclusion, D2CAN combines LCDP and GFDF to aggregate both local and global contexts, resulting in robust feature discrimination for semantic segmentation of large-scale scenes. Our method’s effectiveness and superior generation ability have been validated across three challenging benchmarks and achieve state-of-the-art performance on Toronto-3D, SensatUrban, and Stanford large-scale 3-D indoor spaces (S3DIS) datasets, with mean intersection over union (IoU) values of 83.5%, 61.1%, and 72.3%, respectively.

26 December 2022 in Remote Sensing
Verified
Journal Article
Open access
PDF file
ZLZiwei Luo
Ziwei Luo
Zhong XieZhong Xie
Zhong Xie
JWJie Wan
Jie Wan
ZZZiyin Zeng
Ziyin Zeng
LLLu Liu
Lu Liu
LTLiufeng Tao
Liufeng Tao
Indoor scene point cloud segmentation plays an essential role in 3D reconstruction and scene classification. This paper proposes a multi-constraint graph clustering method (MCGC) for indoor scene segmentation. The MCGC method considers multi-constraints, including extracted structural planes, local surface convexity, and color information of objects for indoor segmentation. Firstly, the raw point cloud is partitioned into surface patches, and we propose a robust plane extraction method to extract the main structural planes of the indoor scene. Then, the match between the surface patches and the structural planes is achieved by global energy optimization. Next, we closely integrate multiple constraints mentioned above to design a graph clustering algorithm to partition cluttered indoor scenes into object parts. Finally, we present a post-refinement step to filter outliers. We conducted experiments on a benchmark RGB-D dataset and a real indoor laser-scanned dataset to perform numerous qualitative and quantitative evaluation experiments, the results of which have verified the effectiveness of the MCGC method. Compared with state-of-the-art methods, MCGC can deal with the segmentation of indoor scenes more efficiently and restore more details of indoor structures. The segment precision and the segment recall of experimental results reach 70% on average. In addition, a great advantage of the MCGC method is that the speed of processing point clouds is very fast; it takes about 1.38 s to segment scene data of 1 million points. It significantly reduces the computation overhead of scene point cloud data and achieves real-time scene segmentation.