Fast Euclidean distance mapping using ordered propagation

Oleg G. Okun

doi:10.1117/12.316543

8 July 1998 Fast Euclidean distance mapping using ordered propagation

Oleg G. Okun

Proceedings Volume 3389, Hybrid Image and Signal Processing VI; (1998) https://doi.org/10.1117/12.316543
Event: Aerospace/Defense Sensing and Controls, 1998, Orlando, FL, United States

Abstract

A method of the Euclidean distance map generation is proposed which reduces the number of multiplication operations used to compute distances. This method belongs to a class of the ordered propagation algorithms using masks whose shape depends on a direction of the distance value propagation. To obtain Euclidean distances, we apply two non-Euclidean transforms simultaneously so that our approach is faster than other techniques because it uses only additions instead of multiplication operations when labeling the distance map. Experiments confirm a correctness of our approach and memory requirements for it do not exceed those for other transforms with the ordered propagation.

Citation Download Citation

Oleg G. Okun "Fast Euclidean distance mapping using ordered propagation", Proc. SPIE 3389, Hybrid Image and Signal Processing VI, (8 July 1998); https://doi.org/10.1117/12.316543

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