Improved K-Means Algorithm for Nearby Target Localization

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 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 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.

Authors

Institutions

Publication Details

Journal
IEEE Access
Published
2024-10-11
DOI
https://doi.org/10.1109/access.2024.3479091
Citations
1
Primary Topic
Infrared Target Detection Methodologies
Type
article
Field-Weighted Citation Impact
1.30
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Improved K-Means Algorithm for Nearby Target Localization

Fuyang Chen, Xingdi Wang, Zongwen Yuan, Xicheng Ma
1 citations
IEEE Access
Infrared Target Detection Methodologies
1.30
article

Improved K-Means Algorithm for Nearby Target Localization

Fuyang Chen, Xingdi Wang, Zongwen Yuan, Xicheng Ma
article en
1 citations

Abstract

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 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 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.

IEEE AccessVol. 13
Beijing Aerospace Flight Control Center (CN), Chaohu University (CN), Nanjing University of Aeronautics and Astronautics (CN)
Openalex Percentile: Top 12%
Infrared Target Detection Methodologies
1.30
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Improved K-Means Algorithm for Nearby Target Localization — Fuyang Chen, Xingdi Wang, et al. · IEEE Access (2024) | TGRS Research Map | TGRS