Decomposition of Arbitrarily Shaped Binary Morphological Structuring Elements Using Genetic Algorithms

Authors:
Giovanni Anelli;Alberto Broggi;Giulio Destri
Affiliations:
Univ. di Parma, Parma, Italy;Univ. di Parma, Parma, Italy;Univ. di Parma, Parma, Italy
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1998

Citing 3
Cited 8

Theory of Matrix Morphology

IEEE Transactions on Pattern Analysis and Machine Intelligence
Decomposition of Arbitrarily Shaped Morphological Structuring Elements

IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimal Decomposition of Convex Morphological Structuring Elements for 4-Connected Parallel Array Processors

IEEE Transactions on Pattern Analysis and Machine Intelligence

A Combinatorial Optimization Technique for the Sequential Decomposition of Erosions and Dilations

Journal of Mathematical Imaging and Vision
A Note on Park and Chin's Algorithm

IEEE Transactions on Pattern Analysis and Machine Intelligence
Decomposition of binary morphological structuring elements based on genetic algorithms

Computer Vision and Image Understanding
An Embedded Real-Time Surveillance System: Implementation and Evaluation

Journal of Signal Processing Systems
Note: Decomposition of binary morphological structuring elements based on genetic algorithms

Computer Vision and Image Understanding
Decomposition of arbitrary gray-scale morphological structuring elements

Pattern Recognition
Computationally efficient, one-pass algorithm for morphological filters

Journal of Visual Communication and Image Representation
Recursive structure element decomposition using migration fitness scaling genetic algorithm

ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part I

Quantified Score

Hi-index	0.14

Visualization

Abstract

A number of different algorithms have been described in the literature for the decomposition of both convex binary morphological structuring elements and a specific subset of nonconvex ones. Nevertheless, up to now no deterministic solutions have been found to the problem of decomposing arbitrarily shaped structuring elements. This work presents a new stochastic approach based on Genetic Algorithms in which no constraints are imposed on the shape of the initial structuring element, nor assumptions are made on the elementary factors, which are selected within a given set.