基于自适应流聚类的多站时差协同信号分选方法
Cooperative Signal Sorting Method Based on Multi-station TDOA and Adaptive Stream Clustering
-
摘要: 多站时差协同信号分选是解决脉间波形捷变雷达信号分选的有效方法。已有批处理多站时差协同信号分选方法实时性不足,且存在无法有效挖掘雷达脉冲流动态变化特性的问题,该文提出一种基于自适应流聚类的多站时差协同信号分选方法。针对已有流聚类算法在雷达信号样本密度不平衡的情况下存在容易增批分选的问题,提出利用多站时差测量误差估计量对流聚类生成簇进行自适应检测与合并,有效抑制雷达簇增批现象的发生,以解决分选增批的问题。同时,通过利用多站时差测量误差估计量实现在线聚类阈值自适应设置,提高脉冲归属正确雷达簇的概率,减少在线聚类算法迭代次数。使用基于时间衰减窗口模型的未知簇检测,提高聚类概要的更新速度,避免了有效样本数过少而导致的聚类失败,提高了分选算法的环境适应性。仿真结果表明,与现有分选算法相比,面对不平衡复杂脉间波形捷变信号,该算法能够进行抑制增批,有效分选出正确雷达结果;面对多部雷达的出现/失活/复活演化过程,该算法可精准检测并展示动态演化特性;面对多部复杂脉间波形捷变信号,对比已有算法的算法复杂度大幅降低,特别在脉冲样本数密集情况下,能更好的保证分选处理的实时性;面对较大的多站时差测量误差和脉冲丢失率情况下,具有较高的分选正确率。Abstract: Cooperative signal sorting based on multi-station time difference of arrival is an effective method for dealing with the sorting of inter-pulse waveform agility radar signals. Existing batch processing methods for multi-station time difference of arrival cooperative signal sorting lack real-time capabilities and fail to effectively mine the dynamic characteristics of radar pulse streams. This paper proposes a multi-station time difference of arrival cooperative signal sorting method based on adaptive stream clustering. The stream clustering algorithm is introduced into the realm of multi-station time difference of arrival cooperative signal sorting, exploiting its capability for continuous and rapid analysis of data to unearth the dynamic characteristics of radar pulse streams. When applied to the multi-station time difference of arrival cooperative signal sorting, it was discovered that the existing stream clustering algorithm tends to resort to increasing batch sizes in sorting in the presence of an imbalance in radar signal sample densities. Therefore, an enhancement is made to the stream clustering algorithm. By using the estimated error of multi-station time difference measurements for adaptive detection of the clusters formed by stream clustering, it was found that radar clusters were increasing in batch. Adaptive merging of these increasing-batch radar clusters effectively suppresses the occurrence of this phenomenon, thereby addressing the issue of increasing-batch in multi-station time difference of arrival cooperative signal sorting. Moreover, by utilizing multi-station time difference measurement error estimates to set clustering thresholds adaptively online, the probability of pulses being correctly assigned to radar clusters is increased, and the number of iterations required by the online clustering algorithm is decreased, thus effectively enhancing the computational speed of the algorithm. Utilizing a time-decay window model for unknown cluster detection allows for time-weighted evaluation of each data point arriving at the effective clustering repository. Early-arriving data points are given smaller weights, whereas recent arrivals are weighted more heavily. By calculating the total weighted value within the effective clustering library, the response speed for updating the clustering summary is enhanced, avoiding the failure of clustering due to an insufficient number of effective samples and improving the adaptive nature of the sorting algorithm to its environment. On the basis of the Stream Affinity Propagation algorithm and the aforementioned improvements, Adapt-Stream Affinity Propagation is proposed. Simulation results indicate that, compared to the existing multi-station time difference of arrival cooperative signal sorting algorithms, Adapt-Stream Affinity Propagation can suppress increasing-batch issues and effectively sort the correct radar signals when dealing with the imbalanced and complex inter-pulse waveform agility signals that are mixed together. Facing the evolution process of multiple complex agility radars' appearance, deactivation, and reactivation, the algorithm can precisely detect and display dynamic evolution characteristics, with results evolving in correspondence to the evolution of radar pulses. When dealing with multiple complexes inter-pulse waveform agility signals, the complexity of Adapt-Stream Affinity Propagation is significantly reduced compared to the existing multi-station time difference of arrival cooperative signal sorting algorithms, notably accelerating processing speed in high-density pulse sample scenarios, thereby better ensuring the real-time processing of multi-station time difference of arrival cooperative signal sorting. Even in situations of large multi-station time difference measurement errors and high pulse loss rates, the algorithm ensures the correctness and usability of the results, achieving a high sorting accuracy rate. Therefore, in multiple simulation comparisons, the Adapt-Stream Affinity Propagation algorithm proves to be an effective method for processing inter-pulse waveform agility radar signals in multi-station time difference of arrival cooperative signal sorting.