Quadtree algorithms for template matching on mesh connected computer

The authors present two parallel algorithms to perform template matching of an N /spl times/ N image with an M /spl times/ M template on an SIMD mesh connected computer with N /spl times/ N 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 /spl alpha//sub 1/N + /spl beta//sub 1/M/sup 2/, and /spl beta//sub 2/M/sup 2/, where /spl alpha//sub 1/, /spl beta//sub 1/, and /spl beta//sub 2/ are constants.