Comparison of robustized assignment algorithms

Ivan Kadar; Eitan R. Eadan; Richard R. Gassner

doi:10.1117/12.280802

28 July 1997 Comparison of robustized assignment algorithms

Ivan Kadar, Eitan R. Eadan, Richard R. Gassner

Proceedings Volume 3068, Signal Processing, Sensor Fusion, and Target Recognition VI; (1997) https://doi.org/10.1117/12.280802
Event: AeroSense '97, 1997, Orlando, FL, United States

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.

Citation Download Citation

Ivan Kadar, Eitan R. Eadan, and Richard R. Gassner "Comparison of robustized assignment algorithms", Proc. SPIE 3068, Signal Processing, Sensor Fusion, and Target Recognition VI, (28 July 1997); https://doi.org/10.1117/12.280802

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available