.png){kind=icon}
Return
Problem characterization in tracking/fusion algorithm evaluation
.png){kind=icon}
PRE
AI
DOI：10.1109/62.935460.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.8
Papers:
2.1K
Citations:
2.5K
Organization
No organization information available
Cited Papers
No cited papers available