.png){kind=icon}
返回
Optimal matching problem in detection and recognition performance evaluation
.png){kind=icon}
PRE
AI
DOI：10.1016/S0031-3203(01)00204-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper proposes a principle of one-to-one correspondence in performance evaluation of a general class of detection and recognition algorithms. Such a correspondence between ground-truth entities and algorithm declared entities is essential in accurately computing objective performance measures such as the detection, recognition, and false alarm rates. We mathematically define the correspondence by formulating a combinatorial optimal matching problem. In addition to evaluating detection performance. this methodology is also capable of evaluating recognition performance. Our study shows that the proposed principle for detection performance evaluation is simple. general and mathematically Sound. The derived performance evaluation technique is widely applicable, precise, consistent and efficient. (C) 2002 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.
Keyword:
performance evaluation
one-to-one correspondence
edge detection
corner detection
autoinatic target recognition
ROC curve
matching problem
assignment problem
Hungarian algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容