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 language | English |
---|---|
Title of host publication | Proceedings of the 3rd International Conference on Information Fusion, FUSION 2000 |
Place of Publication | Piscataway |
Publisher | Institute of Electrical and Electronics Engineers |
Pages | 10-16 |
Number of pages | 7 |
ISBN (Print) | 2-7257-0000-0 |
DOIs | |
Publication status | Published - 2000 |
Externally published | Yes |
Event | 3rd International Conference on Information Fusion (FUSION 2000) - Paris, France Duration: 10 Jul 2000 → 13 Jul 2000 Conference number: 3 http://usion.isif.org/proceedings/fusion00CD/index.html |
Conference
Conference | 3rd International Conference on Information Fusion (FUSION 2000) |
---|---|
Abbreviated title | FUSION 2000 |
Country/Territory | France |
City | Paris |
Period | 10/07/00 → 13/07/00 |
Internet address |
Keywords
- data association
- linear programming
- Tracking