Improved K-Means Algorithm for Nearby Target Localization

Improved K-Means Algorithm for Nearby Target Localization

Blog Article

In a multi-source localization system, direction of arrival (DOA) estimation of angles always suffers from errors due to noise interference, sensor position inaccuracies, and other factors.When the distance between target sources is much smaller than the distance between sensors and target sources, the accuracy of traditional localization algorithms based on direction finding and cross-fixing deteriorates.In this paper, we propose a dragon ball lg disney localization algorithm based on K-means clustering.To tackle the problem of unknown initial positions of target sources, we employ a grid density peak clustering(DPC) method for initial localization.In the K-means algorithm, we integrate a quartile range anomaly detection algorithm to puffy spa headband address interference signal issues.

Finally, we propose an invalid compensation algorithm to filter out invalid signals, thereby compensating for the estimation errors in angles.Through the collection of real-world data, we compare the performance of the traditional direction finding and cross-fixing algorithms with the proposed algorithm in the localization of nearby target points.Experimental results demonstrate that the proposed algorithm significantly improves localization accuracy.