Paper
2 October 1998 How to avoid multiplications when generating Euclidean distance maps
Oleg G. Okun
Author Affiliations +
Abstract
A new implementation of the Euclidean, ordered propagation distance transform is developed. Unlike traditional approaches, where multiplication operations contribute a significant cost to computation, we suggest to apply the city lock and chessboard distance transform to approximate the Euclidean distances.In fact, the city block transform is just performed, while the chessboard one is simulated based on the iteration number value. Though multiplications are not totally excluded, their amount is greatly reduced because a few pixel values are only corrected at each iteration of the algorithm by using the Euclidean distances as compared to other similar methods, where those distances are determined for each pixel. As a result, we obtain a faster method for generating the Euclidean distance maps, which is still accurate.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Oleg G. Okun "How to avoid multiplications when generating Euclidean distance maps", Proc. SPIE 3454, Vision Geometry VII, (2 October 1998); https://doi.org/10.1117/12.323261
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Raster graphics

Silicon

Image processing

Information technology

Lithium

Computer simulations

Chlorine

RELATED CONTENT


Back to Top