.png){kind=icon}
返回
Fast template matching with polynomials
.png){kind=icon}
PRE
AI
DOI：10.1109/TIP.2007.901243.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Template matching is widely used for many applications in image and signal processing. This paper proposes a novel template matching algorithm, called algebraic template matching. Given a template and an input image, algebraic template matching efficiently calculates similarities between the template and the partial images of the input image, for various widths and heights. The partial image most similar to the template image is detected from the input image for any location, width, and height. In the proposed algorithm, a polynomial that approximates the template image is used to match the input image instead of the template image. The proposed algorithm is effective especially when the width and height of the template image differ from the partial image to be matched. An algorithm using the Legendre polynomial is proposed for efficient approximation of the template image. This algorithm not only reduces computational costs, but also improves the quality of the approximated image. It is shown theoretically and experimentally that the computational cost of the proposed algorithm is much smaller than the existing methods.
Keyword:
algebraic template matching
image processing
object detection
polynomial
template matching
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.7
论文数:
1.0W
被引数:
8.4W
机构
暂无机构信息
引用论文
MicroRNA-100 promotes the autophagy of hepatocellular carcinoma cells by inhibiting the expression of mTOR and IGF-1R.png)
Oncotarget
OAAI
OncotargetIF0
OAAI分享收藏A fast globally optimal algorithm for template matching using low-resolution pruning一种基于低分辨率剪枝的快速全局最优模板匹配算法
PREAI
分享收藏Focused color intersection with efficient searching for object extractionPATTERN RECOGNITIONOAAI
PATTERN RECOGNITIONIF7.6
OAAI分享收藏
查看更多内容