抄録
An efficient algorithm for binary template matching is proposed. For efficient search, object images to be checked is 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 interval estimation is formalized based on the number of white and black pixels in a template and the object image. By use of these interval estimations, a scanning-type upper limit estimation of correlation coefficients can be formalized for the efficient search algorithm. Experiments show the effectiveness and efficiency of the proposed search algorithm.
