Reconfigurable mesh algorithms for image shrinking, expanding, clustering, and template matching
- 9 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 208-215
- https://doi.org/10.1109/ipps.1991.153780
Abstract
Parallel reconfigurable mesh algorithms are developed for the following image processing problems: shrinking, expanding, clustering, and template matching. The authors' N*N reconfigurable mesh algorithm for the q-step shrinking and expansion of a binary image takes O(1) time. One pass of the clustering algorithm for N patterns and K centers can be done in O(MK+KlogN), O(KlogNM), and O(M+logNMK) time using N, NM, and NMK processors, respectively. For template matching using an M*M template and an N*N image, the authors' algorithms run in O(M/sup 2/) time when N/sup 2/ processors are available and in O(M) time when N/sup 2/M/sup 2/ processors are available.Keywords
This publication has 4 references indexed in Scilit:
- Image computations on reconfigurable VLSI arraysPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Clustering on a hypercube multicomputerIEEE Transactions on Parallel and Distributed Systems, 1991
- A note on shrinking and expanding operations in pyramidsPattern Recognition Letters, 1987
- A VLSI Systolic Architecture for Pattern ClusteringPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985