17 March 1983 Neighborhood Access Problem In Image Parallel Machines
Author Affiliations +
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.
© (1983) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Per-Erik Danielsson, "Neighborhood Access Problem In Image Parallel Machines", Proc. SPIE 0359, Applications of Digital Image Processing IV, (17 March 1983); doi: 10.1117/12.965953; https://doi.org/10.1117/12.965953
PROCEEDINGS
8 PAGES


SHARE
RELATED CONTENT

The PAPIA Image Analysis System
Proceedings of SPIE (April 21 1986)
Surface reconstruction with discontinuities
Proceedings of SPIE (April 01 1991)
A High-Speed Processor for Large Imagery
Proceedings of SPIE (April 05 1989)
Image smoothing with Savitzky-Golay filters
Proceedings of SPIE (May 30 2003)
A Relaxation Based Adaptive Filtering Algorithm
Proceedings of SPIE (December 04 1984)

Back to Top