Xiaozhu Wu

Mr. Xiaozhu Wu

orcid

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
8 July 2023 in Sustainability
Verified
Journal Article
Open access
PDF file
FCFuxun Chen Chen
Fuxun Chen Chen
LZlanxin zhang
lanxin zhang
SKSiyu Kang
Siyu Kang
LCLutong Chen
Lutong Chen
HDHonghong Dong
Honghong Dong
XWXiaozhu Wu
Xiaozhu Wu
In recent years, the protection and management of water environments have garnered heightened attention due to their critical importance. Detection of small objects in unmanned aerial vehicle (UAV) images remains a persistent challenge due to the limited pixel values and interference from background noise. To address this challenge, this paper proposes an integrated object detection approach that utilizes an improved YOLOv5 model for real-time detection of small water surface floaters. The proposed improved YOLOv5 model effectively detects small objects by better integrating shallow and deep features and addressing the issue of missed detections and, therefore, aligns with the characteristics of the water surface floater dataset. Our proposed model has demonstrated significant improvements in detecting small water surface floaters when compared to previous studies. Specifically, the average precision (AP), recall (R), and frames per second (FPS) of our model achieved 86.3%, 79.4%, and 92%, respectively. Furthermore, when compared to the original YOLOv5 model, our model exhibits a notable increase in both AP and R, with improvements of 5% and 6.1%, respectively. As such, the proposed improved YOLOv5 model is well-suited for the real-time detection of small objects on the water’s surface. Therefore, this method will be essential for large-scale, high-precision, and intelligent water surface floater monitoring.

Verified
Journal Article
Open access
PDF file
Jiao YuxinJiao Yuxin
Jiao Yuxin
ZLZhikun Lin
Zhikun Lin
LYLong Yu
Long Yu
XWXiaozhu Wu
Xiaozhu Wu
Task allocation is a critical issue of spatial crowdsourcing. Although the batching strategy performs better than the real-time matching mode, it still has the following two drawbacks: (1) Because the granularity of the batch size set obtained by batching is too coarse, it will result in poor matching accuracy. However, roughly designing the batch size for all possible delays will result in a large computational overhead. (2) Ignoring non-stationary factors will lead to a change in optimal batch size that cannot be found as soon as possible. Therefore, this paper proposes a fine-grained, batching-based task allocation algorithm (FGBTA), considering non-stationary setting. In the batch method, the algorithm first uses variable step size to allow for fine-grained exploration within the predicted value given by the multi-armed bandit (MAB) algorithm and uses the results of pseudo-matching to calculate the batch utility. Then, the batch size with higher utility is selected, and the exact maximum weight matching algorithm is used to obtain the allocation result within the batch. In order to cope with the non-stationary changes, we use the sliding window (SW) method to retain the latest batch utility and discard the historical information that is too far away, so as to finally achieve refined batching and adapt to temporal changes. In addition, we also take into account the benefits of requesters, workers, and the platform. Experiments on real data and synthetic data show that this method can accomplish the task assignment of spatial crowdsourcing effectively and can adapt to the non-stationary setting as soon as possible. This paper mainly focuses on the spatial crowdsourcing task of ride-hailing.

8 March 2015 in Journal of Grid Computing
Verified
Journal Article
Closed access
PDF file
CCChongcheng Chen
Chongcheng Chen
JLJiaxiang Lin
Jiaxiang Lin
XWXiaozhu Wu
Xiaozhu Wu
JWJianwei Wu
Jianwei Wu

30 June 2016 in International Journal of Grid and Distributed Computing
Verified
Journal Article
Open access
XWXiaozhu Wu
Xiaozhu Wu
CCChongcheng Chen
Chongcheng Chen
HHHongyu Huang
Hongyu Huang

Verified
Journal Article
Open access
PDF file
XWXiaozhu Wu
Xiaozhu Wu
HJHong Jiang
Hong Jiang
CCChongcheng Chen
Chongcheng Chen
With the rapid explosion of information based on location, spatial clustering plays an increasingly significant role in this day and age as an important technique in geographical data analysis. Most existing spatial clustering algorithms are limited by complicated spatial patterns, which have difficulty in discovering clusters with arbitrary shapes and uneven density. In order to overcome such limitations, we propose a novel clustering method called Spatial Clustering with Multiple Density-Ordered Trees (SCMDOT). Motivated by the idea of the Density-Ordered Tree (DOT), we firstly represent the original dataset by the means of constructing Multiple Density-Ordered Trees (MDOT). In the constructing process, we impose additional constraints to control the growth of each Density-Ordered Tree, ensuring that they all have high spatial similarity. Furthermore, a series of MDOT can be successively generated from regions of sparse areas to the dense areas, where each Density-Ordered Tree, also treated as a sub-tree, represents a cluster. In the merging process, the final clusters are obtained by repeatedly merging a suitable pair of clusters until they satisfy the expected clustering result. In addition, a heuristic strategy is applied during the process of our algorithm for suitability for special applications. The experiments on synthetic and real-world spatial databases are utilised to demonstrate the performance of our proposed method.

11 August 2019 in Earth Science Informatics
Verified
Journal Article
Closed access
PDF file
XWXiaozhu Wu
Xiaozhu Wu
YLYing Liu
Ying Liu
CCChongcheng Chen
Chongcheng Chen