Decomposition of arbitrarily shaped binary morphological structuring elements using genetic algorithms

被引:25
作者
Anelli, G [1 ]
Broggi, A [1 ]
Destri, G [1 ]
机构
[1] Univ Parma, Dipartimento Ingn Informaz, I-43100 Parma, Italy
关键词
mathematical morphology; arbitrarily shaped structuring element decomposition; genetic algorithms;
D O I
10.1109/34.659943
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:217 / 224
页数:8
相关论文
共 20 条
[11]  
Mahfoud S. W., 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence (Cat. No.94TH0650-2), P188, DOI 10.1109/ICEC.1994.350018
[12]  
MICHALEWICZ Z, 1992, GENETIC ALGORITHMS P
[13]  
PARK H, 1994, IEEE T PATTERN ANAL, V16
[14]  
PARK H, 1995, IEEE T PATTERN ANAL, V17
[15]  
Serra J., 1982, Image Analysis and Mathematical Morphology
[16]  
SRINIVAS M, 1994, IEEE T SYSTEM MAN CY, V24
[17]   METHODS FOR FAST MORPHOLOGICAL IMAGE TRANSFORMS USING BITMAPPED BINARY IMAGES [J].
VANDENBOOMGAARD, R ;
VANBALEN, R .
CVGIP-GRAPHICAL MODELS AND IMAGE PROCESSING, 1992, 54 (03) :252-258
[18]  
VANDENBOOMGAARD R, 1992, THESIS U AMSTERDAM
[19]   THEORY OF MATRIX MORPHOLOGY [J].
WILSON, SS .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1992, 14 (06) :636-652
[20]   MORPHOLOGICAL STRUCTURING ELEMENT DECOMPOSITION [J].
ZHUANG, XH ;
HARALICK, RM .
COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1986, 35 (03) :370-382