The problem of tracking multiple targets in the presence of clutter is addressed. The joint probabilistic data association (JPDA) algorithm has been previously reported to be suitable for this problem in that it makes few assumptions and can handle many targets as long as the clutter density is not very high. However, the complexity of this algorithm increases rapidly with the number of targets and returns. An approximation of the JPDA that uses an analog computational network to solve the data association problem is suggested. The problem is viewed as that of optimizing a suitably chosen energy function. Simple neural-network structures for the approximate minimization of such functions have been proposed by other researchers. The analog network used offers a significant degree of parallelism and thus can compute the association probabilities more rapidly. Computer simulations indicate the ability of the algorithm to track many targets simultaneously in the presence of moderately dense clutter.<>
Neural solution to the multitarget tracking data association problem
IEEE Transactions on Aerospace and Electronic Systems ; 25 , 1 ; 96-108
1989-01-01
932443 byte
Article (Journal)
Electronic Resource
English
A Comprehensive Analysis of "Neural Solution to the Multitarget Tracking Data Association Problem"
Online Contents | 1993
|Shared-memory parallelization of the data association problem in multitarget tracking
Tema Archive | 1997
|CORRESPONDENCE - Polynomial Time Algorithm for Data Association Problem in Multitarget Tracking
Online Contents | 2004
|Data Association in Multitarget Tracking with Multisensor
British Library Conference Proceedings | 1997
|