
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
B.J.H. Verwer, P.W. Verbeek, S.T. Dekker, "An Efficient Uniform Cost Algorithm Applied to Distance Transforms," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 11, no. 4, pp. 425429, April, 1989.  
BibTex  x  
@article{ 10.1109/34.19041, author = {B.J.H. Verwer and P.W. Verbeek and S.T. Dekker}, title = {An Efficient Uniform Cost Algorithm Applied to Distance Transforms}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {11}, number = {4}, issn = {01628828}, year = {1989}, pages = {425429}, doi = {http://doi.ieeecomputersociety.org/10.1109/34.19041}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  An Efficient Uniform Cost Algorithm Applied to Distance Transforms IS  4 SN  01628828 SP425 EP429 EPD  425429 A1  B.J.H. Verwer, A1  P.W. Verbeek, A1  S.T. Dekker, PY  1989 KW  picture processing; uniform cost propagation; uniform cost algorithm; distance transforms; shortest paths; bucket sort; pixel; graph theory; optimisation; pattern recognition; picture processing VL  11 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
The uniformcost algorithm is a special case of the A*algorithm for finding the shortest paths in graphs. In the uniformcost 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 uniformcost 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] P. E. Hart, N. J. Nilson, and B. Raphael, "A formal basis for the heuristic determination of minimum cost paths,"IEEE Trans. Syst. Sci. Cybern., vol. SSC4, pp. 100107, Feb. 1968.
[2] J. Pearl,Heuristics. Reading, MA: AddisonWesley, 1984.
[3] A. Rosenfeld and J. L. Pfaltz, "Distance functions in digital pictures,"Patt. Recog., vol. 1, no. 1, pp. 3361, 1968.
[4] B. J. H. Verwer, "Improved metrics in image processing applied to the Hilditch skeleton," inProc. 9th Int. Conf. Patt. Recog., 1988, pp. 137142.
[5] G. Borgefors, "Distance transformations in arbitrary dimensions,"Comput. Vision, Graph. Image Process., vol. 27, pp. 321345, 1984.
[6] G. Borgefors, "Distance transformations in digital images,"Comput. Vision, Graphics, Image Processing, vol. 34, pp. 334371, 1986.
[7] M. Yamashita and T. Ibaraki, "Distances defined by neighborhood sequences,"Patt. Recogn., vol. 19, no. 3, pp. 237246, 1986.
[8] P. W. Verbeek, L. Dorst, B. J. H. Verwer, and F. C. A. Groen, "Collision avoidance and path finding through constrained distance transformation in robot state space," inProc. Intelligent Autonomous Systems. Amsterdam, The Netherlands, Dec. 811, 1986, pp. 634 641.
[9] L. Dorst, "Discrete straight line segments: Parameters, primitives and properties," Ph.D. dissertation, Delft Univ. Technol., The Netherlands, 1986.
[10] S. T. Dekker, to be published.
[11] L. Dorst and P. W. Verbeek, "The constrained distance transformation: A pseudoEuclidian, recursive implementation of the Leealgorithm," inProc. European Signal Process. Conf. 1986, The Hague, The Netherlands, Sept. 25, 1986, pp. 917920.
[12] J. Piper and E. Granum, "Computing distance transformations in convex and non convex domains,"Pattern Recog., vol. 20, pp. 599615, 1987.