An efficient algorithm is developed to compute the a posteriori probabilities of the origins of measurements in the joint probabilistic data association filter (JPDAF). The inherited parallelism of this algorithm enables it to be suitable for implementation in a multiprocessor system. In this algorithm the a posteriori probability of the origin of each measurement in the JPDAF is decomposed into two parts. The computation of one part becomes trivial and the algorithm developed here is implemented on the other part, which is shown to be related to permanents. The computational complexity of this algorithm is analyzed in the worst case as well as in the average case. An analysis of this algorithm enables us to conclude that this algorithm is more efficient than other existing ones in the average case.<>
An efficient algorithm for data association in multitarget tracking
IEEE Transactions on Aerospace and Electronic Systems ; 31 , 1 ; 458-468
1995-01-01
1004096 byte
Article (Journal)
Electronic Resource
English
An Efficient Algorithm for Data Association in Multitarget Tracking
Online Contents | 1995
|Data Association in Multitarget Tracking with Multisensor
British Library Conference Proceedings | 1997
|CORRESPONDENCE - Polynomial Time Algorithm for Data Association Problem in Multitarget Tracking
Online Contents | 2004
|Multitarget tracking algorithm performance evaluation
British Library Conference Proceedings | 1999
|