1 April 2001 Efficient primitive binary morphological algorithms on a massively parallel processor
Author Affiliations +
J. of Electronic Imaging, 10(2), (2001). doi:10.1117/1.1344185
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 algorithms for the binary dilation and erosion are presented and evaluated for an advanced associative processor. Simulation results show that the proposed algorithms for this advanced architecture reach a near optimal speedup compared to the serial algorithm. Additionally, it is proven that the implementation of this image processor is economically feasible.
Andreas I. Svolos, Charalampos Konstantopoulos, Christos Kaklamanis, "Efficient primitive binary morphological algorithms on a massively parallel processor," Journal of Electronic Imaging 10(2), (1 April 2001). http://dx.doi.org/10.1117/1.1344185
JOURNAL ARTICLE
9 PAGES


SHARE
KEYWORDS
Image processing

Binary data

Computer simulations

Parallel computing

Array processing

Image analysis

Image segmentation

Back to Top