Subspace Decomposition Based Adaptive Density Peak Clustering for Radar Signals Sorting

Abstract

Radar signal sorting (RSS) plays an important role in the electronic support measurement system. However, the existing clustering-based RSS methods depend heavily on prior knowledge to achieve excellent performance, which may bring severe challenges to RSS in actual scenarios. This letter proposes a novel subspace decomposition based adaptive density peak clustering (SD-ADPC) method to address the problems of low accuracy and high computational cost in RSS. First, the original complex radar signal data is directly decomposed into two-dimensional (2D) subspace by t-distributed random neighborhood embedding (t-SNE). Then, based on the outlier detection of the products between the peak density and the distance of the data points, ADPC is used to adaptively determine the optimal clustering centers of the original data in 2D subspace. Finally, the reminding data is assigned to its nearest cluster with Euclidean distance in one step. The experimental results of the simulated RSS dataset and the open baselines show that our proposed method does not require any knowledge and can achieve better or competitive performance in terms of accuracy and computational cost, compared to existing state-of-the-art methods.