The Community for Technology Leaders
Green Image
Issue No. 11 - November (1993 vol. 4)
ISSN: 1045-9219
pp: 1291-1296
<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, J.F. Jenq, "Image Shrinking and Expanding on a Pyramid", IEEE Transactions on Parallel & Distributed Systems, vol. 4, no. , pp. 1291-1296, November 1993, doi:10.1109/71.250106
103 ms
(Ver 3.1 (10032016))