The efficient algorithms for achieving Euclidean distance transformation

Document Type

Article

Publication Date

8-1-2004

Abstract

Euclidean distance transformation (EDT) is used to convert a digital binary image consisting of object (foreground) and nonobject (background) pixels into another image where each pixel has a value of the minimum Euclidean distance from nonobject pixels. In this paper, the improved iterative erosion algorithm is proposed to avoid the redundant calculations in the iterative erosion algorithm. Furthermore, to avoid the iterative operations, the two-scan-based algorithm by a deriving approach is developed for achieving EDT correctly and efficiently in a constant time. Besides, we discover when obstacles appear in the image, many algorithms cannot achieve the correct EDT except our two-scan-based algorithm. Moreover, the two-scan-based algorithm does not require the additional cost of preprocessing or relative-coordinates recording. © 2004 IEEE.

Identifier

3843068794 (Scopus)

Publication Title

IEEE Transactions on Image Processing

External Full Text Location

https://doi.org/10.1109/TIP.2004.826098

ISSN

10577149

PubMed ID

15326850

First Page

1078

Last Page

1091

Issue

8

Volume

13

This document is currently not available here.

Share

COinS