Approximation algorithms for data association problem arising from multitarget tracking

Naoyuki Kamiyama, Tomomi Matsui

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationTheory of Computing 2011 - Proceedings of the 17th Computing
Subtitle of host publicationThe Australasian Theory Symposium, CATS 2011
Pages137-143
Number of pages7
Publication statusPublished - Dec 1 2011
Externally publishedYes
EventTheory of Computing 2011 - 17th Computing: The Australasian Theory Symposium, CATS 2011 - Perth, WA, Australia
Duration: Jan 17 2011Jan 20 2011

Publication series

NameConferences in Research and Practice in Information Technology Series
Volume119
ISSN (Print)1445-1336

Other

OtherTheory of Computing 2011 - 17th Computing: The Australasian Theory Symposium, CATS 2011
CountryAustralia
CityPerth, WA
Period1/17/111/20/11

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Computer Science Applications
  • Hardware and Architecture
  • Information Systems
  • Software

Fingerprint Dive into the research topics of 'Approximation algorithms for data association problem arising from multitarget tracking'. Together they form a unique fingerprint.

  • Cite this

    Kamiyama, N., & Matsui, T. (2011). Approximation algorithms for data association problem arising from multitarget tracking. In Theory of Computing 2011 - Proceedings of the 17th Computing: The Australasian Theory Symposium, CATS 2011 (pp. 137-143). (Conferences in Research and Practice in Information Technology Series; Vol. 119).