The decomposition of binary structuring elements is a key problem in morphological image processing. So far only the decomposition of convex structuring elements and of specific subsets of non-convex ones have been proposed in the literature. This work presents the results of a new approach, based on a Genetic Algorithm, in which no constraints are imposed on the shape of the initial structuring element, nor assumptions are made on the elementary factors, which are chosen from a given set.
CITATION STYLE
Anelli, G., Broggi, A., & Destri, G. (1997). Experiments on the decomposition of arbitrarily shaped binary morphological structuring elements. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1310, pp. 543–550). Springer Verlag. https://doi.org/10.1007/3-540-63507-6_243
Mendeley helps you to discover research relevant for your work.