Share Email Print

Proceedings Paper

Image partitioning on a hypercube machine
Author(s): John M. DeCatrel
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Some performance measures for partitioning images among hypercube connected processors are presented. The paramount effect of row-major ordering of image bytes is explicitly taken into account. Subimages are split at row boundaries first and downloaded over a spanning binomial tree. Subimage nearest neighbors are mapped to processor neighbors. A theorem which indicates that subimage locality is preserved is given. Practical constraints of a real machine (nCUBE 2) are incorporated. Performance comparisons between this and related image communication techniques are presented.

Paper Details

Date Published: 21 September 1994
PDF: 7 pages
Proc. SPIE 2298, Applications of Digital Image Processing XVII, (21 September 1994); doi: 10.1117/12.186575
Show Author Affiliations
John M. DeCatrel, Florida State Univ. (United States)

Published in SPIE Proceedings Vol. 2298:
Applications of Digital Image Processing XVII
Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top