Approximation algorithms for data association problem arising from multitarget tracking
Naoyuki Kamiyama, Tomomi Matsui · Computing: The Australasian Theory Symposium · 2011
In this paper, we discuss a data association problem arising from multitarget tracking. We formulate the problem as a multi-dimensional assignment problem and propose a polynomial time 1.8-approximation algorithm for simple case. We also propose a 3.7-approximation algorithm for general cases.