摘要
联合概率数据关联算法是密集杂波环境下一种良好的多目标数据关联跟踪算法。计算量爆炸效应一直是该算法的一个难题。本文提出一种基于分层构造关联事件的快速算法,层次间的搜索具有递归性并可以独立进行,因而可以并行实现。文中还将本文的方法跟有关文献方法作了比较,并且给出相应的计算机仿真实验和结果。
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 propose 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.
基金
国防预研基金
