One of the main tasks involving the extended target tracking is how to partition the measurement set accurately and efficiently. In this article, an efficient graph-based partitioning algorithm is introduced for extended target tracking. To reduce the computational load and the interference of clutter on the measurement set partition, a measurement set preprocessing method based on density-based clustering algorithm is presented. An intuitive directed k-nearest neighbor (kNN) graph model based on graph theory is established to represent the relationship between different measurements in the measurement set that needs to be segmented. In the framework of directed kNN graph, a novel similarity metric based on shared nearest neighbor (SNN) is used, and a pairwise similarity that integrates the number of elements in the set of SNN and the closeness of data points is constructed. The spectral clustering algorithm is used to process the multiway cut in the directed kNN graph. The graph-based partitioning algorithm is applied to the extended target Gaussian mixture probability hypothesis density filter. Simulation results illustrate the advantages of our proposed graph-based partitioning algorithm in performance and computational efficiency.

中文翻译：

---

应用基于图的高效分区算法使用 GM-PHD 滤波器进行扩展目标跟踪


扩展目标跟踪的主要任务之一是如何准确有效地划分测量集。在本文中，介绍了一种有效的基于图的分区算法，用于扩展目标跟踪。为了减少计算量和杂波对测量集划分的干扰，提出一种基于密度聚类算法的测量集预处理方法。建立基于图论的直观有向k近邻（kNN）图模型来表示需要分割的测量集中不同测量之间的关系。在有向kNN图的框架中，使用了一种基于共享最近邻（SNN）的新颖相似度度量，并构建了综合SNN集合中元素数量和数据点紧密程度的成对相似度。谱聚类算法用于处理有向kNN图中的多路割。基于图的划分算法应用于扩展目标高斯混合概率假设密度滤波器。仿真结果说明了我们提出的基于图的划分算法在性能和计算效率方面的优势。