A Fast Adaptive Millimeter-Wave Radar Clustering Algorithm.

This paper focuses on the intelligent recognition problem of radar detection targets. Aiming at the low accuracy and slow speed of millimeter-wave radar clustering point cloud information, a feature algorithm of millimeter-wave radar suitable for detecting targets is proposed. In the detection of targets by millimeter-wave radar, distance is the biggest factor affecting the number and degree of sparsity. A method that combines the feature information of the point cloud with the KD tree proximity search algorithm and the DBSCAN clustering algorithm is proposed, which can adapt to the problems of uneven target point cloud, small amount of data and slow clustering speed. The improved algorithm can use the KD tree to quickly find adjacent points and calculate the distance between adjacent points. The corresponding number of thresholds is set according to the distance where the target is located, and the radius of the target area reflected by the millimeter-wave radar plus the distance of the last threshold point is used as the neighborhood radius of the improved algorithm. Therefore, fast and adaptive parameter adjustment of the millimeter-wave radar can be realized. Simulation tests show that the improved clustering algorithm has better parameters. The accuracy of the improved algorithm is increased by 4.2%, and it also greatly improves the clustering speed. [ABSTRACT FROM AUTHOR]