Share Email Print
cover

Proceedings Paper

Efficient template matching algorithm based on interval estimations on correlation
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

We propose an efficient template matching algorithm for binary image search. When we use template matching techniques, the computation cost depends on size of images. If we have large size images, we spend a lot of time for searching similar objects in scene image to template image. We design a scanning-type upper limit estimation that can be useful for neglect correlation calculation. For calculating the scanning-type upper limits, template and scene images are divided into two regions: R-region and P-region. In R-region, an upper limit of correlation coefficients can be derived as an interval estimation based on mathematical analysis of correlations of the object image and a pivot image. In P-region, another upper limit is formalized based on the number of white and black pixels in a template and the object image. By use of these upper limits, the scanning-type upper limit estimation of correlation coefficients can be formalized for the efficient matching algorithm. This upper limits estimation isn't over true values of correlation, so the accuracy of search by conventional search is the same as one by conventional search. The experiments with document images show the effectiveness and efficiency of the proposed matching algorithm. In these experiments, computation time by the proposed algorithm is between 5 and 20% compare of the conventional search.

Paper Details

Date Published: 6 December 2005
PDF: 10 pages
Proc. SPIE 6051, Optomechatronic Machine Vision, 605102 (6 December 2005); doi: 10.1117/12.645623
Show Author Affiliations
Takahiro Mae, Hokkaido Univ. (Japan)
Shun'ichi Kaneko, Hokkaido Univ. (Japan)
Takayuki Tanaka, Hokkaido Univ. (Japan)


Published in SPIE Proceedings Vol. 6051:
Optomechatronic Machine Vision
Kazuhiko Sumi, Editor(s)

© SPIE. Terms of Use
Back to Top