The distance transformation converts a binary image, consisting of feature and non-feature pixels, into an image where all feature pixels have a value corresponding to the distance to the nearest non-feature pixel. In this paper, we propose a method o...
The distance transformation converts a binary image, consisting of feature and non-feature pixels, into an image where all feature pixels have a value corresponding to the distance to the nearest non-feature pixel. In this paper, we propose a method of distance transformation of digital pictures by means of the breadth first search strategy which is the simplest problem solving method in artificial intelligence.
First of all, it is shown that only two strategies which are uniform cost search and breadth first search are available for the computing of distance transformation among various search strategies. Also, it is shown experimentally that breadth first search is as efficient as uniform cost search in the transformation. The ground is based on the observation that the computation at pixels near the reference set must be performed before computing at pixels further away.