Multiple Extended Target Tracking Algorithm Based on Spatio-Temporal Correlation

Abstract

In the clutter environment, the measurement of a set of multiple extended targets, with an unknown number of targets, poses challenges in partitioning, and the computational cost is high. In particular, the multiple extended target tracking method, based on distance partition, has obvious potential estimation errors when the extended targets intersect. This paper proposes a partition algorithm, based on spatio-temporal correlation, which considers the correlation between adjacent moments of the extended target and uses this prior information to divide the measurement set into a survival target measurement set and a born target measurement set for the first time. Then, the survival target measurement set is clustered by the K-means++ algorithm, and the extended target tracking is transformed into point target tracking. The born target measurement undergoes preprocessing by the DBSCAN clustering algorithm, and then uses the directed graph with shared nearest neighbors (SNN) dividing the measurement set. The method proposed in this paper significantly reduces the number of partitions and the computational time. The effectiveness of the algorithm is demonstrated through experimental simulations.

Keywords

• multi-extended target tracking
• spatio-temporal correlation
• measurement set partition
• probability hypothesis density filter