使用低分辨率剪枝的快速全局最优模板匹配算法。

A fast globally optimal algorithm for template matching using low-resolution pruning.

机构信息

Department of Electrical Engineering, Tarbiat Modarres University, Tehran, Iran.

出版信息

IEEE Trans Image Process. 2001;10(4):526-33. doi: 10.1109/83.913587.

Abstract

Template matching has many applications in signal processing, image processing, pattern recognition, and video compression. This paper proposes a fast coarse-to-fine template matching algorithm for finding the exact best match, i.e., the match that may be found by a full search. This is obtained by pruning the number of candidates in the full search using the results of a coarse search. Experimental results show that speed ups of a couple of orders of magnitude can easily be achieved using this method for typical low-noise cases of two-dimensional (2-D) template matching.

摘要

模板匹配在信号处理、图像处理、模式识别和视频压缩等领域有广泛的应用。本文提出了一种快速的粗到精模板匹配算法，用于找到精确的最佳匹配，即通过完全搜索可以找到的匹配。这是通过使用粗搜索的结果来修剪完全搜索中的候选者数量来实现的。实验结果表明，对于二维（2-D）模板匹配的典型低噪声情况，使用这种方法可以轻松实现几个数量级的加速。