DocumentCode
988263
Title
Image shrinking and expanding on a pyramid
Author
Jenq, Jing-Fu ; Sahni, Sartaj
Author_Institution
Dept. of Phys., Math. & Comput. Sci., Tennessee State Univ., Nashville, TN, USA
Volume
4
Issue
11
fYear
1993
fDate
11/1/1993 12:00:00 AM
Firstpage
1291
Lastpage
1296
Abstract
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(√q). However, one uses O(√q) space per processor, while the per-processor space requirement of the other is O(1)
Keywords
computational complexity; image processing; multiprocessor interconnection networks; parallel algorithms; binary image; expanding; pyramid computer; shrinking; space complexity; time complexity; Computer science; Equations; Hypercubes; Mathematics; Physics; Pixel; Tree data structures;
fLanguage
English
Journal_Title
Parallel and Distributed Systems, IEEE Transactions on
Publisher
ieee
ISSN
1045-9219
Type
jour
DOI
10.1109/71.250106
Filename
250106
Link To Document