An improved data assignment solution for ML-based relaxation approach for multitarget tracking problem

It is proved that the optimal solution for the matching problem in multi-target tracking can be found from among n different matching. We show in this paper by simulation that the costs of the n different possible solutions constitute a bimodal sequence, which suggests an algorithm of O(N logN) complexity, lower than most of known algorithms.