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

Marketing Automation Platform Marketing Automation Tool