Convex Structuring Element Decomposition for Single Scan Binary Mathematical Morphology
This paper presents a structuring element decomposition method and a corresponding morphological erosion algorithm able to compute the binary erosion of an image using a single regular pass whatever the size of the convex structuring element.
Similarly to classical dilation-based methods , the proposed decomposition is iterative and builds a growing set of structuring elements. The novelty consists in using the set union instead of the Minkowski sum as the elementary structuring element construction operator. At each step of the construction, already-built elements can be joined together in any combination of translations and set unions. There is no restrictions on the shape of the structuring element that can be built. Arbitrary shape decompositions can be obtained with existing genetic algorithms  with an homogeneous construction method. This paper, however, addresses the problem of convex shape decomposition with a deterministic method.
KeywordsGeneralize Distance Mathematical Morphology Construction Scheme Disk Size Pattern Recognition Letter
- 1.Xu, J.: Decomposition of convex polygonal morphological structuring elements into neighborhood subsets. IEEE trans. on PAMI 13, 153–162 (1991)Google Scholar
- 2.Anelli, G., Broggi, A., Destri, G.: Decomposition of arbitrarily shaped binary morphological structuring elements using genetic algorithms. IEEE trans. on PAMI 20, 217–224 (1998)Google Scholar
- 6.Borgefors, G.: Distance transformations in digital images. CVGIP 34, 344–371 (1986)Google Scholar
- 7.Wang, X., Bertrand, G.: An algorithm for a generalized distance transformation based on minkowski operations. In: ICPR, pp. 1164–1168 (1988)Google Scholar
- 8.Wang, X., Bertrand, G.: Some sequential algorithms for a generalized distance transformation based on minkowski operations. IEEE Trans. on PAMI 14, 1114–1121 (1992)Google Scholar
- 9.Gong, W.: On decomposition of structure element for mathematical morphology. In: ICPR, pp. 836–838 (1988)Google Scholar
- 10.Ji, L., Piper, J., Tang, J.: Erosion and dilation of binary images by arbitrary structuring elements using interval coding. Pattern Recognition Letters, 201–209 (1989)Google Scholar
- 12.Van Droogenbroeck, M.: Algorithms for openings of binary and label images with rectangular structuring elements. In: Talbot, H., Beare, R. (eds.) Mathematical morphology, pp. 197–207. CSIRO Publishing, Sydney (2002)Google Scholar
- 14.Ohn, S.: Morphological decomposition of convex polytopes and its application in discrete image space. In: ICIP, vol. 2, pp. 560–564 (1994)Google Scholar
- 15.Thiel, E., Montanvert, A.: Chamfer masks: Discrete distance functions, geometrical properties and optimization. In: ICPR, vol. III, pp. 244–247 (1992)Google Scholar