Abstract
Binary morphological dilation and erosion with long line structuring elements is computationally expensive when performed by the conventional methods of taking the unions and intersections of all translates of the input binary image with the structuring element. Thus, the overall computational complexity is a function of the product of the image size and that of the structuring element. This paper discusses one-pass constant time recursive algorithms for performing dilation and erosion of a binary image of a given size, with a line structuring element oriented in a given direction regardless of its length. The input binary image is scanned along a digital line generated in the specified orientation. Starting from every 1-pixel in the image directed distances of pixels are measured along the digital line and the pixel values are replaced with the computed values producing a grey scale image called the transform image. This is then thresholded with the desired length of the structuring element. When the resulting image is appropriately translated to account for the true origin of the structuring element, the result is the desired dilation/erosion. The timing of the recursive algorithm is evaluated with respect to the conventional morphological algorithm. It is shown to achieve a speedup of 5, on an average, over all orientations of the line structuring element of length 150 pixels when using a salt and pepper image of size 240 X 256 with the probability of a pixel being a 1-pixel set to 0.25.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. M. Haralick and L. G. Shapiro, Computer And Robot Vision, Addison-Wesley Publishers, 1992.
R.M. Haralick S.R. Sternberg X. Zhuang, “Image Analysis Using Mathematical Morphology”, IEEE Transactions on Pattern Analysis And Machine Intelligence, vol. 9, no. 4, pp. 532–550, 1987.
J. Serra, Image Analysis and Mathematical Morpphology, London: Academic, 1982.
S. Chen and R.M. Haralick, “Recursive erosion, dilation, opening, and closing transforms”, IEEE trans. Image Processing, vol. 4, no. 3, pp. 335–345, March 1995.
A. Rosenfeld and J.L. Pfaltz, “Distance functions in digital pictures”, Pattern Recognition, vol. 1, pp. 33–61, 1968.
G. Bertrand and X. Wang, “An algorithm for a generalised distance transformation based on minskowski operations”, in Proc. 9th ICPR (Rome), pp. 1163–1167, November 1988.
X. Wang and G. Bertrand, “Some sequential algorithms for a generalized distance transformation based on minskowski operations”, IEEE trans. PAMI., vol. 14, no. 11, pp. 1114–1121, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Nadadur, D.C., Haralick, R.M. (1996). Recursive Morphology Using Line Structuring Elements. In: Maragos, P., Schafer, R.W., Butt, M.A. (eds) Mathematical Morphology and its Applications to Image and Signal Processing. Computational Imaging and Vision, vol 5. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0469-2_24
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0469-2_24
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-8063-4
Online ISBN: 978-1-4613-0469-2
eBook Packages: Springer Book Archive