Query：
学者姓名：吴小竹
Refining：
Year
Type
Indexed by
Source
Complex
Former Name
Co-
Language
Clean All
Abstract ：
The autonomous navigation capability of USVs in complex water environments relies on Simultaneous Localization and Mapping (SLAM) technology. However, water surface perturbations and reflections generate numerous dynamic invalid feature points, causing low localization accuracy and poor robustness in VSLAM. To this end, we propose a monocular VSLAM algorithm considering dynamic invalid features of the water surface for USV, named WS-SLAM. Firstly, the ORBSLAM3 framework is improved by adding the PP-LiteSeg semantic segmentation thread to distinguish between dynamic invalid feature points of the water surface and feature points on shore. Secondly, semantic information is used to generate a mask to cull dynamic invalid feature points of the water surface, reducing the impact of water current perturbation on visual localization. Then, further culling of potentially residual dynamic feature points on shore is performed in conjunction with the epipolar geometric constraint. Finally, the camera position is estimated using only static feature points. The experimental results based on the public USVInland dataset show that WSSLAM improves the positioning accuracy by an average of 43.47% in straight line sailing compared with ORBSLAM3. It can effectively inhibit the position drift caused by the dynamic invalid features of the water surface and has higher positioning accuracy and stronger robustness. © 2025 The Author(s). Published by Informa UK Limited, trading as Taylor & Francis Group.
Keyword ：
Geometry Geometry Mapping Mapping Semantic Segmentation Semantic Segmentation SLAM robotics SLAM robotics
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Li, Dan , Dong, Honghong , Chen, Xin et al. WS-SLAM: a monocular visual SLAM algorithm considering dynamic invalid features of water surface for USV [J]. | Systems Science and Control Engineering , 2025 , 13 (1) . |
| MLA | Li, Dan et al. "WS-SLAM: a monocular visual SLAM algorithm considering dynamic invalid features of water surface for USV" . | Systems Science and Control Engineering 13 . 1 (2025) . |
| APA | Li, Dan , Dong, Honghong , Chen, Xin , Li, Binjie , Zhang, Shuailong , Wu, Xiaozhu . WS-SLAM: a monocular visual SLAM algorithm considering dynamic invalid features of water surface for USV . | Systems Science and Control Engineering , 2025 , 13 (1) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
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.
Keyword ：
improved YOLOv5 improved YOLOv5 object detection object detection small objects small objects UAV UAV water surface floaters water surface floaters
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Chen, Fuxun , Zhang, Lanxin , Kang, Siyu et al. Soft-NMS-Enabled YOLOv5 with SIOU for Small Water Surface Floater Detection in UAV-Captured Images [J]. | SUSTAINABILITY , 2023 , 15 (14) . |
| MLA | Chen, Fuxun et al. "Soft-NMS-Enabled YOLOv5 with SIOU for Small Water Surface Floater Detection in UAV-Captured Images" . | SUSTAINABILITY 15 . 14 (2023) . |
| APA | Chen, Fuxun , Zhang, Lanxin , Kang, Siyu , Chen, Lutong , Dong, Honghong , Li, Dan et al. Soft-NMS-Enabled YOLOv5 with SIOU for Small Water Surface Floater Detection in UAV-Captured Images . | SUSTAINABILITY , 2023 , 15 (14) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
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.
Keyword ：
fine-grained batching algorithm fine-grained batching algorithm multi-armed bandit algorithm multi-armed bandit algorithm online task assignment online task assignment spatial crowdsourcing spatial crowdsourcing
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Jiao, Yuxin , Lin, Zhikun , Yu, Long et al. A Fine-Grain Batching-Based Task Allocation Algorithm for Spatial Crowdsourcing [J]. | ISPRS INTERNATIONAL JOURNAL OF GEO-INFORMATION , 2022 , 11 (3) . |
| MLA | Jiao, Yuxin et al. "A Fine-Grain Batching-Based Task Allocation Algorithm for Spatial Crowdsourcing" . | ISPRS INTERNATIONAL JOURNAL OF GEO-INFORMATION 11 . 3 (2022) . |
| APA | Jiao, Yuxin , Lin, Zhikun , Yu, Long , Wu, Xiaozhu . A Fine-Grain Batching-Based Task Allocation Algorithm for Spatial Crowdsourcing . | ISPRS INTERNATIONAL JOURNAL OF GEO-INFORMATION , 2022 , 11 (3) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
提出一种基于激励机制的负载均衡和服务质量感知服务组合(LBQSC)方法.首先,构建一个全局约束分解模型,并采用文化遗传算法求解;其次,考虑服务质量(QoS)和负载构造激励合同,提出一种基于激励机制的服务选择算法,通过不断激励QoS的动态调整获取最优服务;最后,在QWS 2.0综合数据集上进行对比实验.实验结果表明:基于激励机制的负载均衡和QoS感知服务组合方法能在保证负载均衡的情况下有效地获取高质量的组合服务.
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 刘英 , 焦竽鑫 , 吴小竹 . 激励机制下负载均衡和QoS感知服务组合方法 [J]. | 华侨大学学报（自然科学版） , 2021 , 42 (5) : 684-692 . |
| MLA | 刘英 et al. "激励机制下负载均衡和QoS感知服务组合方法" . | 华侨大学学报（自然科学版） 42 . 5 (2021) : 684-692 . |
| APA | 刘英 , 焦竽鑫 , 吴小竹 . 激励机制下负载均衡和QoS感知服务组合方法 . | 华侨大学学报（自然科学版） , 2021 , 42 (5) , 684-692 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Previous QoS-aware service composition methods mainly focus on how to generate composite service with the optimal QoS efficiently for a single request. However, in the real application scenarios, there are multiple service requests and multiple service providers. It is more important to compose services with suboptimal QoS and maintain the load balance between services. To solve this problem, in this paper, we propose a service composition method, named as dynamically change and balancing composition method (DCBC). It assumes that the QoS of service is not static, and the services can adjust the value of QoS to gain more opportunities to be selected for composition. The method mainly includes two steps, which are the preprocessing step and the service selection step. In the preprocessing step, a backward global best QoS calculation is performed which regarding the static and dynamic QoS respectively; then guided by the global QoS, the feasible services can be selected efficiently in the service selection step. The experiments show that the DCBC method can not only improve the overall quality of composite services but also guarantee the fulfill ratio of requests and the load balance of services.
Keyword ：
Dynamic QoS Dynamic QoS Load Balance Load Balance QoS Adjustment QoS Adjustment Service Composition Service Composition
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Wu, Xiaozhu . A Dynamic QoS Adjustment Enabled and Load-balancing-aware Service Composition Method for Multiple Requests [J]. | KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS , 2021 , 15 (3) : 891-910 . |
| MLA | Wu, Xiaozhu . "A Dynamic QoS Adjustment Enabled and Load-balancing-aware Service Composition Method for Multiple Requests" . | KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS 15 . 3 (2021) : 891-910 . |
| APA | Wu, Xiaozhu . A Dynamic QoS Adjustment Enabled and Load-balancing-aware Service Composition Method for Multiple Requests . | KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS , 2021 , 15 (3) , 891-910 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
We present a framework for the event semantic retrieval of cultural tourism. Nowadays, information and communication technologies are ubiquitous and pervasive and have greatly promoted the development of cultural tourism. Cultural tourism should utilize these technologies to improve a sense of participation and experience for cultural tourists by sorting out domain-specific cultural knowledge from tourism attractions systematically, building bridges between tourism resources and cultural connotation naturally and presenting the cultural changes behind tourism resources vividly. To the end, we present a complete framework that is suitable to event retrieval of cultural tourism, helping cultural tourists learn culture in all directions and in depth quickly and easily before their cultural tours, and local government create tourism cards through the dissemination of culture connotation as well. Our main inspiration is that story-telling would be an effective form of acceptance by cultural tourists to spread the culture behind tourism resources. Concretely, our framework includes data acquisition and preprocessing, data organization and processing, and data visualization components. The data acquisition and preprocessing component is responsible for collecting historical event texts and fusing text knowledge. The data organization and processing component enables an intuitive view on properties and relations of the event elements in terms of defined event ontology for cultural tourism and supports event semantic retrieval. The data visualization component provides a knowledge navigation through dynamic display and an interactive interface with modification function. We have conducted event semantic retrieval of Minnan culture and verified the feasibility and effectiveness of the framework.
Keyword ：
Cultural tourism Cultural tourism event ontology event ontology interactive visualization interactive visualization knowledge fusion knowledge fusion knowledge retrieval knowledge retrieval
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Fang, Hui , Chen, Chongcheng , Wu, Xiaozu et al. FESRCT: A Framework for the Event Semantic Retrieval of Cultural Tourism [J]. | ACM JOURNAL ON COMPUTING AND CULTURAL HERITAGE , 2021 , 14 (3) . |
| MLA | Fang, Hui et al. "FESRCT: A Framework for the Event Semantic Retrieval of Cultural Tourism" . | ACM JOURNAL ON COMPUTING AND CULTURAL HERITAGE 14 . 3 (2021) . |
| APA | Fang, Hui , Chen, Chongcheng , Wu, Xiaozu , Ye, Xiaoyan . FESRCT: A Framework for the Event Semantic Retrieval of Cultural Tourism . | ACM JOURNAL ON COMPUTING AND CULTURAL HERITAGE , 2021 , 14 (3) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Massive data transmission between distributed data centers is the major efficiency bottleneck of geospatial workflow. Although many data placement methods have been proposed to overcome this problem, few researches have considered the impact of the structure of the workflow. In this paper, we define the problem of data placement for data-intensive geospatial workflow aiming to minimize the data transfer time. An algorithm called ant colony optimization based data placement of data-intensive geospatial workflow (ACO-DPDGW) is proposed to handle this problem. By taking advantage of the node vector to represent the traditional workflow model, the ants could place datasets and tasks in appropriate data centers according to the combination of pheromone information and heuristic information, when they visit the nodes randomly. To prevent premature convergence, a variable neighborhood search operation is embedded into ACO-DPDGW. The experiments show that our algorithm can reduce data transfer volume and data transfer time even as the numbers of datasets, tasks, and data centers increase.
Keyword ：
Ant colony optimization Ant colony optimization Data placement Data placement Geospatial workflow Geospatial workflow
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Wu, Xiaozhu , Liu, Ying , Chen, Chongcheng . ACO-DPDGW: an ant colony optimization algorithm for data placement of data-intensive geospatial workflow [J]. | EARTH SCIENCE INFORMATICS , 2019 , 12 (4) : 641-658 . |
| MLA | Wu, Xiaozhu et al. "ACO-DPDGW: an ant colony optimization algorithm for data placement of data-intensive geospatial workflow" . | EARTH SCIENCE INFORMATICS 12 . 4 (2019) : 641-658 . |
| APA | Wu, Xiaozhu , Liu, Ying , Chen, Chongcheng . ACO-DPDGW: an ant colony optimization algorithm for data placement of data-intensive geospatial workflow . | EARTH SCIENCE INFORMATICS , 2019 , 12 (4) , 641-658 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
The accumulation of serial remote sensing images provides plentiful data for discovering sequential spatial patterns in various fields such as agricultural monitoring, urban development, and vegetation cover. Otherwise, traditional sequential pattern-mining algorithms cannot be directly or efficiently applied to remote sensing images. In this study, we propose a pixel clustering-based method to improve the efficiency of mining spatial sequential patterns from raster serial remote sensing images (SRSI). Firstly, the images are compressed by using the Run-Length coding schema. Then, pixels with identical sequences are clustered by means of the Run-length code-based spatial overlay operation. Finally, a pruning strategy is proposed, to extend the prefixSpan algorithm to skip unnecessary database scanning when mining from pixel groups. The experimental results indicate that the method presented in this paper could extract spatial sequential patterns from SRSI efficiently. Although accurate support rates for the patterns may not be obtained, our method could ensure that all patterns are extracted with a lower time cost.
Keyword ：
Pixels cluster Pixels cluster Sequence mining Sequence mining Serial remote sensing images Serial remote sensing images Spatial sequential pattern Spatial sequential pattern
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Wu, Xiaozhu , Zhang, Ximei . An efficient pixel clustering-based method for mining spatial sequential patterns from serial remote sensing images [J]. | COMPUTERS & GEOSCIENCES , 2019 , 124 : 128-139 . |
| MLA | Wu, Xiaozhu et al. "An efficient pixel clustering-based method for mining spatial sequential patterns from serial remote sensing images" . | COMPUTERS & GEOSCIENCES 124 (2019) : 128-139 . |
| APA | Wu, Xiaozhu , Zhang, Ximei . An efficient pixel clustering-based method for mining spatial sequential patterns from serial remote sensing images . | COMPUTERS & GEOSCIENCES , 2019 , 124 , 128-139 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
针对个性化旅游特别是自驾游的实际需求,研究基于多个约束条件的旅游行程规划问题.提出一个旅游行程规划算法,以时间框架为基础,遗传算法为核心,通过对有效旅游路线的不断优化,输出其中一条最优的旅游路线.最后,在真实数据集上进行实验,将提出的算法与变邻域搜索算法进行比较,对路线的总评分值结果进行评价.结果表明,研究提出的算法能够获得更高的路线评分值,能够为旅行者提供准确合理的旅游路线.
Keyword ：
兴趣点 兴趣点 旅游行程规划问题 旅游行程规划问题 时间框架 时间框架 自驾游 自驾游 遗传算法 遗传算法
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 张久滕 , 吴小竹 , 陈崇成 et al. 基于时间框架的多日游行程规划及其优化方法 [J]. | 福州大学学报（自然科学版） , 2018 , 46 (6) : 787-793 . |
| MLA | 张久滕 et al. "基于时间框架的多日游行程规划及其优化方法" . | 福州大学学报（自然科学版） 46 . 6 (2018) : 787-793 . |
| APA | 张久滕 , 吴小竹 , 陈崇成 , 方荟 , 刘先锋 , 方东 . 基于时间框架的多日游行程规划及其优化方法 . | 福州大学学报（自然科学版） , 2018 , 46 (6) , 787-793 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
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.
Keyword ：
agglomerative hierarchical clustering agglomerative hierarchical clustering multi-density clustering multi-density clustering Multiple Density-Ordered Trees (MDOT) Multiple Density-Ordered Trees (MDOT) spatial clustering spatial clustering
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Wu, Xiaozhu , Jiang, Hong , Chen, Chongcheng . SCMDOT: Spatial Clustering with Multiple Density-Ordered Trees [J]. | ISPRS INTERNATIONAL JOURNAL OF GEO-INFORMATION , 2017 , 6 (7) . |
| MLA | Wu, Xiaozhu et al. "SCMDOT: Spatial Clustering with Multiple Density-Ordered Trees" . | ISPRS INTERNATIONAL JOURNAL OF GEO-INFORMATION 6 . 7 (2017) . |
| APA | Wu, Xiaozhu , Jiang, Hong , Chen, Chongcheng . SCMDOT: Spatial Clustering with Multiple Density-Ordered Trees . | ISPRS INTERNATIONAL JOURNAL OF GEO-INFORMATION , 2017 , 6 (7) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Export
| Results： |
Selected to |
| Format： |
