An Efficient Uniform Cost Algorithm Applied to Distance Transforms

The uniform-cost algorithm is a special case of the A*-algorithm for finding the shortest paths in graphs. In the uniform-cost algorithm, nodes are expanded in order of increasing cost. An efficient version of this algorithm is developed for integer cost values. Nodes are sorted by storing them at predefined places (bucket sort), keeping the overhead low. The algorithm is applied to general distance transformation. A constrained distance transform is an operation which calculates at each pixel of an image the distance to the nearest pixel of a reference set, distance being defined as minimum path length. The uniform-cost algorithm, in the constrained case, proves to be the best solution for distance transformation. It is fast, the processing time is independent of the complexity of the image, and memory requirements are moderate. >

[1]  A. F. Smith,et al.  Statistical analysis of finite mixture distributions , 1986 .

[2]  Gunilla Borgefors,et al.  Distance transformations in digital images , 1986, Comput. Vis. Graph. Image Process..

[3]  J. Pearl,et al.  Recognition of Handwritten Chinese Characters by Modified Hough Transform Techniques , 1989 .

[4]  A. ROSENFELD,et al.  Distance functions on digital pictures , 1968, Pattern Recognit..

[5]  Jim Piper,et al.  Computing distance transformations in convex and non-convex domains , 1987, Pattern Recognit..

[6]  Toshihide Ibaraki,et al.  Distances defined by neighborhood sequences , 1986, Pattern Recognit..

[7]  Ben J. H. Verwer,et al.  Improved metrics in image processing applied to the Hilditch skeleton , 1988, [1988 Proceedings] 9th International Conference on Pattern Recognition.

[8]  Keinosuke Fukunaga,et al.  Bayes Error Estimation Using Parzen and k-NN Procedures , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[10]  K. Fukunaga,et al.  Nonparametric Data Reduction , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  S. Geman,et al.  Nonparametric Maximum Likelihood Estimation by the Method of Sieves , 1982 .

[12]  Leo Dorst,et al.  Collision Avoidance and Path Finding through Constrained Distance Tranceformation in Robot State Space , 1986, IAS.

[13]  A. Smeulders,et al.  Discrete straight line segments: parameters, primitives and properties , 1991 .

[14]  E. Parzen.  On Estimation of a Probability Density Function and Mode , 1962 .

[15]  C. G. Hilborn,et al.  The Condensed Nearest Neighbor Rule , 1967 .

[16]  David J. Hand,et al.  Kernel Discriminant Analysis , 1983 .

[17]  G. Borgefors.  Distance transformations in arbitrary dimensions , 1984 .