Fast Euclidean distance transform using a graph-search algorithm
作者： R.A. Lotufo , A.A. Falcao , F.A. Zampirolli
DOI: 10.1109/SIBGRA.2000.883922
关键词:
摘要: Two new Euclidean distance transform algorithms are described. The designed using a shortest path graph-search framework. can be seen as the solution of forest problem. Previous works have dealt with (EDT) and problem, but none them presented an EDT approach. proposed very simple yet belong to class one most efficient sequential algorithms. easily extend higher dimensions.
ieeecomputersociety.org参考文章(9)
James B. Orlin, Thomas L. Magnanti, Ravindra K. Ahuja, Network Flows: Theory, Algorithms, and Applications ,(1993)
A. Rosenfeld, J.L. Pfaltz, Distance functions on digital pictures Pattern Recognition. ,vol. 1, pp. 33- 61 ,(1968) , 10.1016/0031-3203(68)90013-7
Ingemar Ragnemalm, Neighborhoods for distance transformations using ordered propagation Cvgip: Image Understanding. ,vol. 56, pp. 399- 409 ,(1992) , 10.1016/1049-9660(92)90050-D
Yazid M. Sharaiha, Nicos Christofides, A graph-theoretic approach to distance transformations Pattern Recognition Letters. ,vol. 15, pp. 1035- 1041 ,(1994) , 10.1016/0167-8655(94)90036-1
Hinnik Eggers, Two Fast Euclidean Distance Transformations in Z2Based on Sufficient Propagation Computer Vision and Image Understanding. ,vol. 69, pp. 106- 116 ,(1998) , 10.1006/CVIU.1997.0596
Gunilla Borgefors, Distance transformations in digital images Graphical Models \/graphical Models and Image Processing \/computer Vision, Graphics, and Image Processing. ,vol. 34, pp. 344- 371 ,(1986) , 10.1016/S0734-189X(86)80047-0
O Cuisenaire, B Macq, Fast Euclidean Distance Transformation by Propagation Using Multiple Neighborhoods Computer Vision and Image Understanding. ,vol. 76, pp. 163- 172 ,(1999) , 10.1006/CVIU.1999.0783
Robert B. Dial, Algorithm 360: shortest-path forest with topological ordering [H] Communications of The ACM. ,vol. 12, pp. 632- 633 ,(1969) , 10.1145/363269.363610
E. W. Dijkstra, A note on two problems in connexion with graphs Numerische Mathematik. ,vol. 1, pp. 269- 271 ,(1959) , 10.1007/BF01386390