论文信息 - Fast erosion and dilation by contour processing and thresholding of distance maps

Fast erosion and dilation by contour processing and thresholding of distance maps

Abstract 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.

Ingemar Ragnemalm | I. Ragnemalm

[1] Jim Piper,et al. Computing distance transformations in convex and non-convex domains , 1987, Pattern Recognit..

[2] Azriel Rosenfeld,et al. Digital Picture Processing , 1976 .

[3] Piet W. Verbeek,et al. An Efficient Uniform Cost Algorithm Applied to Distance Transforms , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[4] Jean Serra,et al. Image Analysis and Mathematical Morphology , 1983 .

[5] Lucas J. van Vliet,et al. A contour processing method for fast binary neighbourhood operations , 1988, Pattern Recognit. Lett..

[6] Gunilla Borgefors,et al. Distance transformations in digital images , 1986, Comput. Vis. Graph. Image Process..

[7] P. Danielsson. Euclidean distance mapping , 1980 .