Fast Euclidean distance transformation in two scans using a 3 × 3 neighborhood
Document Type
Article
Publication Date
1-1-2004
Abstract
Cuisenaire and Macq [Comp. Vis. Image Understand., 76(2) (1999) 163] proposed a fast Euclidean distance transformation (EDT) by propagation using multiple neighborhoods and bucket sorting. To save the time for bucket sorting and to reduce the complexity of multiple neighborhoods, we propose a new, simple and fast EDT in two scans using a 3 × 3 neighborhood. By recording the relative x- and y-coordinates, an optimal two-scan algorithm can be developed to achieve the EDT correctly and efficiently in a constant time without iterations. © 2003 Elsevier Inc. All rights reserved.
Identifier
0742304570 (Scopus)
Publication Title
Computer Vision and Image Understanding
External Full Text Location
https://doi.org/10.1016/j.cviu.2003.09.004
ISSN
10773142
First Page
195
Last Page
205
Issue
2
Volume
93
Recommended Citation
Shih, Frank Y. and Wu, Yi Ta, "Fast Euclidean distance transformation in two scans using a 3 × 3 neighborhood" (2004). Faculty Publications. 20534.
https://digitalcommons.njit.edu/fac_pubs/20534
