Parallel algorithms for the distance transformation
The distance transformation (DT) is a basic operation in image analysis where it is used for object recognition. A DT converts a binary image consisting of foreground pixels and background pixels, into an image where all background pixels have a value equal to the distance to the nearest foreground pixel.
We present several approaches for the parallel calculation of the distance transform based on the “divide-and-conquer” principle. The algorithms and their performance on an iPSC®/2 are discussed for the city block (CB) distance that is an approximation for the Euclidean Distance.
KeywordsParallel Algorithm Sequential Algorithm Background Pixel Foreground Pixel Directional Algorithm
Unable to display preview. Download preview PDF.
- 1.Borgefors, G.: Distance transformations in arbitrary dimensions. Computer Vision, Graphics and Image Processing 27(3) (1984) 321–345Google Scholar
- 2.Borgefors, G.: Distance transformations in digital images. Computer Vision, Graphics and Image Processing 34(3) (1986) 344–371Google Scholar
- 3.Embrechts, H., Roose, D.: Parallel algorithms for the distance transformation. Technical Report TW151 (1991) Katholieke Universiteit LeuvenGoogle Scholar
- 4.Embrechts, H., Roose, D., Wambacq, P.: Component labelling on an mimd multiprocessor. Computer Vision, Graphics and Image Processing: Image Understanding, to appearGoogle Scholar