Quadtree algorithms for template matching on mesh connected computer

Abstract

We present two parallel algorithms to perforni template matching of an N x N image with an M x M template on an SIMD mesh connected computer with N xN processors. In the first algorithm, both the image and the template are represented by quadtrees, whereas in the second, the template is represented by a quadtree, and the image is represented by a matrix. The time complexities of the two algorithms are respectively upperbounded by alN+PlM2, and p z M 2 , where a l , P I , and p2 are constants.