Image Shrinking and Expanding on a Pyramid
Document Type
Article
Publication Date
1-1-1993
Abstract
We develop two algorithms to perform the q step shrinking and expanding of an N x N binary image on a pyramid computer with an N x N base. The time complexity of both algorithms is O(√q). However, one uses O(√q) space per processor, while the per-processor space requirement of the other is O(1).
DOI
10.1109/71.250106
Montclair State University Digital Commons Citation
Jenq, John and Sahni, Sartaj, "Image Shrinking and Expanding on a Pyramid" (1993). Department of Computer Science Faculty Scholarship and Creative Works. 330.
https://digitalcommons.montclair.edu/compusci-facpubs/330
COinS