Parallel Algorithms for the Distance Transformation
Abstract
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.
Cite
Text
Embrechts and Roose. "Parallel Algorithms for the Distance Transformation." European Conference on Computer Vision, 1992. doi:10.1007/3-540-55426-2_44Markdown
[Embrechts and Roose. "Parallel Algorithms for the Distance Transformation." European Conference on Computer Vision, 1992.](https://mlanthology.org/eccv/1992/embrechts1992eccv-parallel/) doi:10.1007/3-540-55426-2_44BibTeX
@inproceedings{embrechts1992eccv-parallel,
title = {{Parallel Algorithms for the Distance Transformation}},
author = {Embrechts, Hugo and Roose, Dirk},
booktitle = {European Conference on Computer Vision},
year = {1992},
pages = {387-391},
doi = {10.1007/3-540-55426-2_44},
url = {https://mlanthology.org/eccv/1992/embrechts1992eccv-parallel/}
}