FAST EROSION AND DILATION BY CONTOUR PROCESSING AND THRESHOLDING OF DISTANCE MAPS

被引:40
作者
RAGNEMALM, I
机构
[1] Department of Electrical Engineering, Linköping University
关键词
DISTANCE TRANSFORMATION; PROPAGATION; EROSION; DILATION; CONTOUR PROCESSING; ORDERED PROPAGATION; BINARY IMAGE PROCESSING; EUCLIDEAN METRIC;
D O I
10.1016/0167-8655(92)90055-5
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper describes efficient algorithms for performing propagation (i.e., erosion and dilation). The proposed algorithm performs ordered propagation using Euclidean distance transformation without generating any distance map. This allows optimization of both the time and memory demand.
引用
收藏
页码:161 / 166
页数:6
相关论文
共 11 条
[1]   DISTANCE TRANSFORMATIONS IN DIGITAL IMAGES [J].
BORGEFORS, G .
COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1986, 34 (03) :344-371
[2]   EUCLIDEAN DISTANCE MAPPING [J].
DANIELSSON, PE .
COMPUTER GRAPHICS AND IMAGE PROCESSING, 1980, 14 (03) :227-248
[3]  
DOUGHERTY ER, 1987, IMAGE PROCESSING CON, V1
[4]  
LAY B, 1987, ACTA STEREOL, V6, P691
[5]   COMPUTING DISTANCE TRANSFORMATIONS IN CONVEX AND NONCONVEX DOMAINS [J].
PIPER, J ;
GRANUM, E .
PATTERN RECOGNITION, 1987, 20 (06) :599-615
[6]  
Ragnemalm I., 1990, Proceedings of the 5th International Conference on Image Analysis and Processing. Progress in Image Analysis and Processing, P204
[7]  
Rosenfeld A., 1976, DIGITAL PICTURE PROC
[8]  
Rosenfeld A., 1982, DIGITAL PICTURE PROC, V2nd
[9]  
Serra J, 1982, IMAGE ANAL MATH MORP
[10]   A CONTOUR PROCESSING METHOD FOR FAST BINARY NEIGHBORHOOD OPERATIONS [J].
VANVLIET, LJ ;
VERWER, BJH .
PATTERN RECOGNITION LETTERS, 1988, 7 (01) :27-36