Fast and exact signed Euclidean distance transformation with linear complexity

  title={Fast and exact signed Euclidean distance transformation with linear complexity},
  author={Olivier Cuisenaire and Benoit M. Macq},
  journal={1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258)},
  pages={3293-3296 vol.6}
  • O. Cuisenaire, B. Macq
  • Published 15 March 1999
  • Computer Science
  • 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258)
We propose a new signed or unsigned Euclidean distance transformation algorithm, based on the local corrections of the well-known 4SED algorithm of Danielsson (1980). Those corrections are only applied to a small neighborhood of a small subset of pixels from the image, which keeps the cost of the operation low. In contrast with all fast algorithms previously published, our algorithm produces perfect Euclidean distance maps in a time linearly proportional to the number of pixels in the image… 

Figures from this paper

Fast Euclidean morphological operators using local distance transformation by propagation

The complexity of this dilation algorithm is compared to the complexity of the commonly used approximation of circular structuring elements and found to have a similar cost, while providing better results.

2D Euclidean distance transform algorithms: A comparative survey

In this work, state-of-the-art sequential 2D EDT algorithms are reviewed and compared, in an effort to reach more solid conclusions regarding their differences in speed and their exactness.

A Linear Time Algorithm for Computing Exact Euclidean Distance Transforms of Binary Images in Arbitrary Dimensions

The algorithm, which is based on dimensionality reduction and partial Voronoi diagram construction, can be used for computing the DT for a wide class of distance functions, including the L/sub p/ and chamfer metrics.

Fast 2-D Distance Transformations

  • S. Krinidis
  • Computer Science
    IEEE Transactions on Image Processing
  • 2012
By recording the relative x- and y-coordinates of the examined image pixels, an optimal algorithm can be developed to achieve the DT of an image correctly and efficiently in constant time without any iteration.

Euclidean Distance Transform of Digital Images in Arbitrary Dimensions

A new algorithm for Euclidean distance transform is proposed in this paper. It propagates from the boundary to the inner of object layer by layer, like the inverse propagation of water wave. It can

Efficient Euclidean distance transform using perpendicular bisector segmentation

Comparison with state-of-the-art linear time Euclidean distance transform algorithms shows that PBEDT is the fastest on most cases, and also the most stable one with respect to image contents.

The case for approximate Distance Transforms

This paper reviews the major approximate distance calculation methods, establishing a case for their possible use in spatial science and suggesting future research directions.

A High Performance 3D Exact Euclidean Distance Transform Algorithm for Distributed Computing

A parallel implementation based on domain decomposition of a well-known 3D Euclidean distance transform algorithm is presented and its performance on a cluster of workstations is analyzed, showing that data compression is an essential tool for clusters with low-bandwidth networks.

Parallel Raster Scan for Euclidean Distance Transform

A new parallel algorithm is proposed for the computation of a Euclidean distance map and Voronoi diagram of a binary image that mixes CUDA multi-thread parallel image processing with a raster propagation of distance information over small fragments of the image.



Distance transformations in digital images

  • G. Borgefors
  • Computer Science
    Comput. Vis. Graph. Image Process.
  • 1986

Two Fast Euclidean Distance Transformations in Z2Based on Sufficient Propagation

  • H. Eggers
  • Computer Science
    Comput. Vis. Image Underst.
  • 1998
Two new error-free sequential Euclidean distance transformations (EDT) for binary images in Z2are introduced: sufficientd1- Propagation and sufficientd∞-propagation, which are significantly faster than other well-known signed and unsigned EDTs.

Distance transformations in arbitrary dimensions

Euclidean distance mapping

An Efficient Uniform Cost Algorithm Applied to Distance Transforms

The uniform-cost algorithm, in the constrained case, proves to be the best solution for distance transformation and is fast, the processing time is independent of the complexity of the image, and memory requirements are moderate.

Computing distance transformations in convex and non-convex domains

Neighborhoods for distance transformations using ordered propagation

Applications of the region growing Euclidean distance transform: anisotropy and skeletons

  • O. CuisenaireB. Macq
  • Computer Science
    Proceedings of International Conference on Image Processing
  • 1997
This work shows how a new region growing algorithm proposed for computing Euclidean distance maps in a time comparable to widely used chamfer distance transform can be extended to more complex tasks such as the computation of distance maps on anisotropic grids and the generation of a new type of Euclidan skeletons.

Region Growing Euclidean Distance Transforms

By propagating a vector for each pixel, we show that nearly Euclidean distance maps can be produced quickly by a region growing algorithm using hierarchical queues. Properties of the propagation