TY - GEN
T1 - Approximation algorithms for data association problem arising from multitarget tracking
AU - Kamiyama, Naoyuki
AU - Matsui, Tomomi
PY - 2011/12/1
Y1 - 2011/12/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84864581043&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84864581043&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84864581043
SN - 9781920682989
T3 - Conferences in Research and Practice in Information Technology Series
SP - 137
EP - 143
BT - Theory of Computing 2011 - Proceedings of the 17th Computing
T2 - Theory of Computing 2011 - 17th Computing: The Australasian Theory Symposium, CATS 2011
Y2 - 17 January 2011 through 20 January 2011
ER -