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
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

Fingerprint

Approximation algorithms
Polynomials

All Science Journal Classification (ASJC) codes

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

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).

Approximation algorithms for data association problem arising from multitarget tracking. / Kamiyama, Naoyuki; Matsui, Tomomi.

Theory of Computing 2011 - Proceedings of the 17th Computing: The Australasian Theory Symposium, CATS 2011. 2011. p. 137-143 (Conferences in Research and Practice in Information Technology Series; Vol. 119).

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

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. Conferences in Research and Practice in Information Technology Series, vol. 119, pp. 137-143, Theory of Computing 2011 - 17th Computing: The Australasian Theory Symposium, CATS 2011, Perth, WA, Australia, 1/17/11.
Kamiyama N, Matsui T. 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. 2011. p. 137-143. (Conferences in Research and Practice in Information Technology Series).
Kamiyama, Naoyuki ; Matsui, Tomomi. / Approximation algorithms for data association problem arising from multitarget tracking. Theory of Computing 2011 - Proceedings of the 17th Computing: The Australasian Theory Symposium, CATS 2011. 2011. pp. 137-143 (Conferences in Research and Practice in Information Technology Series).
@inproceedings{2e7293d0dab44bc5b60aa90b50d10293,
title = "Approximation algorithms for data association problem arising from multitarget tracking",
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.",
author = "Naoyuki Kamiyama and Tomomi Matsui",
year = "2011",
month = "12",
day = "1",
language = "English",
isbn = "9781920682989",
series = "Conferences in Research and Practice in Information Technology Series",
pages = "137--143",
booktitle = "Theory of Computing 2011 - Proceedings of the 17th Computing",

}

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

ER -