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. |
| Cite as: Kamiyama, N. and Matsui, T. (2011). Approximation Algorithms for Data Association Problem Arising from Multitarget Tracking. In Proc. Computing: The Australasian Theory Symposium (CATS 2011) Perth, Australia. CRPIT, 119. Alex Potanin and Taso Viglas Eds., ACS. 137-144 |
 (from crpit.com)
(local if available)
|