Parallel and Distributed Processing Symposium, International (2000)

Cancun, Mexico

May 1, 2000 to May 5, 2000

ISSN: 1530-2075

ISBN: 0-7695-0574-0

pp: 281

Andreas I. Svolos , University of Patras

Charalampos G. Konstantopoulos , University of Patras

Christos Kaklamanis , University of Patras

ABSTRACT

One of the most important features in image analysis and understanding is shape. Mathematical morphology is the image-processing branch that deals with shape analysis. The definition of all morphological transformations is based on two primitive operations, i.e. dilation and erosion. Since many applications require the solution of morphological problems in real time, researching time efficient algorithms for these two operations is crucial. In this paper, efficient parallel algorithms for the binary dilation and erosion are presented and evaluated for an advanced associative processor. Simulation results indicate that the achieved speedup is linear.

INDEX TERMS

mathematical morphology, dilation, erosion, massively parallel processor, associative processor, hypercube

CITATION

A. I. Svolos, C. G. Konstantopoulos and C. Kaklamanis, "Efficient Binary Morphological Algorithms on a Massively Parallel Processor,"

*Parallel and Distributed Processing Symposium, International(IPDPS)*, Cancun, Mexico, 2000, pp. 281.

doi:10.1109/IPDPS.2000.845997

CITATIONS

SEARCH