This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Decomposition of Arbitrarily Shaped Binary Morphological Structuring Elements Using Genetic Algorithms
February 1998 (vol. 20 no. 2)
pp. 217-224
ASCII Text
x 
 
Giovanni Anelli, Alberto Broggi, Giulio Destri, "Decomposition of Arbitrarily Shaped Binary Morphological Structuring Elements Using Genetic Algorithms," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 20, no. 2, pp. 217-224, February, 1998.
 
 
BibTex
x
 
@article{ 10.1109/34.659943,
author = {Giovanni Anelli and Alberto Broggi and Giulio Destri},
title = {Decomposition of Arbitrarily Shaped Binary Morphological Structuring Elements Using Genetic Algorithms},
journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence},
volume = {20},
number = {2},
issn = {0162-8828},
year = {1998},
pages = {217-224},
doi = {http://doi.ieeecomputersociety.org/10.1109/34.659943},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Pattern Analysis and Machine Intelligence
TI - Decomposition of Arbitrarily Shaped Binary Morphological Structuring Elements Using Genetic Algorithms
IS - 2
SN - 0162-8828
SP217
EP224
EPD - 217-224
A1 - Giovanni Anelli,
A1 - Alberto Broggi,
A1 - Giulio Destri,
PY - 1998
KW - Mathematical morphology
KW - arbitrarily shaped structuring element decomposition
KW - genetic algorithms.
VL - 20
JA - IEEE Transactions on Pattern Analysis and Machine Intelligence
ER -
 

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.

[1] P. Angeline, G. Saunders, and J. Pollack, "An Evolutionary Algorithm That Constructs Recurrent Neural Networks," IEEE Trans. Neural Networks, vol. 5, pp. 54-65, Jan. 1994.
[2] A. Broggi, "Speeding-Up Mathematical Morphology Computations With Special-Purpose Array Processors," Proc. 27th Hawaii Int'l Conf. System Sciences, T.N. Mudge and B.D. Shriver, eds., vol. 1, pp. 321-330,Maui, Hawaii, Jan.4-7 1994. Los Alamitos, Calif.: IEEE Computer Society.
[3] E. Falkenauer, "A New Representation and Operators for Genetic Algorithms Applied to Grouping Problems," Evolutionary Computation, vol. 2 no. 2, 1994.
[4] D. Fogel, "An Introduction to Simulated Evolutionary Optimization," IEEE Trans. Neural Networks, vol. 5, pp. 3-14, Jan. 1994.
[5] D. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning.Readings, Mass.: Addison Wesley, 1989.
[6] D.E. Goldberg, B. Korb, and K. Deb, "Messy Genetic Algorithms: Motivation, Analysis, and First Results," Complex Systems, vol. 3, pp. 493-530, 1989.
[7] D.E. Goldberg, B. Korb, and K. Deb, "Messy Genetic Algorithms Revisited: Studies in Mixed Size and Scale," Complex Systems, vol. 4, pp. 415-444, 1990.
[8] 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, Apr. 1987.
[9] J. Holland, Adaption Natural and Artificial Systems.Ann Arbor, Mich.: Univ. of Michigan Press, 1975.
[10] S.W. Mahfoud, "Crossover Interactions Among Niches," Proc. First IEEE Conf. on Evolutionary Computation, pp. 188-193, 1994.
[11] G. Matheron, Random Sets and Integral Geometry.New York: John Wiley, 1975.
[12] Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs.Berlin: Springer-Verlag, 1992.
[13] H. Park and R.T. Chin, "Optimal Decomposition of Convex Structuring Elements for a 4-Connected Parallel Array Processor," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 16, no. 3, Mar. 1994.
[14] H. Park and R.T. Chin, "Decomposition of Arbitrarily Shaped Morphological Structuring Elements," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 1, Jan. 1995.
[15] J. Serra, Image Analysis and Mathematical Morphology.London: Academic Press, 1982.
[16] M. Srinivas and L. Patnaik, "Adaptive Probabilities of Crossover and Mutation in Genetic Algorithm," IEEE Trans. System, Man, and Cybernetics, vol. 24, no. 4, Apr. 1994.
[17] R. van den Boomgaard, Mathematical Morphology: Extensions Towards Computer Vision, PhD thesis, Universiteit Van Amsterdam, 1992.
[18] 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.
[19] S.S. Wilson, "Theory of Matrix Morphology," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 14, no. 6, pp. 636-652, June 1992.
[20] X. Zhuang and R.M. Haralick, "Morphological Structuring Element Decomposition," Computer Vision, Graphics, and Image Processing, vol. 35, pp. 370-382, Sept. 1986.

Index Terms:
Mathematical morphology, arbitrarily shaped structuring element decomposition, genetic algorithms.
Citation:
Giovanni Anelli, Alberto Broggi, Giulio Destri, "Decomposition of Arbitrarily Shaped Binary Morphological Structuring Elements Using Genetic Algorithms," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 20, no. 2, pp. 217-224, Feb. 1998, doi:10.1109/34.659943
Usage of this product signifies your acceptance of the Terms of Use.