This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Recursive Implementation of Erosions and Dilations Along Discrete Lines at Arbitrary Angles
May 1996 (vol. 18 no. 5)
pp. 562-567

Abstract—Van Herk has shown that the erosion/dilation operator with a linear structuring element of an arbitrary length can be implemented in only three min/max operations per pixel. In this paper, the algorithm is generalized to erosions and dilations along discrete lines at arbitrary angles. We also address the padding problem; so that the operation can be performed in place without copying the pixels to and from an intermediate buffer. Applications to image filtering and to radial decompositions of discs are presented.

[1] R. Adams, "Radial Decomposition of Discs and Spheres," Computer Vision, Graphics, and Image Processing: Graphical Models and Image Processing, vol. 55, no. 5, pp. 325-332, Sept. 1993.
[2] J. Bresenham, "Algorithm for Computer Control of Digital Plotter, IBM System J., vol. 4, pp. 25-30, 1965.
[3] J. Bresenham,“A linear algorithm for incremental digital display of circular arcs,” Comm. ACM, vol. 20, no. 2, pp. 100-16, 1977.
[4] B. Chaudhuri, “An Efficient algorithm for Running Window Pel Grey Level Ranking in 2D Images,” Pattern Recognition Letters, vol. 11, no. 2, pp. 77-80, 1990.
[5] S. Crabtree, L.-P. Yuan, and R. Ehrlich, "A Fast and Accurate Erosion-Dilation Method Suitable for Microcomputers," Computer Vision, Graphics, and Image Processing: Graphical Models and Image Processing, vol. 53, no. 3, pp. 283-290, May 1991.
[6] M. Van Droogenbroeck, "On the Implementation of Morphological Operations," Math. Morphology and Its Applications to Image Processing, J. Serra and P. Soille, eds. Dordrecht: Kluwer Academic Publishers, 1994, pp. 241-248.
[7] R.M. Haralick,S.R. Sternberg,, and X. Zhuang,“Image analysis using mathematical morphology,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 9, no. 4, pp. 532-550, July 1988.
[8] B. Laÿ, "Recursive Algorithms in Mathematical Morphology," ACM Trans. Graphics, vol. 6, pp. 691-696, 1987.
[9] J. Pecht, "Speeding Up Successive Minkowski Operations," Pattern Recognition Letters, vol. 3, no. 2, pp. 113-117, 1985.
[10] I. Ragnemalm, "Fast Erosion and Dilation by Contour Processing and Thresholding of Distance Maps," Pattern Recognition Letters, vol. 13, pp. 161-166, 1992.
[11] J. Serra, Image Analysis and Mathematical Morphology.London: Academic Press, 1982.
[12] J. Serra, "Examples of Structuring Functions and Their Uses," Image Analysis and Mathematical Morphology, Volume 2: Theoretical Advances, J. Serra, ed., ch. 4, pp. 71-99. Academic Press, 1988.
[13] J. Serra and L. Vincent, “An Overview of Morphological Filtering,” Circuits Systems Signal Process, vol. 11, no. 1, pp. 47-108, 1992.
[14] R. van den Boomgaard and R. van Balen, “Methods for Fast Morphological Image Transforms Using Bitmapped Binary Images,” Computer Vision, Graphics, and Image Processing: Graphical Models and Image Processing, vol. 54, no. 3, pp. 252-258, May 1992.
[15] M. van Herk, “A Fast Algorithm for Local Minimum and Maximum Filters on Rectangular and Octogonal Kernels,” Pattern Recognition Letters, vol. 13, pp. 517-521, 1992.
[16] L. Vincent, "Morphological Transformations of Binary Images with Arbitrary Structuring Elements," Signal Processing, vol. 22, no. 1, pp. 3-23, Jan. 1991.
[17] I. Young, R. Pevereni, P. Verbeek, and P. Otterloo, "A New Implementation for the Binary and Minkowski Operators," Computer Graphics and Image Processing, vol. 17, pp. 189-210, 1981.

Index Terms:
Mathematical morphology, image filtering, algorithms, recursivity, line and periodic structuring elements, radial decompositions.
Citation:
Pierre Soille, Edmond J. Breen, Ronald Jones, "Recursive Implementation of Erosions and Dilations Along Discrete Lines at Arbitrary Angles," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 18, no. 5, pp. 562-567, May 1996, doi:10.1109/34.494646
Usage of this product signifies your acceptance of the Terms of Use.