Image Shrinking and Expanding on a Pyramid

John Jenq, Sartaj Sahni

Research output: Contribution to journalArticle

25 Citations (Scopus)

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

Original languageEnglish
Pages (from-to)1291-1296
Number of pages6
JournalIEEE Transactions on Parallel and Distributed Systems
Volume4
Issue number11
DOIs
StatePublished - 1 Jan 1993

Fingerprint

Binary images

Cite this

@article{36cede5127d647aa9cf9956df3ba594f,
title = "Image Shrinking and Expanding on a Pyramid",
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).",
author = "John Jenq and Sartaj Sahni",
year = "1993",
month = "1",
day = "1",
doi = "10.1109/71.250106",
language = "English",
volume = "4",
pages = "1291--1296",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "11",

}

Image Shrinking and Expanding on a Pyramid. / Jenq, John; Sahni, Sartaj.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 4, No. 11, 01.01.1993, p. 1291-1296.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Image Shrinking and Expanding on a Pyramid

AU - Jenq, John

AU - Sahni, Sartaj

PY - 1993/1/1

Y1 - 1993/1/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=0027701828&partnerID=8YFLogxK

U2 - 10.1109/71.250106

DO - 10.1109/71.250106

M3 - Article

AN - SCOPUS:0027701828

VL - 4

SP - 1291

EP - 1296

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 11

ER -