Image partitioning on a hypercube machine

John M. DeCatrel

doi:10.1117/12.186575

21 September 1994 Image partitioning on a hypercube machine

John M. DeCatrel

Proceedings Volume 2298, Applications of Digital Image Processing XVII; (1994) https://doi.org/10.1117/12.186575
Event: SPIE's 1994 International Symposium on Optics, Imaging, and Instrumentation, 1994, San Diego, CA, United States

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.

Citation Download Citation

John M. DeCatrel "Image partitioning on a hypercube machine", Proc. SPIE 2298, Applications of Digital Image Processing XVII, (21 September 1994); https://doi.org/10.1117/12.186575

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available