Issue No. 04 - April (1989 vol. 11)

ISSN: 0162-8828

pp: 425-429

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.19041

ABSTRACT

<p>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.</p>

INDEX TERMS

picture processing; uniform cost propagation; uniform cost algorithm; distance transforms; shortest paths; bucket sort; pixel; graph theory; optimisation; pattern recognition; picture processing

CITATION

B.J.H. Verwer, P.W. Verbeek, S.T. Dekker, "An Efficient Uniform Cost Algorithm Applied to Distance Transforms",

*IEEE Transactions on Pattern Analysis & Machine Intelligence*, vol. 11, no. , pp. 425-429, April 1989, doi:10.1109/34.19041