Recently, it has become clear that determining a ranked set of assignments allows computation of very good approximations to the data association problem. Several algorithms have been proposed but only two return the k-best assignments in reasonable time. One is Danchick and Newnams' [1993] algorithm, which is based on the recognition that determining the best assignment is a classical assignment problem and that determining a ranked set of assignments may be accomplished by solving a series of modified copies of the initial assignment problem. The other algorithm is originally due to Murty [1968] and was most recently described within the context of multitarget tracking. We evaluate the two algorithm using randomly generated data and data obtained from an electrooptical sensor simulation in which 90 missiles are launched. These evaluations show that Murty's algorithm perform significantly better in all scenarios. We show the relationship between the two algorithms and how Danchick and Newnam's algorithm can be very easily modified to Murty's algorithm. Experimental results using Murty's algorithm suggest that a solution to the real-time data association problem is now feasible.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A comparison of two algorithms for determining ranked assignments with application to multitarget tracking and motion correspondence


    Contributors:
    Cox, I.J. (author) / Miller, M.L. (author) / Danchick, R. (author) / Newnam, G.E. (author)


    Publication date :

    1997-01-01


    Size :

    1497520 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English