Subpixel distance maps and weighted distance transforms

An algorithm for computing the Euclidean distance from the boundary of a given digitized shape is presented. The distance is calculated with sub-pixel accuracy. The algorithm is based on an equal distance contour evolution process. The moving contour is embedded as a level set in a time varying function of higher dimension. This representation of the evolving contour makes possible the use of an accurate and stable numerical scheme, due to Osher and Sethian.

[1]  Alfred M. Bruckstein,et al.  A new method for image segmentation , 1988, [1988 Proceedings] 9th International Conference on Pattern Recognition.

[2]  Alex Pentland,et al.  A simple algorithm for shape from shading , 1992, Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.