| 快速JPDA算法的递归和并行实现 |
| |
| 引用本文： | 程洪玮,周一宇,孙仲康.快速JPDA算法的递归和并行实现[J].国防科技大学学报,1998,20(3):61-69. |
| |
| 作者姓名： | 程洪玮 周一宇 孙仲康 |
| |
| 作者单位： | 国防科技大学电子工程学院 |
| |
| 摘 要： | 本文从联合关联事件的构造出发，讨论关联假设事件的分层构造，以达到降低计算量的目的。这里的层次可从０取到Ｌ，０层表示没有任何目标能够跟当前的观测数据关联，Ｌ层表示共有Ｌ个目标可以跟当前扫描得到的观测数据相关联。本文的关联事件的构造中，各层次的搜索具有递归性并可以独立进行，因而可以并行实现。文中还将本文的方法跟有关文献作了比较，并且给出相应的计算机仿真实验及其结果。
|
| 关 键 词： | 概率，数据关联，目标跟踪，快速算法 |
| 收稿时间： | 1997/12/5 0:00:00 |
Recursive and Parallel Implementation of Fast JPDA Algorithm |
| |
| Cheng hongwei,Zhou yiyu and Sun zhongkang.Recursive and Parallel Implementation of Fast JPDA Algorithm[J].Journal of National University of Defense Technology,1998,20(3):61-69. |
| |
| Authors: | Cheng hongwei Zhou yiyu and Sun zhongkang |
| |
| Institution: | Institute of Electronic Engineering, NUDT, Changsha, 410073;Institute of Electronic Engineering, NUDT, Changsha, 410073;Institute of Electronic Engineering, NUDT, Changsha, 410073 |
| |
| Abstract: | This paper discusses a method to reduce calculation load by means of layered searching construction of association hypothesis events. The layer here can take 0 value or an integer L. Layer 0 means that no target can find its association data from current returns. Layer L means that L targets can find their association data from current returns. Our layered construction method in the paper is recursive and of independence among layers, so it can also be implemented in parallel structure. Comparative analysis of the method with relative methods in other references and the corresponding computer simulation tests and the results are also given in the paper. |
| |
| Keywords: | probability data association target tracking fast algorithm |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《国防科技大学学报》浏览原始摘要信息 |
| 点击此处可从《国防科技大学学报》下载免费的PDF全文 |
