Abstract
The decomposition of a binary morphological structuring element is a well-known problem that has often been addresses in the literature. This work present a new approach based on an Evolution Program: using an iterative stochastic technique, it allows to determine the optimal decomposition of an arbitrarily shaped binary morphological structuring element into the shortest chain of elementary factors chosen from a given set.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
G. Adorni, A. Broggi, G. Conte, and V. D’Andrea. Real-Time Image Processing for Automotive Applications. In P. A. Laplante and A. D. Stoyenko, editors, Real-Time Image Processing: Theory, Techniques and Applications. IEEE Press and SPIE Press, Summer 1996. In press.
P. Angeline, G. Saunders, and J. Pollack. An Evolutionary Algorithm That Constructs Recurrent Neural Networks. IEEE Trans on Neural Networks, 5:54–65, January 1994.
A. Broggi. Speeding-up Mathematical Morphology Computations with Special-Purpose Array Processors. In Procs of 27th IEEE HICSS, I:321–330,1994.
A. Broggi, G. Conte, F. Gregoretti, C. Sansoè, and L. M. Reyneri. The PAPRICA Massively Parallel Processor. In Procs IEEE MPCS, pages 16–30, 1994.
A. Broggi, G. Conte, F. Gregoretti, C. Sansoè, and L. M. Reyneri. The Evolution of the PAPRICA System. Integrated Computer-Aided Engineering Journal, 1995. In press.
D.E. Goldberg, B. Korb, and K. Deb Messy Genetic Algorithms: Motivation, Analysis and First Results. Complex Systems, 3:493–530, 1989.
E. Falkenauer. A New Representation and Operators for Genetic Algorithms Applied to Grouping Problems. Evolutionary Computation, 2(2), 1994.
D. Fogel. An introduction to Simulated Evolutionary Optimization. IEEE Trans on Neural Networks, 5:3–14, January 1994.
D. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Readings, MA, 1989.
M. Srinivas and L. M. Patnaik Adaptive Probabilities of Crossover and Mutation in Genetic Algorithm. 24(4), Apr 1994.
Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, Berlin, 1992.
H. Park and R. T. Chin. Optimal Decomposition of Convex Structuring Elements for a 4-Connected Parallel Array Processor. IEEE Trans on PAMI, 16(3), March 1994.
H. Park and R. T. Chin. Decomposition of Arbitrarily Shaped Morphological Structuring Elements. IEEE Trans on PAMI, 17(1), January 1995.
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
Anelli, G., Broggi, A., Destri, G. (1996). Toward the Optimal Decomposition of Arbitrarily Shaped Structuring Elements by Means of a Genetic Approach. 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_26
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0469-2_26
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-8063-4
Online ISBN: 978-1-4613-0469-2
eBook Packages: Springer Book Archive