首页 | 本学科首页   官方微博 | 高级检索  
     

基于相似性传播的天波雷达多路径量测聚类
引用本文:白向龙,兰华,张卓,王增福,潘泉.基于相似性传播的天波雷达多路径量测聚类[J].电子与信息学报,2023,45(4):1265-1274.
作者姓名:白向龙  兰华  张卓  王增福  潘泉
作者单位:西北工业大学自动化学院信息融合技术教育部重点实验室 西安 710129
基金项目:国家自然科学基金(61873211, 61790552),陕西省自然科学基础研究计划(2021JM-067)
摘    要:电离层多层结构特性使得天波雷达(OTHR)与目标之间存在多条信号传播路径,进而可能对单目标产生多路径量测。该文考虑了天波雷达多路径量测聚类问题,其需要同时对多路径量测进行电离层传播路径辨识和聚类。由于天波雷达量测模型假设1个目标通过1种电离层传播路径至多产生1个量测,因此需要考虑多路径聚类约束。该文将相似性传播聚类扩展到多路径约束模型,并提出一种新的多路径相似性传播聚类算法。该算法通过构建多路径量测聚类的概率图模型,将聚类问题转化为概率图模型隐变量的推断问题,采用最大和置信传播算法近似求解聚类变量的最大后验概率。算法优点包括可以自动识别聚类团数目,单次消息传播的时间复杂度为量测个数和传播路径个数乘积的平方。仿真实验分析表明,所提算法较多路径多假设聚类算法具有更好的聚类性能。

关 键 词:天波雷达  多路径  量测聚类  相似性传播  置信传播
收稿时间:2022-02-28

Multipath Measurements Clustering of Over-The-Horizon Radar Based on Affinity Propagation
BAI Xianglong,LAN Hua,ZHANG Zhuo,WANG Zengfu,PAN Quan.Multipath Measurements Clustering of Over-The-Horizon Radar Based on Affinity Propagation[J].Journal of Electronics & Information Technology,2023,45(4):1265-1274.
Authors:BAI Xianglong  LAN Hua  ZHANG Zhuo  WANG Zengfu  PAN Quan
Affiliation:School of Automation, Northwestern Polytechnical University, Key Laboratory of Information Fusion Technology, Ministry of Education, Xi’an 710129, China
Abstract:The multi-layer structure of the ionosphere can support several signal propagation paths between the sky-wave Over-The-Horizon Radar (OTHR) and targets, often giving rise to multipath measurements for a single target. The problem of multipath measurements clustering for OTHR is considered, which needs to solve the problems of multipath measurements recognition and measurements clustering at the same time. OTHR measurements model assumes that a target can generate at most one measurement through an ionospheric propagation path, and multipath clustering constraints need to be considered. In this paper, affinity propagation clustering is extended to multipath constraint model, and a new multipath constraint affinity propagation clustering algorithm is proposed. The algorithm transforms the clustering problem into an inference problem by constructing the probabilistic graphical model of multipath measurements clustering, and uses the max-sum belief propagation to approximate the maximum a posteriori probability of the clustering matrix. The advantages of the algorithm include that it identifies automatically the number of clusters, and the computational complexity scales quadratically in the number of measurements and the number of propagation paths. Simulation results show that, the proposed method can outperform multiple hypothesis multipath clustering algorithm.
Keywords:
点击此处可从《电子与信息学报》浏览原始摘要信息
点击此处可从《电子与信息学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号