21 September 1994 Image partitioning on a hypercube machine
Author Affiliations +
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.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
John M. DeCatrel, John M. DeCatrel, } "Image partitioning on a hypercube machine", Proc. SPIE 2298, Applications of Digital Image Processing XVII, (21 September 1994); doi: 10.1117/12.186575; https://doi.org/10.1117/12.186575
PROCEEDINGS
7 PAGES


SHARE
Back to Top