An optimal parallel algorithm for the Euclidean distance maps of binary images

Abstract

The Euclidean distance map (EDM) of a black and white n/spl times/n binary image is the n/spl times/n map where each element has the Euclidean distance between the corresponding pixel and the nearest black pixel. The EDM plays an important role in machine vision, pattern recognition and robotics. Many algorithms have been proposed for computing the EDM. In recent years, O(n/sup 2/) time sequential algorithms were presented for computing the EDM. Hirata and Kato (1994) showed that their algorithm can be parallelized to run in O(n/sup 2//p) time using p processors (1/spl les/p/spl les/n) on the EREW PRAM. We present a parallel algorithm for computing the EDM. The algorithm runs in O(log n) time using n/sup 2//log n processors on the EREW PRAM and in O(log n/log log n) time using n/sup 2/ log log n/log n processors on the common CRCW PRAM, respectively. The algorithm is optimal in the sense that the product of the time and the number of processors is equal to the lower bound of the sequential time for computing the EDM.<>