Subpixel distance maps and weighted distance transforms

Ron Kimmel; Alfred M. Bruckstein

doi:10.1117/12.146631

23 June 1993 Subpixel distance maps and weighted distance transforms

Ron Kimmel, Alfred M. Bruckstein

Proceedings Volume 2031, Geometric Methods in Computer Vision II; (1993) https://doi.org/10.1117/12.146631
Event: SPIE's 1993 International Symposium on Optics, Imaging, and Instrumentation, 1993, San Diego, CA, United States

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.

Citation Download Citation

Ron Kimmel and Alfred M. Bruckstein "Subpixel distance maps and weighted distance transforms", Proc. SPIE 2031, Geometric Methods in Computer Vision II, (23 June 1993); https://doi.org/10.1117/12.146631

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available