By Topic

Cross Entropy Algorithms for Data Association in Multi-Target Tracking

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Daniel Sigalov ; Technion–Israel Institute of Technology ; Nahum Shimkin

Multiple-target tracking (MTT) poses difficult computational challenges related to the measurement-to-track data association problem, especially in the presence of spurious and missing measurements. Different approaches have been proposed to tackle this problem, including various approximations and heuristic optimization tools. The cross entropy (CE) method and the related parametric MinxEnt (PME) method are recent optimization heuristics that have proved useful in many combinatorial optimization problems. They are akin to evolutionary algorithms in that a population of solutions is evolved, however generation of new solutions is based on statistical methods of sampling and parameter estimation. In this work we apply the CE method and its recent MinxEnt variant to the multi-scan version of the data association problem in the presence of misdetections, false alarms, and unknown number of targets. We formulate the algorithms, explore via simulation their efficiency and performance compared with other recently proposed techniques, and show that they obtain state-of-the-art performance in challenging scenarios.

Published in:

IEEE Transactions on Aerospace and Electronic Systems  (Volume:47 ,  Issue: 2 )