find--k-best-1.00
于 2012-06-11 发布
文件大小:27KB
0 313
下载积分: 1
下载次数: 42
代码说明：
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 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
下载说明：请别用迅雷下载，失败请重下，重下不扣分！
发表评论
