@inproceedings{e9259772d771448b9783f8c417a773f8,
title = "Reconfigurable mesh algorithms for image shrinking, expanding, clustering, and template matching",
abstract = "Parallel reconfigurable mesh algorithms are developed for the following image processing problems: shrinking, expanding, clustering, and template matching. Our N×N reconfigurable mesh algorithm for the q-step shrinking and expansion of a binary image takes 0 (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, our algorithms run in O (M2) time when N2 processors ate available and in O (M) time when N2M2 processors are available.",
keywords = "Clustering, Expanding, Image processing, Parallel algorithms, Reconfigurable mesh computer, Shrinking, Template matching",
author = "John Jenq and Sartaj Sahni",
year = "1991",
month = jan,
day = "1",
doi = "10.1109/IPPS.1991.153780",
language = "English",
series = "Proceedings - 5th International Parallel Processing Symposium, IPPS 1991",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "208--215",
booktitle = "Proceedings - 5th International Parallel Processing Symposium, IPPS 1991",
note = "null ; Conference date: 30-04-1991 Through 02-05-1991",
}