A parallel Euclidean distance transformation algorithms

Author

Embrechts, Hugo ; Roose, Dirk

Author_Institution

Dept. of Comput., Katholieke Univ. Leuven, Heverlee, Belgium

fYear

1993

fDate

1-4 Dec 1993

Firstpage

216

Lastpage

223

Abstract

We present a parallel algorithm for the Euclidean distance transformation (EDT). It is a divide-and-conquer algorithm based on a fast sequential algorithm for the Signed EDT (SEDT). The combining step that follows the local partial calculation of the SEDT can be done efficiently after reformulating the SEDT problem as the partial calculation of a Voronoi Diagram. This leads to an algorithm with two local calculation steps whose computational complexity is proportional to the number of pixels of the subregions and a global calculation step with complexity proportional to the image perimeter. This article contains a description of the algorithm, a complexity analysis, a discussion on load balance and timings obtained on an iPSC/2

Keywords

computational complexity; computational geometry; divide and conquer methods; parallel algorithms; resource allocation; Signed EDT; Voronoi Diagram; combining step; computational complexity; divide-and-conquer algorithm; fast sequential algorithm; global calculation step; iPSC/2; image perimeter; load balance; local calculation steps; local partial calculation; parallel Euclidean distance transformation algorithms; pixels; timings; Algorithm design and analysis; Cities and towns; Euclidean distance; Image analysis; Image converters; Interpolation; Machine vision; Parallel algorithms; Pixel; Timing;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Processing, 1993. Proceedings of the Fifth IEEE Symposium on

Conference_Location

Dallas, TX

Print_ISBN

0-8186-4222-X

Type

conf

DOI

10.1109/SPDP.1993.395529

Filename

395529