Optimization on euclidean distance transformation using grayscale morphology

Document Type

Article

Publication Date

1-1-1992

Abstract

A distance transformation converts a digital binary image that consists of object (foreground) and nonobject (background) pixels into a gray-level image in which all object pixels have a value corresponding to the minimum distance from the background. Computing the distance from a pixel to a set of background pixels is in principle a global operation that is often prohibitively costly. The Euclidean distance measurement is very useful in object recognition and inspection because of the metric accuracy and rotation invariance. However, its global operation is difficult to decompose into small neighborhood operations because of the nonlinearity of Euclidean distance computation. This paper presents three algorithms for Euclidean distance transformation in digital images by the use of the grayscale morphological erosion with the squared Euclidean distance structuring element. The optimal algorithm requires only four erosions by small structuring components and is independent of the object size. It can be implemented in parallel and is very efficient in computation because only the integer is used until the last step of a square-root operation. © 1992.

Identifier

0040466236 (Scopus)

Publication Title

Journal of Visual Communication and Image Representation

External Full Text Location

https://doi.org/10.1016/1047-3203(92)90009-I

e-ISSN

10959076

ISSN

10473203

First Page

104

Last Page

114

Issue

2

Volume

3

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS