资 源 简 介
Implementation of the Murty algorithm to obtain the best K assignments.
Includes the implementation of the Jonker-Volgenant algorithm.
Usual applications are multiple target tracking algorithms, Joint Probabilistic Data Association (JPDA), Multiple Hypothesis Tracking (MHT), Global Nearest Neighbours (GNN), etc.
Based on the original code by Jonker-Volgenant, and the Murty Matlab implementation by Eric Trautmann (http://www.mathworks.fr/matlabcentral/fileexchange/30837-k-best-assignment-algorithm).
Can be used both from Java or Matlab.
Time for a 100x100 assignment problem, with k=20:
* Matlab implementation: 54.5 sec
* Java implementation: 1 sec
