Computing the Euclidean Distance Transform

摘要

Given an n x n binary image of white and black pixels, we present an optimal algorithms for computing the distance transform and the nearest feature transform using the Euclidean metric. The parallel algorithm employs the systolic computation to achieve O(n) running time on a linear array of n processors.