Fast Euclidean Distance Transformation by Propagation Using Multiple Neighborhoods

Abstract

We propose a new exact Euclidean distance transformation (DT) by propagation, using bucket sorting. A fast but approximate DT is first computed using a coarse neighborhood. A sequence of larger neighborhoods is then used to gradually improve this approximation. Computations are kept short by restricting the use of these large neighborhoods to the tile… (More)
DOI: 10.1006/cviu.1999.0783

Topics

13 Figures and Tables

Cite this paper

@article{Cuisenaire1999FastED, title={Fast Euclidean Distance Transformation by Propagation Using Multiple Neighborhoods}, author={Olivier Cuisenaire and Benoit M. Macq}, journal={Computer Vision and Image Understanding}, year={1999}, volume={76}, pages={163-172} }