论文信息 - A fast algorithm for morphological erosion and dilation

A fast algorithm for morphological erosion and dilation

This paper describes a new algorithm for performing erosion and dilation which is suitable for flat line-segment structuring functions, and which has a computational complexity that is independent of the structuring function size. Unlike other proposed algorithms, the computation time required by this method is directly proportional to the number of extrema within the signal being processed. This makes it particularly suitable for signals and images that have large and slowly varying segments.

J. Andrew Bangham | C. Jeremy Pye

[1] Marcel van Herk. A fast algorithm for local minimum and maximum filters on rectangular and octagonal kernels , 1992, Pattern Recognit. Lett..

[2] Xinhua Zhuang,et al. Morphological structuring element decomposition , 1986 .

[3] Ioannis Pitas,et al. Fast algorithms for running ordering and max/min calculation , 1989 .

[4] Jaakko Astola,et al. On computation of the running median , 1989, IEEE Trans. Acoust. Speech Signal Process..

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

[6] Thomas S. Huang,et al. A fast two-dimensional median filtering algorithm , 1979 .

[7] Ioannis Pitas,et al. On fast running max-min filtering , 1997 .