Share Email Print

Proceedings Paper

Fast Euclidean distance mapping using ordered propagation
Author(s): Oleg G. Okun
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 8 July 1998
PDF: 8 pages
Proc. SPIE 3389, Hybrid Image and Signal Processing VI, (8 July 1998); doi: 10.1117/12.316543
Show Author Affiliations
Oleg G. Okun, Institute of Engineering Cybernetics (Finland)

Published in SPIE Proceedings Vol. 3389:
Hybrid Image and Signal Processing VI
David P. Casasent; Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top