By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Storms, P. ; Dept. of Syst. Archit. & Design, Hollandse Signaalapparatem B.V., Hengelo, Netherlands ; Spieksma, F.

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.

Published in:

Information Fusion, 2000. FUSION 2000. Proceedings of the Third International Conference on  (Volume:1 )

Date of Conference:

10-13 July 2000