2D Euclidean distance transform algorithms: A comparative survey

被引:349
作者
Fabbri, Ricardo [1 ]
Costa, Luciano Da F. [2 ]
Torelli, Julio C. [3 ]
Bruno, Odemir M. [3 ]
机构
[1] Brown Univ, LEMS, Providence, RI 02912 USA
[2] Univ Sao Paulo, Inst Fis Sao Carlos, BR-13560970 Sao Carlos, SP, Brazil
[3] Univ Sao Paulo, ICMC, BR-13560970 Sao Carlos, SP, Brazil
关键词
design; languages; management; database systems; graph databases; database models; graph database models; graph query languages; graph integrity constraints;
D O I
10.1145/1322432.1322434
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The distance transform (DT) is a general operator forming the basis of many methods in computer vision and geometry, with great potential for practical applications. However, all the optimal algorithms for the computation of the exact Euclidean DT (EDT) were proposed only since the 1990s. In this work, state-of-the-art sequential 2D EDT algorithms are reviewed and compared, in an effort to reach more solid conclusions regarding their differences in speed and their exactness. Six of the best algorithms were fully implemented and compared in practice.
引用
收藏
页数:44
相关论文
共 102 条
[1]  
Ahuja RK, 1993, NETWORK FLOWS THEORY
[2]  
[Anonymous], 1982, DATA STRUCTURES ALGO
[3]  
[Anonymous], 1990, COMPUTATIONAL GEOMET
[4]  
AURENHAMMER F, 1991, COMPUT SURV, V23, P345, DOI 10.1145/116873.116880
[5]  
Bellman R., 1958, Quarterly of Applied Mathematics, V16, P87, DOI DOI 10.1090/QAM/102435
[6]  
Blum H., 1967, Models for the Perception of Speech and Visual Forms, P362, DOI DOI 10.1142/S0218654308001154
[7]   DISTANCE TRANSFORMATIONS IN DIGITAL IMAGES [J].
BORGEFORS, G .
COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1986, 34 (03) :344-371
[8]   DISTANCE TRANSFORMATIONS IN ARBITRARY DIMENSIONS [J].
BORGEFORS, G .
COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1984, 27 (03) :321-345
[9]  
BORGEFORS G, 1997, PATT RECOG LETT, P465
[10]   Efficient computation of the Euclidean distance transform [J].
Boxer, L ;
Miller, R .
COMPUTER VISION AND IMAGE UNDERSTANDING, 2000, 80 (03) :379-383