Approximation algorithms for data association problem arising from multitarget tracking

Authors:
Naoyuki Kamiyama;Tomomi Matsui
Affiliations:
Chuo University, Kasuga, Bunkyo-ku, Tokyo, Japan;Chuo University, Kasuga, Bunkyo-ku, Tokyo, Japan
Venue:
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Year:
2011

Citing 5
Cited 0

Approximation algorithms for multi-dimensional assignment problems with decomposable costs

Discrete Applied Mathematics - Special volume: viewpoints on optimization
Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking

Computational Optimization and Applications
An LP-based algorithm for the data association problem in multitarget tracking

Computers and Operations Research
An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors

Discrete Applied Mathematics
Some assignment problems arising from multiple target tracking

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.