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

DOI10.1016/S0305-0548(02)00057-6MaRDI QIDQ1423449zbMATH OpenFDO

Authors P. P. A. Storms, Frits C. R. Spieksma

Publication date 14 February 2004

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0305-0548(02)00057-6

zbMATH Keywords

Data associationLinear programmingMultitarget tracking

Mathematics Subject Classification ID

Search theory (90B40) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• scientific article; zbMATH DE number 679871
• Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking
• scientific article; zbMATH DE number 736969
• A new relaxation algorithm and passive sensor data association
• A Lagrangian Relaxation Algorithm for Multidimensional Assignment Problems Arising from Multitarget Tracking

Cites work

• A binary-rounding heuristic for multi-period variable-task-duration assignment problems
• A general class of greedily solvable linear programs
• A Lagrangian Relaxation Algorithm for Multidimensional Assignment Problems Arising from Multitarget Tracking
• Application of 0-1 integer programming to multitarget tracking problems
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 193499 (Why is no real title available?)
• scientific article; zbMATH DE number 800362 (Why is no real title available?)
• Letter to the Editor—The Multidimensional Assignment Problem
• Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking

Cited in

(12)

• An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors
• Efficient sensor network management for asset localization
• Solving the multidimensional assignment problem by a cross-entropy method
• Multi-index transport problems with decomposition structure
• Data association approaches in bearings-only multi-target tracking
• Polyhedral combinatorics of multi-index axial transportation problems
• Branch and bound solution of the multidimensional assignment problem formulation of data association
• Study on the Hungarian algorithm for the maximum likelihood data association problem
• Multiindex transportation problems with 2-embedded structure
• Dynamic discrete tomography
• Multi-index transportation problems with 1-nested structure
• A ``soft assignment algorithm for multiple target tracking.

This page was built for publication: An LP-based algorithm for the data association problem in multitarget tracking.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1423449)