Acceleration of the Multi-Level Fast Multipole Algorithm Using K-Means Clustering

Abstract

The multilevel fast multipole algorithm (MLFMA) using K-means clustering to accelerate electromagnetic scattering analysis for large complex targets is presented. By replacing the regular cube grouping with the K-means clustering, the addition theorem is more accurately approximated. The convergence rate of an iterative solver is thus improved significantly. However, irregular centroid locations as a result of the K-means clustering increase the amount of explicit transfer function calculations, compared with the regular cubes. In the MLFMA, a multilevel hierarchical structure is applied to the finite multipole method (FMM) to reduce transfer function calculations. Therefore, the MLFMA is suitable for applying K-means clustering. Simulation results with both canonical and realistic targets show an improvement in the computation time of the proposed algorithm.

Vehicle Detection Based on Information Fusion of mmWave Radar and Monocular Vision

“…The correlation between mmWave radar data of the same frame was used to determine which 3D detection points are from the same target and gather the target points of the same object together. Currently, the commonly used clustering algorithms in engineering mainly include the K-Means algorithm [39] and the DBSCAN algorithm. The K-Means algorithm is simple in principle but it does not apply to the clustering of mmWave radar 3D detection points because it needs to set the K value in advance.…”

CBF Computation Acceleration of CBFM Using k-Means Clustering Algorithm

“…계산 시간 가속화를 위해 여러 해석 영역을 어떻게 나 누는지도 문제 해석에 있어 중요한 요소 중에 하나이며, 이를 위해 클러스터링을 활용하기 위한 연구가 활발히 진행되고 있다. 실제로, 전자기 해석 문제에서는 FMM, MLFMM과 같은 알고리즘에서 해의 수렴성 향상과 계산 자원 비용을 줄이기 위해서  -평균 클러스터링 알고리즘 이 사용되어 왔다 [3], [4] .…”