Size-invariant four-scan Euclidean distance transformation

Document Type

Article

Publication Date

1-1-1998

Abstract

Distance transform (DT)(1) is used to convert a binary image that consists of object (foreground) and nonobject (background) pixels into another image in which each object pixel has a value corresponding to the minimum distance from the background by a predefined distance function. The Euclidean distance is more accurate than the others, such as city-block, chessboard and chamfer, but it takes more computational time due to its nonlinearity. By using the relative X and Y coordinates computed from the object pixel to the source mapping pixel of its neighbors as well as correction of particular cases, the Euclidean distance transformation (EDT) can be correctly obtained in just four scans of an image. In other words, the new algorithm achieves the computational complexity of EDT to be linear to the size of an image. © 1998 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.

Identifier

0032210639 (Scopus)

Publication Title

Pattern Recognition

External Full Text Location

https://doi.org/10.1016/S0031-3203(98)00022-3

ISSN

00313203

First Page

1761

Last Page

1766

Issue

11

Volume

31

This document is currently not available here.

Share

COinS