摘要： 针对现有飞行目标的航迹聚类算法的不足，提出的一种可对任意形状的航迹聚类，且不需提前划分聚类目标个数，可解决时空域航迹数据的聚类方法。通过航迹信息中的空间坐标以及时间信息，扫描选取航迹数据中的任意未标记点，进行时间域上的邻近点扫描，再对时间邻域内的点进行空间域扫描，通过时空域内邻近点迹的数量将相同目标的航迹形成簇，并通过数据仿真验证本聚类方法的有效性。

中图分类号： TN95
文献标识码： A
DOI：10.16157/j.issn.0258-7998.212331
中文引用格式： 朱瑜亮. 基于ST DBSCAN的航迹聚类实现[J].电子技术应用，2022，48(5)：125-128.
英文引用格式： Zhu Yuliang. Implementation of track clustering based on ST DBSCAN[J]. Application of Electronic Technique，2022，48(5)：125-128.

Implementation of track clustering based on ST DBSCAN

Abstract： Aiming at the shortcomings of existing track clustering algorithms for flying targets, a clustering method for track data in space-time domain is proposed, which can cluster tracks of arbitrary shape without dividing the number of clustering targets in advance. Through the spatial coordinates and time information in the track information,it scans and selects any unmarked points in the track data, scan the proximity points in the time domain, and then scans the points in the time neighborhood in the space domain. Cluster the tracks of the same target through the number of proximity points in the space-time domain, and verify the effectiveness of this clustering method through data simulation.

Key words : air target；track clustering；ST DBSCAN；simulation；clustering parameters