Image template matching on hypercube SIMD computers
type: Item
instance of: scholarly article
title: Image template matching on hypercube SIMD computers
zbMATH Open document ID: 0727.68137
DOI: 10.1016/0165-1684(90)90026-U
author: J. I. Benavides
author: O. Plata
author: E. L. Zapata
author: Francisco F. Rivera
author: J. M. Carazo
published in: Signal Processing
publication date: 1990-01-01T00:00:00Z
review text: We present a parallel algorithm to perform an image template matching (PITM) on SIMD hypercube computers with non-shared local memory. This parallel algorithm is general in the sense that it allows for arbitrary dimensions for the image, the template and the hypercube. The flexibility of the PITM algorithm is rooted in the partition of the dimensions of the hypercube into four subsets, each one associated with one independent loop of the sequential algorithm (template matching in the domain of the time), and in the way the data are distributed in the local memories of the processing elements (consecutive storage for the template and for the matrix of cross-correlation coefficients, and shifted-consecutive for the image). Both the algorithmic complexity and the data redundancy are analyzed.
Mathematics Subject Classification ID: 68U10
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 4201711
zbMATH Keywords: image processing
zbMATH Keywords: parallel algorithm
zbMATH Keywords: image template matching
zbMATH Keywords: hypercube computers
MaRDI profile type: Publication
full work available at URL: 0165-1684(90)90026-u
OpenAlex ID: W1976350072
Recommended article: Efficient parallel algorithms for image template matching on hypercube SIMD machines
Recommended article: Optimal speed-up algorithms for template matching on SIMD hypercube multiprocessors with restricted local memory
Recommended article: Fast computation of variant templates for parallel image processing
Recommended article: Q4785982
Recommended article: Q3999600
description: scientific article; zbMATH DE number 4201711