| 引用本文: | 程洪玮,周一宇,孙仲康.快速JPDA算法的递归和并行实现.[J].国防科技大学学报,1998,20(3):61-69.[点击复制] |
| Cheng hongwei,Zhou yiyu,Sun zhongkang.Recursive and Parallel Implementation of Fast JPDA Algorithm[J].Journal of National University of Defense Technology,1998,20(3):61-69[点击复制] |
|
| |
|
|
| 本文已被：浏览 6204次 下载 6389次 |
| 快速JPDA算法的递归和并行实现 |
| 程洪玮, 周一宇, 孙仲康 |
|
(国防科技大学 电子工程学院 湖南 长沙 410073)
|
| 摘要: |
| 本文从联合关联事件的构造出发, 讨论关联假设事件的分层构造, 以达到降低计算量的目的。这里的层次可从0取到L, 0层表示没有任何目标能够跟当前的观测数据关联, L层表示共有L个目标可以跟当前扫描得到的观测数据相关联。本文的关联事件的构造中, 各层次的搜索具有递归性并可以独立进行, 因而可以并行实现。文中还将本文的方法跟有关文献作了比较, 并且给出相应的计算机仿真实验及其结果。 |
| 关键词: 概率, 数据关联, 目标跟踪, 快速算法 |
| DOI： |
| 投稿日期：1997-12-05 |
| 基金项目:国防预研基金资助项目 |
|
| Recursive and Parallel Implementation of Fast JPDA Algorithm |
| Cheng hongwei, Zhou yiyu, Sun zhongkang |
|
(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 |
|
|
|
|
|
