레이더 군집화를 위한 반복 K-means 클러스터링 알고리즘Repeated K-means Clustering Algorithm For Radar Sorting

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 88
  • Download : 0
In modern electronic warfare, a number of radar emitters are in operation, causing radar receivers to receive high-density signal pulses that occur simultaneously. To analyze the radar signals more accurately and identify enemies, the sorting process of high-density radar signals is very important before analysis. Recently, machine learning algorithms, specifically K-means clustering, are the subject of research aimed at improving the accuracy of radar signal sorting. One of the challenges faced by these studies is that the clustering results can vary depending on how the initial points are selected and how many clusters number are set. This paper introduces a repeated K-means clustering algorithm that aims to accurately cluster all data by identifying and addressing false clusters in the radar sorting problem. To verify the performance of the proposed algorithm, experiments are conducted by applying it to simulated signals that are generated by a signal generator.
Publisher
한국군사과학기술학회
Issue Date
2023-12
Language
Korean
Citation

한국군사과학기술학회지, v.26, no.6, pp.384 - 391

ISSN
1598-9127
URI
http://hdl.handle.net/10203/315693
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0