BibTeX
@MISC{Danielsson80euclideandistance,
author = {Per-Erik Danielsson},
title = {Euclidean Distance Mapping},
year = {1980}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Based on a two-component descriptor, a distance label for each point, it is shown that Euclidean distance maps can be generated by effective sequential algorithms. The map indicates, for each pixel in the objects (or the background) of the originally binary picture, the shortest distance to the nearest pixel in the background (or the objects). A map with negligible errors can be produced in two picture scans which has to include forward and backward movement for each line. Thus, for expanding/shrinking purposes it may compete very successfully with iterative parallel propagation in the binary picture itself. It is shown that skeletons can be produced by simple procedures and since these are based on Euclidean distances it is assumed that they are superior to skeletons based on d4-, ds-, and even octagonal metrics.
