Issue No. 11 - November (1993 vol. 4)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.250106
<p>Develops two algorithms to perform the q step shrinking and expanding of an N*N binary image on a pyramid computer with an N*N base. The time complexity of both algorithms is O( square root q). However, one uses O( square root q) space per processor, while the per-processor space requirement of the other is O(1).</p>
Index Termsshrinking; expanding; binary image; pyramid computer; time complexity; spacecomplexity; computational complexity; image processing; multiprocessor interconnectionnetworks; parallel algorithms
S. Sahni and J. Jenq, "Image Shrinking and Expanding on a Pyramid," in IEEE Transactions on Parallel & Distributed Systems, vol. 4, no. , pp. 1291-1296, 1993.