.png){kind=icon}
返回
Problem characterization in tracking/fusion algorithm evaluation
.png){kind=icon}
PRE
AI
DOI：10.1109/62.935460.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
