A parallel algorithm for template matching on an SIMD mesh connected computer

Chaitali Chakrabarti, Joseph F. JaJa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

An efficient parallel algorithm to compute template matching of an N × N input image with an M × M template on a single-instruction multiple-data (SIMD) mesh-connected computer with P processors is proposed. The input image is mapped into the processor array such that each processor stores N 2/P data in the cyclic mode. The template values are circulated among the processors instead of being broadcast or stored in the processor memory. There is no movement of the intermediate results. The computation and the communication time complexity of the algorithm is O(M 2N 2/P) for all P in the range M 2 ≤ P ≤ N 2.

Original languageEnglish (US)
Title of host publicationProceedings - International Conference on Pattern Recognition
PublisherPubl by IEEE
Pages362-367
Number of pages6
Volume2
StatePublished - 1990
Externally publishedYes
EventProceedings of the 10th International Conference on Pattern Recognition - Atlantic City, NJ, USA
Duration: Jun 16 1990Jun 21 1990

Other

OtherProceedings of the 10th International Conference on Pattern Recognition
CityAtlantic City, NJ, USA
Period6/16/906/21/90

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition
  • Hardware and Architecture
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A parallel algorithm for template matching on an SIMD mesh connected computer'. Together they form a unique fingerprint.

  • Cite this

    Chakrabarti, C., & JaJa, J. F. (1990). A parallel algorithm for template matching on an SIMD mesh connected computer. In Proceedings - International Conference on Pattern Recognition (Vol. 2, pp. 362-367). Publ by IEEE.