5 July 1995 New class of Lagrangian-relaxation-based algorithms for fast data association in multiple hypothesis tracking applications
Author Affiliations +
Abstract
Large classes of data association problems in multiple hypothesis tracking applications, including sensorfusion, can be formulated as multidimensional assignment problems. Lagrangian relaxation methods have beenshown to solve these problems to the noise level in the problem in real-time, especially for dense scenarios andfor multiple scans of data from multiple sensors. This work presents a new class of algorithms that circumventthe difficulties of similar previous algorithms. The computational complexity of the new algorithms is shownvia some numerical examples to be linear in the number of arcs.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Aubrey B. Poore, Aubrey B. Poore, Alexander J. Robertson, Alexander J. Robertson, Peter J. Shea, Peter J. Shea, } "New class of Lagrangian-relaxation-based algorithms for fast data association in multiple hypothesis tracking applications", Proc. SPIE 2484, Signal Processing, Sensor Fusion, and Target Recognition IV, (5 July 1995); doi: 10.1117/12.213069; https://doi.org/10.1117/12.213069
PROCEEDINGS
11 PAGES


SHARE
Back to Top