Title

Image Shrinking and Expanding on a Pyramid

Document Type

Article

Publication Date

1-1-1993

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

DOI

10.1109/71.250106

This document is currently not available here.

Share

COinS