By Topic

Problem characterization in tracking/fusion algorithm evaluation

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
$31 $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

1 Author(s)
Chee-Yee Chong ; Booz, Allen & Hamilton Inc., MD, USA

The performance of a tracking/fusion algorithm depends very much on the complexity of the problem. This paper presents an approach for evaluating tracking/fusion algorithms that consider the difficulty of the problem. Evaluation is performed by characterizing the performance of the basic functions of prediction and association. The problem complexity is summarized by means of context metrics. Two context metrics for characterizing prediction and association difficulty are normalized target mobility and normalized target density. These metrics should be presented along with the performance metrics. The context metrics also support more efficient generation of input data for performance evaluation. Simple tests for evaluating basic tracking algorithm functions are presented

Published in:

Aerospace and Electronic Systems Magazine, IEEE  (Volume:16 ,  Issue: 7 )