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 language | English (US) |
---|---|
Title of host publication | Proceedings - International Conference on Pattern Recognition |
Publisher | Publ by IEEE |
Pages | 362-367 |
Number of pages | 6 |
Volume | 2 |
State | Published - 1990 |
Externally published | Yes |
Event | Proceedings of the 10th International Conference on Pattern Recognition - Atlantic City, NJ, USA Duration: Jun 16 1990 → Jun 21 1990 |
Other
Other | Proceedings of the 10th International Conference on Pattern Recognition |
---|---|
City | Atlantic City, NJ, USA |
Period | 6/16/90 → 6/21/90 |
ASJC Scopus subject areas
- Computer Vision and Pattern Recognition
- Hardware and Architecture
- Electrical and Electronic Engineering