A recursive and parallel fast JPDA algorithm |
| |
Authors: | Hongwei Cheng Yiyu Zhou Zhongkang Sun |
| |
Affiliation: | (1) Institute of Electronic Engineering, National University of Defense Technology, 410073 Changsha, Hunan |
| |
Abstract: | Joint Probabilistic Data Association (JPDA) is a very fine optimal multitarget tracking and association algorithm in clutter. However, the calculation explosion effect in computation of association probabilities has been a difficulty. This paper will discuss a method based on layered searching construction of association hypothesis events. According to the method, the searching schedule of the association events between two layers can be recursive and with independence, so it can also be implemented in parallel structure. Comparative analysis of the method with relative methods in other references and corresponding computer simulation tests and results are also given in the paper. |
| |
Keywords: | Probability Data association and tracking Fast algorithm |
本文献已被 CNKI SpringerLink 等数据库收录! |
| 点击此处可从《电子科学学刊(英文版)》浏览原始摘要信息 |
|
点击此处可从《电子科学学刊(英文版)》下载全文 |