Zhigang Su
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Zhigang Su has a total of 47 co-authors. Here are the top co-authors by number of shared publications:
Renbiao Wu
Tianjin Key Laboratory for Advanced Signal Processing, Civil Aviation University of China, 300300, China
16 shared publications- Bing Han
Sino-European Institute of Aviation Engineering, Civil Aviation University of China, Tianjin 300300, China
9 shared publications - Jingtang Hao
Sino-European Institute of Aviation Engineering, Civil Aviation University of China, Tianjin 300300, China
7 shared publications Yingning Peng
Tianjin Key Lab. for Adv. Signal Process., Civil Aviation Univ. of China, Tianjin China
7 shared publicationsDan Lu
Tianjin Key Lab for Advanced Signal Processing, Civil Aviation University of China, 300300, P.R. China
4 shared publicationsPing Li
Tianjin Key Lab for Advanced Signal Processing, Civil Aviation University of China, 300300, P.R. China
4 shared publications
Latest Publications
- Open Access
PA-DFNet: Polarity-Aware Attention Network with Feature Dynamic Fusion for Point Cloud Classification and Semantic Segmentation
Point cloud segmentation constitutes a core task in 3D computer vision. However, prevailing models suffer from inherent limitations, including the absence of polarity correlation (i.e., spatial attribute-containing features derived from the separation and calculation of positive/negative correlations within point cloud query–key pairs), inefficient feature fusion, loss of fine-grained geometric details, and excessive computational complexity in self-attention mechanisms. These deficiencies constrain both the performance and practical deployment of such models. To address these challenges, the Polarity-Aware Attention and Feature Dynamic Fusion Network (PA-DFNet) is proposed in this paper. Built upon the PointNet++ framework, PA-DFNet replaces the original Multilayer Perceptron (MLP) with a Polarity-Aware Network (PAN). The PAN enhances key semantic interactions by explicitly separating positive and negative correlations from point cloud query–key pairs, generates adaptive neighborhood weights via integration with a linear attention mechanism, and introduces a learnable power function to perform nonlinear scaling of attention, thereby improving the model’s structural perception capability. Additionally, a Point Cloud Feature Dynamic Fusion (PFF) module is proposed to enable adaptive fusion of encoder–decoder features, preserving rich geometric details. Experimental results demonstrate that, on the ModelNet40 classification task, the overall accuracy (OA) and mean accuracy (mAcc) of PA-DFNet are improved by 2.4% and 2.2%, respectively, compared with PointNet++. On the S3DIS semantic segmentation task, PA-DFNet achieves an mAcc of 72.8% and a mean Intersection over Union (mIoU) of 66.2%, while exhibiting a shorter training time than Point Transformer. In summary, PA-DFNet achieves an optimal balance between segmentation performance and efficiency by effectively controlling the number of model parameters and computational complexity.
Open AccessPA-DFNet: Polarity-Aware Attention Network with Feature Dynamic Fusion for Point Cloud Classification and Semantic Segmentation
Point cloud segmentation constitutes a core task in 3D computer vision. However, prevailing models suffer from inherent limitations, including the absence of polarity correlation (i.e., spatial attribute-containing features derived from the separation and calculation of positive/negative correlations within point cloud query–key pairs), inefficient feature fusion, loss of fine-grained geometric details, and excessive computational complexity in self-attention mechanisms. These deficiencies constrain both the performance and practical deployment of such models. To address these challenges, the Polarity-Aware Attention and Feature Dynamic Fusion Network (PA-DFNet) is proposed in this paper. Built upon the PointNet++ framework, PA-DFNet replaces the original Multilayer Perceptron (MLP) with a Polarity-Aware Network (PAN). The PAN enhances key semantic interactions by explicitly separating positive and negative correlations from point cloud query–key pairs, generates adaptive neighborhood weights via integration with a linear attention mechanism, and introduces a learnable power function to perform nonlinear scaling of attention, thereby improving the model’s structural perception capability. Additionally, a Point Cloud Feature Dynamic Fusion (PFF) module is proposed to enable adaptive fusion of encoder–decoder features, preserving rich geometric details. Experimental results demonstrate that, on the ModelNet40 classification task, the overall accuracy (OA) and mean accuracy (mAcc) of PA-DFNet are improved by 2.4% and 2.2%, respectively, compared with PointNet++. On the S3DIS semantic segmentation task, PA-DFNet achieves an mAcc of 72.8% and a mean Intersection over Union (mIoU) of 66.2%, while exhibiting a shorter training time than Point Transformer. In summary, PA-DFNet achieves an optimal balance between segmentation performance and efficiency by effectively controlling the number of model parameters and computational complexity.
- Open Access
Differential Iterative Joint Estimation Approach for Indoor Target Localization
To address the sharp degradation in positioning accuracy and the lack of robustness of received signal strength indication (RSSI)-based indoor localization methods when both the reference RSSI and path-loss exponent are mismatched, a Differential Iterative Joint Estimation (DIJE) localization method is proposed in this paper. The proposed method first employs a differential model to eliminate the uncertainty caused by reference RSSI, transforming the maximum likelihood estimation (MLE) problem into a matrix eigenvalue problem to enable fast and high-accuracy target position estimation. Additionally, an alternating iterative optimization framework for target position and path-loss exponent is constructed to achieve adaptive joint estimation of model parameters and target coordinates, effectively suppressing localization performance degradation induced by parameter mismatch. In this paper, the Cramér–Rao Lower Bound (CRLB) under the dual-parameter uncertainty scenario is derived as a theoretical performance benchmark, and both simulation experiments and public real-world datasets are used to validate the method’s performance. The results demonstrate that the DIJE method can approach the theoretical limit under varying noise levels, access point (AP) densities, and complex indoor environments. Compared with classical algorithms such as RSDPE, MLE-TLLS, SOCP3, and LCJE, the DIJE method exhibits significant advantages in localization accuracy, robustness, and adaptability to initial parameters, and can meet the engineering requirements of high-accuracy and low-latency real-time indoor localization.
Open AccessDifferential Iterative Joint Estimation Approach for Indoor Target Localization
To address the sharp degradation in positioning accuracy and the lack of robustness of received signal strength indication (RSSI)-based indoor localization methods when both the reference RSSI and path-loss exponent are mismatched, a Differential Iterative Joint Estimation (DIJE) localization method is proposed in this paper. The proposed method first employs a differential model to eliminate the uncertainty caused by reference RSSI, transforming the maximum likelihood estimation (MLE) problem into a matrix eigenvalue problem to enable fast and high-accuracy target position estimation. Additionally, an alternating iterative optimization framework for target position and path-loss exponent is constructed to achieve adaptive joint estimation of model parameters and target coordinates, effectively suppressing localization performance degradation induced by parameter mismatch. In this paper, the Cramér–Rao Lower Bound (CRLB) under the dual-parameter uncertainty scenario is derived as a theoretical performance benchmark, and both simulation experiments and public real-world datasets are used to validate the method’s performance. The results demonstrate that the DIJE method can approach the theoretical limit under varying noise levels, access point (AP) densities, and complex indoor environments. Compared with classical algorithms such as RSDPE, MLE-TLLS, SOCP3, and LCJE, the DIJE method exhibits significant advantages in localization accuracy, robustness, and adaptability to initial parameters, and can meet the engineering requirements of high-accuracy and low-latency real-time indoor localization.
- Open Access
Research on a Particle Filtering Multi-Target Tracking Algorithm for Distributed Systems
The growth of unmanned aerial vehicle applications in the low-altitude economy demand advanced multi-target tracking systems. Unlike traditional approaches that assume independent measurements, distributed systems generate coupled measurements containing additional target relationship information. This paper proposes a novel distributed particle filtering algorithm through introducing the coupled measurement into the conventional particle filtering method. In the proposed method, we fuse direct and coupled measurements via optimization and then build a cost function to optimize the particle weights. Comparative evaluations across motion models, noise levels, and the number of targets demonstrate the outperforming performance of the proposed method compared to conventional particle filtering and the unscented Kalman filtering algorithm, with more than 7% accuracy improvement over baselines. The results prove particular robustness to measurement noise and the increasing number of targets.
Open AccessResearch on a Particle Filtering Multi-Target Tracking Algorithm for Distributed Systems
The growth of unmanned aerial vehicle applications in the low-altitude economy demand advanced multi-target tracking systems. Unlike traditional approaches that assume independent measurements, distributed systems generate coupled measurements containing additional target relationship information. This paper proposes a novel distributed particle filtering algorithm through introducing the coupled measurement into the conventional particle filtering method. In the proposed method, we fuse direct and coupled measurements via optimization and then build a cost function to optimize the particle weights. Comparative evaluations across motion models, noise levels, and the number of targets demonstrate the outperforming performance of the proposed method compared to conventional particle filtering and the unscented Kalman filtering algorithm, with more than 7% accuracy improvement over baselines. The results prove particular robustness to measurement noise and the increasing number of targets.
- Open Access
Research on Low-Altitude Aircraft Point Cloud Generation Method Using Single Photon Counting Lidar
To address the deficiency of aircraft point cloud training data for low-altitude environment perception systems, a method termed APCG (aircraft point cloud generation) is proposed. APCG can generate aircraft point cloud data in the single photon counting Lidar (SPC-Lidar) system based on information such as aircraft type, position, and attitude. The core of APCG is the aircraft depth image generator, which is obtained through adversarial training of an improved conditional generative adversarial network (cGAN). The training data of the improved cGAN are composed of aircraft depth images formed by spatial sampling and transformation of fine point clouds of 76 types of aircraft and 4 types of drone. The experimental results demonstrate that APCG is capable of efficiently generating diverse aircraft point clouds that reflect the acquisition characteristics of the SPC-Lidar system. The generated point clouds exhibit high similarity to the standard point clouds. Furthermore, APCG shows robust adaptability and stability in response to the variation in aircraft slant range.
Open AccessResearch on Low-Altitude Aircraft Point Cloud Generation Method Using Single Photon Counting Lidar
To address the deficiency of aircraft point cloud training data for low-altitude environment perception systems, a method termed APCG (aircraft point cloud generation) is proposed. APCG can generate aircraft point cloud data in the single photon counting Lidar (SPC-Lidar) system based on information such as aircraft type, position, and attitude. The core of APCG is the aircraft depth image generator, which is obtained through adversarial training of an improved conditional generative adversarial network (cGAN). The training data of the improved cGAN are composed of aircraft depth images formed by spatial sampling and transformation of fine point clouds of 76 types of aircraft and 4 types of drone. The experimental results demonstrate that APCG is capable of efficiently generating diverse aircraft point clouds that reflect the acquisition characteristics of the SPC-Lidar system. The generated point clouds exhibit high similarity to the standard point clouds. Furthermore, APCG shows robust adaptability and stability in response to the variation in aircraft slant range.
- Open Access
NELD-EC: Neighborhood-Effective-Line-Density-Based Euclidean Clustering for Point Cloud Segmentation
For the problem that it is difficult to effectively cluster lidar point clouds with irregular shapes and uneven densities, a Neighborhood Effective Line Density (NELD)-based Euclidean Clustering (NELD-EC) algorithm is proposed in this paper. The NELD-EC algorithm first eliminates the interfering points within the neighborhood of the data point by utilizing the distance relationship and calculates the NELD of the data point using the effective neighborhood set without interfering points of the data point. The NELD of a data point is taken as the local density of that data point. Then, the NELD-EC algorithm conducts clustering processing using the NELD of all data points and uses the reciprocal of the harmonic average of the local densities of all data points within each cluster after clustering as the distance threshold for the data points within the cluster. Finally, the NELD-EC algorithm completes the clustering of the point cloud based on the adjusted adaptive distance threshold. The clustering experimental results on simulated point clouds, fixed point clouds, and sequential point clouds indicate that, compared with several other typical Euclidean clustering algorithms, the NELD-EC algorithm requires simpler parameters to be set, is less sensitive to the initial distance threshold, can effectively reduce the occurrence probabilities of over-segmentation and under-segmentation, and has strong stability in clustering performance. The NELD-EC algorithm is more suitable for processing sequential point clouds in actual dynamic and complex scenarios.
Open AccessNELD-EC: Neighborhood-Effective-Line-Density-Based Euclidean Clustering for Point Cloud Segmentation
For the problem that it is difficult to effectively cluster lidar point clouds with irregular shapes and uneven densities, a Neighborhood Effective Line Density (NELD)-based Euclidean Clustering (NELD-EC) algorithm is proposed in this paper. The NELD-EC algorithm first eliminates the interfering points within the neighborhood of the data point by utilizing the distance relationship and calculates the NELD of the data point using the effective neighborhood set without interfering points of the data point. The NELD of a data point is taken as the local density of that data point. Then, the NELD-EC algorithm conducts clustering processing using the NELD of all data points and uses the reciprocal of the harmonic average of the local densities of all data points within each cluster after clustering as the distance threshold for the data points within the cluster. Finally, the NELD-EC algorithm completes the clustering of the point cloud based on the adjusted adaptive distance threshold. The clustering experimental results on simulated point clouds, fixed point clouds, and sequential point clouds indicate that, compared with several other typical Euclidean clustering algorithms, the NELD-EC algorithm requires simpler parameters to be set, is less sensitive to the initial distance threshold, can effectively reduce the occurrence probabilities of over-segmentation and under-segmentation, and has strong stability in clustering performance. The NELD-EC algorithm is more suitable for processing sequential point clouds in actual dynamic and complex scenarios.
- Open Access
- 16 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. PP, 1
Neighbor-Relationship-based Adaptive Density Peak Clustering
The Density Peak Clustering (DPC) algorithm encounters challenges such as difficulty in choosing cluster centers and the chain reaction caused by incorrect assignment of data points when clustering spatial datasets containing clusters with significant density differences or multi-peak clusters. To address these problems, in this paper, starting from enhancing the local density definition, optimizing the selection of cluster centers, and improving the assignment strategy of non-cluster center data points, an Adaptive DPC (NRA-DPC) algorithm is proposed based on the neighbor relationship. The NRA-DPC algorithm utilizes the reverse K-nearest neighbors of data points as the basis for defining the local density of data points and divides the spatial dataset into a core point set and a boundary point set based on the number of elements in the reverse K-nearest neighbor set of data points. The idea of iteration is adopted to select cluster centers from the core point set and assign non-cluster center data points, forming the initial clusters. For each initial cluster formed by the core point set, the corresponding minimum spanning tree (MST) is generated, and based on the average edge length of the MST, the assignment threshold of this cluster is set. The boundary point set completes the corresponding data point assignment task based on this assignment threshold and the mutual K-nearest neighbor relationship. Experimental results indicate that, compared with other typical clustering algorithms, the NRA-DPC algorithm can automatically select cluster centers, reduce the probability of incorrect assignment of non-cluster center data points, and effectively suppress the chain reaction triggered by incorrect assignment of non-cluster center data points, demonstrating more stable clustering performance when dealing with different datasets.
- 16 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. PP, 1
Open AccessNeighbor-Relationship-based Adaptive Density Peak Clustering
The Density Peak Clustering (DPC) algorithm encounters challenges such as difficulty in choosing cluster centers and the chain reaction caused by incorrect assignment of data points when clustering spatial datasets containing clusters with significant density differences or multi-peak clusters. To address these problems, in this paper, starting from enhancing the local density definition, optimizing the selection of cluster centers, and improving the assignment strategy of non-cluster center data points, an Adaptive DPC (NRA-DPC) algorithm is proposed based on the neighbor relationship. The NRA-DPC algorithm utilizes the reverse K-nearest neighbors of data points as the basis for defining the local density of data points and divides the spatial dataset into a core point set and a boundary point set based on the number of elements in the reverse K-nearest neighbor set of data points. The idea of iteration is adopted to select cluster centers from the core point set and assign non-cluster center data points, forming the initial clusters. For each initial cluster formed by the core point set, the corresponding minimum spanning tree (MST) is generated, and based on the average edge length of the MST, the assignment threshold of this cluster is set. The boundary point set completes the corresponding data point assignment task based on this assignment threshold and the mutual K-nearest neighbor relationship. Experimental results indicate that, compared with other typical clustering algorithms, the NRA-DPC algorithm can automatically select cluster centers, reduce the probability of incorrect assignment of non-cluster center data points, and effectively suppress the chain reaction triggered by incorrect assignment of non-cluster center data points, demonstrating more stable clustering performance when dealing with different datasets.
- Open Access
Research on Ground Object Echo Simulation of Avian Lidar
The clutter suppression effect of ground objects significantly impacts the detection and tracking performance of avian lidar on low-altitude bird flock targets. It is imperative to simulate the point cloud data of ground objects in lidar to explore effective methods for suppressing clutter caused by ground objects in avian lidar. The traditional ray-tracing method is enhanced in this paper to efficiently obtain the point cloud simulation results of ground objects. By incorporating a beam constraint and a light-energy constraint, the screening efficiency of effective rays is improved, making them more suitable for simulating large scenes with narrow lidar beams. In this paper, a collision detection scheme is proposed based on beam constraints, aiming to significantly enhance the efficiency of ray-tracing collision detection. The simulation and experimental results demonstrate that, in comparison with other conventional simulation methods, the proposed method yields the point cloud results of ground objects that exhibit greater conformity to the actual lidar-collected point cloud results in terms of shape characteristics and intensity features. Additionally, the simulation speed is significantly enhanced.
Open AccessResearch on Ground Object Echo Simulation of Avian Lidar
The clutter suppression effect of ground objects significantly impacts the detection and tracking performance of avian lidar on low-altitude bird flock targets. It is imperative to simulate the point cloud data of ground objects in lidar to explore effective methods for suppressing clutter caused by ground objects in avian lidar. The traditional ray-tracing method is enhanced in this paper to efficiently obtain the point cloud simulation results of ground objects. By incorporating a beam constraint and a light-energy constraint, the screening efficiency of effective rays is improved, making them more suitable for simulating large scenes with narrow lidar beams. In this paper, a collision detection scheme is proposed based on beam constraints, aiming to significantly enhance the efficiency of ray-tracing collision detection. The simulation and experimental results demonstrate that, in comparison with other conventional simulation methods, the proposed method yields the point cloud results of ground objects that exhibit greater conformity to the actual lidar-collected point cloud results in terms of shape characteristics and intensity features. Additionally, the simulation speed is significantly enhanced.
- Open Access
Target Detection in Single-Photon Lidar Using CNN Based on Point Cloud Method
To enhance the detection capability of weak targets and reduce the dependence of single-photon lidar target detection on the number of the time-correlated single-photon counting detection cycles, a convolutional neural network (CNN) based on the point cloud (CNN-PC) method is proposed in this paper for detecting targets in single-photon lidar. This approach utilizes the exceptional feature extraction capabilities offered by CNN. The CNN-PC method utilizes the feature extraction module of the trained CNN to simultaneously extract features from two-dimensional point cloud slices. Subsequently, it combines these features and feeds them into the classification module of the trained CNN for final target detection. By training the CNN using point cloud slices generated with a minimal number of detection cycles and employing a parallel structure to extract features from multiple point cloud slices, the CNN-PC method exhibits remarkable flexibility in adapting to varying numbers of detection cycles. Both simulation and experimental results demonstrate that the CNN-PC method outperforms the classical constant false alarm rate method in terms of the target detection probability at the same signal-to-noise ratio and in terms of the imaging rate and error rate at the same number of detection cycles.
Open AccessTarget Detection in Single-Photon Lidar Using CNN Based on Point Cloud Method
To enhance the detection capability of weak targets and reduce the dependence of single-photon lidar target detection on the number of the time-correlated single-photon counting detection cycles, a convolutional neural network (CNN) based on the point cloud (CNN-PC) method is proposed in this paper for detecting targets in single-photon lidar. This approach utilizes the exceptional feature extraction capabilities offered by CNN. The CNN-PC method utilizes the feature extraction module of the trained CNN to simultaneously extract features from two-dimensional point cloud slices. Subsequently, it combines these features and feeds them into the classification module of the trained CNN for final target detection. By training the CNN using point cloud slices generated with a minimal number of detection cycles and employing a parallel structure to extract features from multiple point cloud slices, the CNN-PC method exhibits remarkable flexibility in adapting to varying numbers of detection cycles. Both simulation and experimental results demonstrate that the CNN-PC method outperforms the classical constant false alarm rate method in terms of the target detection probability at the same signal-to-noise ratio and in terms of the imaging rate and error rate at the same number of detection cycles.
- Open Access
SignalFormer: Hybrid Transformer for Automatic Drone Identification Based on Drone RF Signals
With the growing integration of drones into various civilian applications, the demand for effective automatic drone identification (ADI) technology has become essential to monitor malicious drone flights and mitigate potential threats. While numerous convolutional neural network (CNN)-based methods have been proposed for ADI tasks, the inherent local connectivity of the convolution operator in CNN models severely constrains RF signal identification performance. In this paper, we propose an innovative hybrid transformer model featuring a CNN-based tokenization method that is capable of generating T-F tokens enriched with significant local context information, and complemented by an efficient gated self-attention mechanism to capture global time/frequency correlations among these T-F tokens. Furthermore, we underscore the substantial impact of incorporating phase information into the input of the SignalFormer model. We evaluated the proposed method on two public datasets under Gaussian white noise and co-frequency signal interference conditions, The SignalFormer model achieved impressive identification accuracy of 97.57% and 98.03% for coarse-grained identification tasks, and 97.48% and 98.16% for fine-grained identification tasks. Furthermore, we introduced a class-incremental learning evaluation to demonstrate SignalFormer’s competence in handling previously unseen categories of drone signals. The above results collectively demonstrate that the proposed method is a promising solution for supporting the ADI task in reliable ways.
Open AccessSignalFormer: Hybrid Transformer for Automatic Drone Identification Based on Drone RF Signals
With the growing integration of drones into various civilian applications, the demand for effective automatic drone identification (ADI) technology has become essential to monitor malicious drone flights and mitigate potential threats. While numerous convolutional neural network (CNN)-based methods have been proposed for ADI tasks, the inherent local connectivity of the convolution operator in CNN models severely constrains RF signal identification performance. In this paper, we propose an innovative hybrid transformer model featuring a CNN-based tokenization method that is capable of generating T-F tokens enriched with significant local context information, and complemented by an efficient gated self-attention mechanism to capture global time/frequency correlations among these T-F tokens. Furthermore, we underscore the substantial impact of incorporating phase information into the input of the SignalFormer model. We evaluated the proposed method on two public datasets under Gaussian white noise and co-frequency signal interference conditions, The SignalFormer model achieved impressive identification accuracy of 97.57% and 98.03% for coarse-grained identification tasks, and 97.48% and 98.16% for fine-grained identification tasks. Furthermore, we introduced a class-incremental learning evaluation to demonstrate SignalFormer’s competence in handling previously unseen categories of drone signals. The above results collectively demonstrate that the proposed method is a promising solution for supporting the ADI task in reliable ways.
- Open Access
Efficient Localization Method Based on RSSI for AP Clusters
The localization accuracy is susceptible to the received signal strength indication (RSSI) fluctuations for RSSI-based wireless localization methods. Moreover, the maximum likelihood estimation (MLE) of the target location is nonconvex, and locating target presents a significant computational complexity. In this paper, an RSSI-based access point cluster localization (APCL) method is proposed for locating a moving target. Multiple location-constrained access points (APs) are used in the APCL method to form an AP cluster as an anchor node (AN) in the wireless sensor network (WSN), and the RSSI of the target is estimated with several RSSI samples obtained by the AN. With the estimated RSSI for each AN, the solution for the target location can be obtained quickly and accurately due to the fact that the MLE localization problem is transformed into an eigenvalue problem by constructing an eigenvalue equation. Simulation and experimental results show that the APCL method can meet the requirement of high-precision real-time localization of moving targets in WSN with higher localization accuracy and lower computational effort compared to the existing classical RSSI-based localization methods.
Open AccessEfficient Localization Method Based on RSSI for AP Clusters
The localization accuracy is susceptible to the received signal strength indication (RSSI) fluctuations for RSSI-based wireless localization methods. Moreover, the maximum likelihood estimation (MLE) of the target location is nonconvex, and locating target presents a significant computational complexity. In this paper, an RSSI-based access point cluster localization (APCL) method is proposed for locating a moving target. Multiple location-constrained access points (APs) are used in the APCL method to form an AP cluster as an anchor node (AN) in the wireless sensor network (WSN), and the RSSI of the target is estimated with several RSSI samples obtained by the AN. With the estimated RSSI for each AN, the solution for the target location can be obtained quickly and accurately due to the fact that the MLE localization problem is transformed into an eigenvalue problem by constructing an eigenvalue equation. Simulation and experimental results show that the APCL method can meet the requirement of high-precision real-time localization of moving targets in WSN with higher localization accuracy and lower computational effort compared to the existing classical RSSI-based localization methods.