.png){kind=icon}
返回
GAD: A Global-Aware Diversity-Based Template Matching Method
.png){kind=icon}
PRE
AI
DOI：10.1109/TIM.2021.3134326.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A novel similarity measurement metric, global-aware diversity (GAD), between a template and an image is proposed in this article, which can be efficiently utilized in a template matching method. Unlike the existing nearest neighbor field (NNF)-based methods, which use either the local or global diversity alone, GAD utilizes the global context to guide the local diversity. We verify that the global context is important for template matching task and can largely remove the background and outliers. The state-of-the-art NNF-based methods in general are not efficient enough as resolution grows. Thus, we also elaborately design a very efficient algorithm of GAD to reduce the complexity from . First, the GAD algorithm has been evaluated on two challenging benchmark datasets best-buddies similarity (BBS) and TinyTLP. Experiments show that the GAD algorithm achieves the state-of-the-art performance. As GAD does not impose any prior on unseen data, it is more insensitive to large rotation or deformation than the deformation-based algorithms. Besides, the GAD algorithm can run at 150 ms on average with high accuracy on the dataset of resolution 1280 x 780.
Keyword:
Data structures
Boolean functions
Measurement
Strain
Clutter
Robustness
Lighting
Bounded joint localization
global aware
nearest neighbor field (NNF)
object detection
template matching
期刊
IF:
5.9
论文数:
2.0W
被引数:
5.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容