A Novel Non-maximum Suppression Algorithm Based on Affinity Propagation Clustering

Author(s):  
Guangyuan Xu ◽  
Shuangxi Huang
2008 ◽  
Vol 9 (10) ◽  
pp. 1373-1381 ◽  
Author(s):  
Ding-yin Xia ◽  
Fei Wu ◽  
Xu-qing Zhang ◽  
Yue-ting Zhuang

2021 ◽  
Author(s):  
Dongming Lin ◽  
Hongjun Wang

Abstract Considering the reconstruction of electromagnetic maps without the prior information of electromagnetic propagation environment in the target area, a new algorithm based on affinity propagation clustering is proposed to complete the electromagnetic map reconstruction of the target area from points to surfaces and then from points and surfaces to a larger surface. Firstly, according to the actual situation, the target area is reasonably divided into grids. Electromagnetic data is sampled by distributed sensing nodes, and a certain number of sample points are selected for affinity propagation clustering to determine the locations of centers of sample points. Secondly, for the incomplete sample data, the Kriging algorithm is used to reconstruct the small circular electromagnetic maps. The class center is the center of the circle and the radius is certain. After that, the obtained small area electromagnetic map data and the data obtained from the sample points are used for domain mapping processing, and the electromagnetic data of a larger area of the target area is obtained. Finally, the overall electromagnetic map is reconstructed through data fusion. The simulation results show that the proposed algorithm is better than several interpolation algorithms. When sample points account for 0.1 of total data points, the RMSE of the result is less than 1.5.


Sign in / Sign up

Export Citation Format

Share Document