Image Shrinking and Expanding on a Pyramid

Jing Fu Jenq; Sartaj Sahni

doi:10.1109/71.250106

Image Shrinking and Expanding on a Pyramid

Jing Fu Jenq, Sartaj Sahni

Computer Science

Research output: Contribution to journal › Article › peer-review

26 Scopus citations

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 language	English
Pages (from-to)	1291-1296
Number of pages	6
Journal	IEEE Transactions on Parallel and Distributed Systems
Volume	4
Issue number	11
DOIs	https://doi.org/10.1109/71.250106
State	Published - Nov 1993

Access to Document

10.1109/71.250106

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 = "Jenq, {Jing Fu} and Sartaj Sahni",

year = "1993",

month = nov,

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",

}

TY - JOUR

T1 - Image Shrinking and Expanding on a Pyramid

AU - Jenq, Jing Fu

AU - Sahni, Sartaj

PY - 1993/11

Y1 - 1993/11

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

SN - 1045-9219

VL - 4

SP - 1291

EP - 1296

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

IS - 11

ER -

Image Shrinking and Expanding on a Pyramid

Abstract

Access to Document

Other files and links

Fingerprint

Cite this