Share Email Print

Proceedings Paper

Neighborhood Access Problem In Image Parallel Machines
Author(s): Per-Erik Danielsson
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

Image parallelism implies a SIMD-architecture where a two-dimensional array of processors and memory modules are controlled by a central master control unit. It is emphasized that effective access of artribrarily sized neighborhoods (which is everso common in image processors) are distributed over the image plane. The access and interconnection problem for such an architecture is shown to have several possible solutions with different trade-offs. No existing design presents good solutions of the neighborhood access problem. It is shown that a proper design in this respect results in a 13-fold increase in speed compared to what has recently been reported for the MPP.

Paper Details

Date Published: 17 March 1983
PDF: 8 pages
Proc. SPIE 0359, Applications of Digital Image Processing IV, (17 March 1983); doi: 10.1117/12.965953
Show Author Affiliations
Per-Erik Danielsson, Linkoping University (Sweden)

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

© SPIE. Terms of Use
Back to Top