23 June 1993 Subpixel distance maps and weighted distance transforms
Author Affiliations +
Abstract
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.
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ron Kimmel, Alfred M. Bruckstein, "Subpixel distance maps and weighted distance transforms", Proc. SPIE 2031, Geometric Methods in Computer Vision II, (23 June 1993); doi: 10.1117/12.146631; https://doi.org/10.1117/12.146631
PROCEEDINGS
10 PAGES


SHARE
KEYWORDS
Transform theory

Computer vision technology

Machine vision

Wave propagation

Electrical engineering

Image resolution

Image segmentation

RELATED CONTENT

Acceleration of ray-casting using 3-D distance transforms
Proceedings of SPIE (September 22 1992)
Skeletonization via distance maps and level sets
Proceedings of SPIE (January 04 1995)
Multicolor well-composed pictures
Proceedings of SPIE (January 04 1995)
Defining the digital skeleton
Proceedings of SPIE (April 09 1993)

Back to Top