Erosion and dilation of binary images by arbitrary structuring elements using interval coding

Abstract Interval coding of binary images provides a representation in which the mathematical morphology operations of dilation and erosion by an arbitrary structuring element can be naturally and efficiently implemented on a serial computer. Conventional 4- or 8-neighbour dilation and erosion are then only special cases. Euclidean mapping is investigated as an example.

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

[2]  G. A. Shippey,et al.  A fast interval processor , 1981, Pattern Recognit..

[3]  Frans C. A. Groen,et al.  A fast algorithm for cellular logic operations on sequential machines , 1984, Pattern Recognit. Lett..

[4]  G. Borgefors.  Distance transformations in arbitrary dimensions , 1984 .

[5]  Xinhua Zhuang,et al.  Image Analysis Using Mathematical Morphology , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  D. Rutovitz,et al.  An investigation of object-oriented programming as the basis for an image processing and analysis system , 1988, [1988 Proceedings] 9th International Conference on Pattern Recognition.

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

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

[9]  Piet W. Verbeek,et al.  A new implementation for the binary and Minkowski operators , 1981 .

[10]  Azriel Rosenfeld,et al.  Sequential Operations in Digital Picture Processing , 1966, JACM.

[11]  Jim Piper.  Efficient implementation of skeletonisation using interval coding , 1985, Pattern Recognit. Lett..

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

[13]  Jim Piper,et al.  Data structures for image processing in a C language and Unix environment , 1985, Pattern Recognit. Lett..

[14]  Partha Pratim Das,et al.  Knight's distance in digital geometry , 1988 .

[15]  J. Serra.  Introduction to mathematical morphology , 1986 .

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