An LP-based algorithm for the data association problem in multitarget tracking

P.P.A. Storms, F.C.R. Spieksma

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

22 Citations (Scopus)

Abstract

In this paper we present a linear programming (LP) based approach for solving the data association problem (DAP) in multiple target tracking. It is well-known that the DAP can be formulated as an integer program. We present a compact formulation of the DAP. To solve practical instances of the DAP we propose an algorithm that uses an iterated K-scan sliding window technique. In each iteration we solve the linear programming relaxation of an integer program and next apply a greedy rounding procedure. Computational experiments indicate that the quality of the solutions found is quite satisfactory.

Original languageEnglish
Title of host publicationProceedings of the 3rd International Conference on Information Fusion, FUSION 2000
Place of PublicationPiscataway
PublisherInstitute of Electrical and Electronics Engineers
Pages10-16
Number of pages7
ISBN (Print)2-7257-0000-0
DOIs
Publication statusPublished - 2000
Externally publishedYes
Event3rd International Conference on Information Fusion (FUSION 2000) - Paris, France
Duration: 10 Jul 200013 Jul 2000
Conference number: 3
http://usion.isif.org/proceedings/fusion00CD/index.html

Conference

Conference3rd International Conference on Information Fusion (FUSION 2000)
Abbreviated titleFUSION 2000
Country/TerritoryFrance
CityParis
Period10/07/0013/07/00
Internet address

Keywords

  • data association
  • linear programming
  • Tracking

Fingerprint

Dive into the research topics of 'An LP-based algorithm for the data association problem in multitarget tracking'. Together they form a unique fingerprint.

Cite this