| 一种近似的联合概率数据互联算法 |
| |
| 引用本文： | 邓未央,王宝树.一种近似的联合概率数据互联算法[J].电光与控制,2004,11(2):42-44,53. |
| |
| 作者姓名： | 邓未央 王宝树 |
| |
| 作者单位： | 西安电子科技大学计算机学院,陕西,西安,710071;西安电子科技大学计算机学院,陕西,西安,710071 |
| |
| 基金项目： | 国防科技预研基金项目(51406050301DZ0107)资助 |
| |
| 摘 要： | 提出了一种新的联合概率数据互联的算法。该算法针对传统的联合概率数据互联算法在产生互联假设事件时计算代价大的问题,提出了一种绕过互联假设事件的生成而直接计算量测和目标的联合概率的方法,通过仿真实验证明,该法在目标密集程度中等的杂波环境下,计算代价得到了大幅的降低,而关联精度仅有少许降低,能够适应工程的要求。
|
| 关 键 词： | 联合概率 数据互联 近似聚 |
| 文章编号： | 1671-637X(2004)02-0042-03 |
An approximate joint probability data association algorithm |
| |
| DENG Wei-yang,WAND Bao-shu.An approximate joint probability data association algorithm[J].Electronics Optics & Control,2004,11(2):42-44,53. |
| |
| Authors: | DENG Wei-yang WAND Bao-shu |
| |
| Abstract: | This paper brings out a new Joint Probability Data Association Algorithm. To solve the problem of high computing cost for generating association hypothesis event in the traditional MSJPDA, a new method is given for computing directly the association probability of measures and targets without generating association hypothesis event. Simulation proves that in the situation of medium targets density, this algorithm needs much less computing cost and only a lilttle association precision is lost. |
| |
| Keywords: | joint probability data association approximate cluster |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
