Share Email Print

Proceedings Paper

Massively parallel implementation of image processing algorithms
Author(s): Patrick J. Bonnin; Cyril Maurette; Brigitte Hoeltzener-Douarin; Edwige E. Pissaloux
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

This paper focuses on the problem of the massively parallel implementation of image processing algorithms. In previous theoretical studies the parallel software requirements to implement image processing algorithms were pointed out. A test algorithm, which is representative enough of the requirements for edge and region segmentations was chosen. Our goal here is to detail its implementation. The proposed test algorithm was implemented with the data programming model, on the connection machine CM5 in C*, which is an extension of the C programming language. The crux points of the parallel implementation are underlined. Edge point detection requires only parallel operations, and regular communications. Conversely, region extraction and edge chaining require irregular communications, therefore for a better efficiency, in both cases, the original algorithms were modified. These studies are in relation with the problem of finding tools and methods to compare and to evaluate parallel architectures. One of the two proposed algorithms is deduced of this one.

Paper Details

Date Published: 22 August 1995
PDF: 12 pages
Proc. SPIE 2564, Applications of Digital Image Processing XVIII, (22 August 1995); doi: 10.1117/12.217428
Show Author Affiliations
Patrick J. Bonnin, Univ. Paris XIII and ETCA (France)
Cyril Maurette, ETCA (France)
Brigitte Hoeltzener-Douarin, ETCA (France)
Edwige E. Pissaloux, Univ. Paris XIII and Univ. Paris XI (France)

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

© SPIE. Terms of Use
Back to Top