首页 | 官方网站   微博 | 高级检索  
     

基于最大熵模糊聚类的快速数据关联算法
引用本文:李良群,姬红兵.基于最大熵模糊聚类的快速数据关联算法[J].西安电子科技大学学报,2006,33(2):251-256.
作者姓名:李良群  姬红兵
作者单位:西安电子科技大学电子工程学院,陕西西安710071
摘    要:提出了一种新颖的快速数据关联算法,减少了滤波中关联概率的计算量.该算法利用多个并行改进的最大熵模糊聚类对各个目标的有效观测进行聚类,采用聚类得到的模糊隶属度来重建滤波中的联合关联概率,并在联合关联概率中引入了比例因子避免航迹的合并;此外,分析了算法中差异因子的特性,考虑了杂波密度对它的影响,使得能够有效剔除无效观测,进一步减少计算量.仿真实验结果表明,提出的方法是一种有效的快速数据关联算法,跟踪性能要优于现有的数据关联算法.

关 键 词:最大熵模糊聚类  数据关联  联合关联概率
文章编号:1001-2400(2006)02-0251-06
收稿时间:2005-04-27
修稿时间:2005-04-27

Fast data association algorithm based on maximum entropy fuzzy clustering
LI Liang-qun,JI Hong-bing.Fast data association algorithm based on maximum entropy fuzzy clustering[J].Journal of Xidian University,2006,33(2):251-256.
Authors:LI Liang-qun  JI Hong-bing
Affiliation:School of Electronic Engineering, Xidian Univ., Xi’an 710071, China
Abstract:A novel fast data association method is proposed, which reduces the computational load of the association probability in filtering. Firstly, the candidate measurements of each target are clustered with the aid of the modified maximum entropy fuzzy clustering. Then the joint association probability is reconstructed by utilizing the fuzzy membership degree of the target and measurement. At the same time, in order to avoid the track coalescence, the scaling factor is introduced to modify the joint association probability. Moreover, the characteristic of the discrimination factor is analyzed and the influence of the clutter density on it is also considered, which enables the algorithm to eliminate those invalidate measurements and reduce the computational load. Finally, simulation results show that the fast data association algorithm is effective, and that the performance of tracking is better than that of the existing ones.
Keywords:maximum entropy fuzzy clustering  data association  joint association probability
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《西安电子科技大学学报》浏览原始摘要信息
点击此处可从《西安电子科技大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号