An Improved Version of a Multiple Target Tracking Algorithm
Ljudmil Bojilov · Information & Security An International Journal · 2002
NEWNAM 6 and with the more recent work of MILLER, STONE and COX. 7 In the last of these works, following the Murty‘s method the authors implement three optimizations, producing a speedup by factor of over 20. On the other hand, the measurements-to-target association as part of a frame of MHT approach can be successfully formulated as a classical assignment problem. So, using an algorithm capable to find exact first K-best solutions of the so formulated assignment problem gives us K hypotheses of highest probability without first generating all feasible hypotheses and then pruning them. 3