Haibin Xie
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Haibin Xie has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
Xin Xu
National University of Defense Technology
3 shared publications- Xin Xu
National University of Defense Technology
3 shared publications - Peng Li
College of Intelligence Science and Technology, National University of Defense Technology, Changsha, China
2 shared publications - Xinglong Zhang
National University of Defense Technology
2 shared publications - Zhiyong Ding
College of Intelligence Science and Technology, National University of Defense Technology, Changsha 410073, China
2 shared publications - Biao Luo
Central South University
1 shared publication
Latest Publications
- 15 September 2026
- Published by Elsevier in Expert Systems with Applications
HypOCD: A Hyperbolic Prototype Framework for On-the-Fly Category Discovery
- 15 September 2026
- Published by Elsevier in Expert Systems with Applications
HypOCD: A Hyperbolic Prototype Framework for On-the-Fly Category Discovery
- 22 July 2025
- Published by Springer Nature
- p. 430-445
HDKI: A Hierarchical Deep Koopman Framework for Spatio-Temporal Prediction with Image Observations
- 22 July 2025
- Published by Springer Nature
- p. 430-445
HDKI: A Hierarchical Deep Koopman Framework for Spatio-Temporal Prediction with Image Observations
- Open Access
- 21 April 2025
- Published by MDPI AG in Remote Sensing
- Vol. 17 (8) , 1474
Semi-Supervised Object Detection for Remote Sensing Images Using Consistent Dense Pseudo-Labels
Semi-supervised learning aims to improve the generalization performance of a model by exploiting the large quantity of unlabeled data together with limited labeled data during training. When applied to object detection in remote sensing images, semi-supervised learning can not only effectively alleviate the time-consuming and costly labeling of bounding boxes but also improve the performance and generalization of corresponding object detection methods. However, most current semi-supervised learning-based object detection methods (especially combined with pseudo-labels) for remote sensing images ignore a key issue, that is, the consistency of pseudo-labels. In this paper, a novel semi-supervised learning-based method for object detection in remote sensing images called CDPL is proposed, which includes an adaptive mechanism that directly incorporates the potential object information into the dense pseudo-label selection process and carefully selects the appropriate dense pseudo-labels in the scenes where objects are densely distributed. CDPL consists of two main components: feature-aligned dense pseudo-label selection and sparse pseudo-label-based regression object alignment. The experimental results for typical remote sensing datasets show that the proposed method results in a satisfactory performance improvement.
- 21 April 2025
- Published by MDPI AG in Remote Sensing
- Vol. 17 (8) , 1474
Open AccessSemi-Supervised Object Detection for Remote Sensing Images Using Consistent Dense Pseudo-Labels
Semi-supervised learning aims to improve the generalization performance of a model by exploiting the large quantity of unlabeled data together with limited labeled data during training. When applied to object detection in remote sensing images, semi-supervised learning can not only effectively alleviate the time-consuming and costly labeling of bounding boxes but also improve the performance and generalization of corresponding object detection methods. However, most current semi-supervised learning-based object detection methods (especially combined with pseudo-labels) for remote sensing images ignore a key issue, that is, the consistency of pseudo-labels. In this paper, a novel semi-supervised learning-based method for object detection in remote sensing images called CDPL is proposed, which includes an adaptive mechanism that directly incorporates the potential object information into the dense pseudo-label selection process and carefully selects the appropriate dense pseudo-labels in the scenes where objects are densely distributed. CDPL consists of two main components: feature-aligned dense pseudo-label selection and sparse pseudo-label-based regression object alignment. The experimental results for typical remote sensing datasets show that the proposed method results in a satisfactory performance improvement.
- 11 April 2024
- Published by Elsevier in Neurocomputing
- Vol. 587
An enhanced structural developmental neural network with information saturation for continual unsupervised learning
- 11 April 2024
- Published by Elsevier in Neurocomputing
- Vol. 587
An enhanced structural developmental neural network with information saturation for continual unsupervised learning
- Open Access
- 4 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 71 (10) , 12744-12753
Model-Based Safe Reinforcement Learning With Time-Varying Constraints: Applications to Intelligent Vehicles
In recent years, safe reinforcement learning (RL) with the actor-critic structure has gained significant interest for continuous control tasks. However, achieving near-optimal control policies with safety and convergence guarantees remains challenging. Moreover, few works have focused on designing RL algorithms that handle time-varying safety constraints. This article proposes a safe RL algorithm for optimal control of nonlinear systems with time-varying state and control constraints. The algorithm's novelty lies in two key aspects. Firstly, the approach introduces a unique barrier force-based control policy structure to ensure control safety during learning. Secondly, a multistep policy evaluation mechanism is employed, enabling the prediction of policy safety risks under time-varying constraints and guiding safe updates. Theoretical results on learning convergence, stability, and robustness are proven. The proposed algorithm outperforms several state-of-the-art RL algorithms in the simulated Safety Gym environment. It is also applied to the real-world problem of integrated path following and collision avoidance for two intelligent vehicles—a differential-drive vehicle and an Ackermann-drive one. The experimental results demonstrate the impressive sim-to-real transfer capability of our approach, while showcasing satisfactory online control performance.
- 4 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 71 (10) , 12744-12753
Open AccessModel-Based Safe Reinforcement Learning With Time-Varying Constraints: Applications to Intelligent Vehicles
In recent years, safe reinforcement learning (RL) with the actor-critic structure has gained significant interest for continuous control tasks. However, achieving near-optimal control policies with safety and convergence guarantees remains challenging. Moreover, few works have focused on designing RL algorithms that handle time-varying safety constraints. This article proposes a safe RL algorithm for optimal control of nonlinear systems with time-varying state and control constraints. The algorithm's novelty lies in two key aspects. Firstly, the approach introduces a unique barrier force-based control policy structure to ensure control safety during learning. Secondly, a multistep policy evaluation mechanism is employed, enabling the prediction of policy safety risks under time-varying constraints and guiding safe updates. Theoretical results on learning convergence, stability, and robustness are proven. The proposed algorithm outperforms several state-of-the-art RL algorithms in the simulated Safety Gym environment. It is also applied to the real-world problem of integrated path following and collision avoidance for two intelligent vehicles—a differential-drive vehicle and an Ackermann-drive one. The experimental results demonstrate the impressive sim-to-real transfer capability of our approach, while showcasing satisfactory online control performance.
- 27 April 2023
- Published by Cambridge University Press (CUP) in Robotica
- Vol. 41 (7) , 1931-1946
Potential field-based dual heuristic programming for path-following and obstacle avoidance of wheeled mobile robots
Path-following control of wheeled mobile robots has been a crucial research topic in robotic control theory and applications. In path-following control with obstacles, the path-following control and collision avoidance goals might be conflicting, making it challenging to obtain near-optimal solutions for path-following control and obstacle avoidance with low tracking error and input energy consumption. To address this problem, we propose a potential field-based dual heuristic programming (P-DHP) algorithm with an actor–critic (AC) structure for path-following control of mobile robots with obstacle avoidance. In the proposed P-DHP, the path-following control and collision avoidance problems are decoupled into two ones to resolve the control conflict. Firstly, a neural network-based AC is constructed to approximate the near-optimal path-following control policy in a no-obstacle environment. Then, with the trained path-following control policy fixed, a potential field-based control policy structure is constructed by another AC network to generate opposite control forces as the robot moves toward the obstacle, which can guarantee the robot’s control safety and reduce the tracking error and input energy consumption in obstacle avoidance. The simulated and experimental results show that P-DHP can realize near-optimal path-following control with the satisfaction of safety constraints and outperforms state-of-the-art approaches in control performance.
- 27 April 2023
- Published by Cambridge University Press (CUP) in Robotica
- Vol. 41 (7) , 1931-1946
Potential field-based dual heuristic programming for path-following and obstacle avoidance of wheeled mobile robots
Path-following control of wheeled mobile robots has been a crucial research topic in robotic control theory and applications. In path-following control with obstacles, the path-following control and collision avoidance goals might be conflicting, making it challenging to obtain near-optimal solutions for path-following control and obstacle avoidance with low tracking error and input energy consumption. To address this problem, we propose a potential field-based dual heuristic programming (P-DHP) algorithm with an actor–critic (AC) structure for path-following control of mobile robots with obstacle avoidance. In the proposed P-DHP, the path-following control and collision avoidance problems are decoupled into two ones to resolve the control conflict. Firstly, a neural network-based AC is constructed to approximate the near-optimal path-following control policy in a no-obstacle environment. Then, with the trained path-following control policy fixed, a potential field-based control policy structure is constructed by another AC network to generate opposite control forces as the robot moves toward the obstacle, which can guarantee the robot’s control safety and reduce the tracking error and input energy consumption in obstacle avoidance. The simulated and experimental results show that P-DHP can realize near-optimal path-following control with the satisfaction of safety constraints and outperforms state-of-the-art approaches in control performance.
- 18 April 2022
- Published by SAGE Publications in Intelligent Data Analysis: An International Journal
- Vol. 26 (3) , 567-582
Extended clustering algorithm based on cluster shape boundary
Based on the shape characteristics of the sample distribution in the clustering problem, this paper proposes an extended clustering algorithm based on cluster shape boundary (ECBSB). The algorithm automatically determines the number of clusters and classification discrimination boundaries by finding the boundary closures of the clusters from a global perspective of the sample distribution. Since ECBSB is insensitive to local features of the sample distribution, it can accurately identify clusters on complex shape and uneven density distribution. ECBSB first detects the shape boundary points of the cluster in the sample set with edge noise points eliminated, and then generates boundary closures around the cluster based on the boundary points. Finally, the cluster labels of the boundary are propagated to the entire sample set by a nearest neighbor search. The proposed method is evaluated on multiple benchmark datasets. Exhaustive experimental results show that the proposed method achieves highly accurate and robust clustering results, and is superior to the classical clustering baselines on most of the test data.
- 18 April 2022
- Published by SAGE Publications in Intelligent Data Analysis: An International Journal
- Vol. 26 (3) , 567-582
Extended clustering algorithm based on cluster shape boundary
Based on the shape characteristics of the sample distribution in the clustering problem, this paper proposes an extended clustering algorithm based on cluster shape boundary (ECBSB). The algorithm automatically determines the number of clusters and classification discrimination boundaries by finding the boundary closures of the clusters from a global perspective of the sample distribution. Since ECBSB is insensitive to local features of the sample distribution, it can accurately identify clusters on complex shape and uneven density distribution. ECBSB first detects the shape boundary points of the cluster in the sample set with edge noise points eliminated, and then generates boundary closures around the cluster based on the boundary points. Finally, the cluster labels of the boundary are propagated to the entire sample set by a nearest neighbor search. The proposed method is evaluated on multiple benchmark datasets. Exhaustive experimental results show that the proposed method achieves highly accurate and robust clustering results, and is superior to the classical clustering baselines on most of the test data.
- 27 January 2022
- Published by Springer Nature in Applied Intelligence
- Vol. 52 (10) , 11555-11568
Two-stage clustering algorithm based on evolution and propagation patterns
- 27 January 2022
- Published by Springer Nature in Applied Intelligence
- Vol. 52 (10) , 11555-11568
Two-stage clustering algorithm based on evolution and propagation patterns
- 16 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 33-38
Evolutionary Parameter-Free Clustering Algorithm
The performance of the clustering algorithms depends mainly on the setting of artificial parameter values which is usually difficult in practical application. In addition, the dataset is usually incremental, and the clustering algorithm applied to the static dataset cannot develop with the change of the dataset. If new sample points are added, algorithm parameters need to be readjusted to cluster again, leading to a great time cost. This paper proposed an evolutionary parameter-free clustering algorithm (EPFC) for the above problems, which imitates the human clustering mechanism of objective things. EPFC algorithm takes the average distance between each sample and its nearest neighbour sample as the threshold value to judge whether the sample can be grouped into one cluster. The threshold value is adaptively updated without setting an artificially parameter value as the samples increase. A large number of experiments on benchmark datasets show that EPFC is effective on datasets with different characteristics, and the algorithm has strong robustness.
- 16 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 33-38
Evolutionary Parameter-Free Clustering Algorithm
The performance of the clustering algorithms depends mainly on the setting of artificial parameter values which is usually difficult in practical application. In addition, the dataset is usually incremental, and the clustering algorithm applied to the static dataset cannot develop with the change of the dataset. If new sample points are added, algorithm parameters need to be readjusted to cluster again, leading to a great time cost. This paper proposed an evolutionary parameter-free clustering algorithm (EPFC) for the above problems, which imitates the human clustering mechanism of objective things. EPFC algorithm takes the average distance between each sample and its nearest neighbour sample as the threshold value to judge whether the sample can be grouped into one cluster. The threshold value is adaptively updated without setting an artificially parameter value as the samples increase. A large number of experiments on benchmark datasets show that EPFC is effective on datasets with different characteristics, and the algorithm has strong robustness.
- 2 August 2019
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 295-307
Semantic Situation Extraction from Satellite Image Based on Neural Networks
- 2 August 2019
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 295-307
Semantic Situation Extraction from Satellite Image Based on Neural Networks