28 July 1997 Comparison of robustized assignment algorithms
Author Affiliations +
Abstract
Several assignment methods are compared in terms of problem size, computational complexity and misassignment as a function of sparsity and gating. Specific real world applications include multi-target multi-sensor tracking/fusion and resource management with sparse cost matrices. The cost matrix computational complexity is also addressed. Both randomly generated cost matrices and measured data sets are used to test the algorithms. It is shown that, both standard and some new greedy, assignment algorithms significantly degrade in performance with fully gated columns and/or rows. However, it is shown that it is possible to modify specific algorithms to regain the lost optimality.
© (1997) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ivan Kadar, Ivan Kadar, Eitan R. Eadan, Eitan R. Eadan, Richard R. Gassner, Richard R. Gassner, } "Comparison of robustized assignment algorithms", Proc. SPIE 3068, Signal Processing, Sensor Fusion, and Target Recognition VI, (28 July 1997); doi: 10.1117/12.280802; https://doi.org/10.1117/12.280802
PROCEEDINGS
10 PAGES


SHARE
Back to Top