Three fast algorithms have been developed to solve the problem of data association in multitarget tracking in clutter. In the first algorithm, the problem of data association is identified as an exhaustive search problem in general. Subsequently, a mathematical model is proposed for the problem of data association in the joint probabilistic data association filter (JPDAF). Based on the model, a depth-first search (DFS) approach is developed for the fast generation of data association hypotheses and the computation of the conditional probabilities of the hypotheses in the JPDAF. When the density of targets is moderate, a second algorithm is developed to directly compute a posteriori probabilities in the JPDAF without generating the data association hypotheses. In the third algorithm, the effect of interference due to closely spaced targets is simplified. An approach to approximately compute the a posteriori probabilities in the JPDAF is developed. The computational complexity of the algorithms is analyzed in the worst case, as well as in the average case.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Multitarget tracking in clutter: fast algorithms for data association


    Contributors:
    Zhou, B. (author) / Bose, N.K. (author)


    Publication date :

    1993-04-01


    Size :

    977527 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Linear multitarget finite resolution tracking in clutter

    Mus̆icki, Darko / Taek Song, / Hae Lee, | IEEE | 2014



    Neural Solution to Multitarget Tracking in Clutter with Velocity Measurements

    Yu, W. / Mao, S. / Lin, P. et al. | British Library Conference Proceedings | 1994