Image Shrinking and Expanding on a Pyramid

Jing Fu Jenq, Sartaj Sahni

Research output: Contribution to journalArticle

25 Scopus citations


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).

Original languageEnglish
Pages (from-to)1291-1296
Number of pages6
JournalIEEE Transactions on Parallel and Distributed Systems
Issue number11
Publication statusPublished - Nov 1993


Cite this