In tracking a single target in clutter, many algorithms have been developed ranging in complexity from nearest neighbor (NN) and probabilistic data association (PDA) to the optimal Bayesian filter. In multiple-target tracking, a number of the techniques have been exercised such as the JPDA and the multiple hypothesis (MHT) schemes. Sub-optimal algorithms, such as the PDA filter, have been used widely since the optimal algorithms have an exponentially increasing computational complexity since all the possible sequences of target-to-measurement associations must be considered. In this paper, the Viterbi algorithm (VA) is used to develop a parallel search data association algorithm, called the Viterbi Data Association (VDA) technique. This algorithm includes the gating, automatic track initiation and termination modules. Simulations have been carried out to verify the performance and the robustness of the proposed algorithms Moreover, the VDA algorithm is compared with the fuzzy data association (FDA) algorithm when tracking a target in a cluttered, low signal-to-noise ratio (SNR) environment.
A comparison of data association techniques for target tracking in clutter
2002-01-01
442552 byte
Conference paper
Electronic Resource
English
A Comparison of Data Association Techniques for Target Tracking in Clutter
British Library Conference Proceedings | 2002
|CORRESPONDENCE - Gating Techniques for Maneuvering Target Tracking in Clutter
Online Contents | 2002
|Distributed (nonlinear) target tracking in clutter
IEEE | 2015
|