Multiresolution genetic clustering algorithm for texture segmentation

被引:12
作者
Li, CT [1 ]
Chiao, R
机构
[1] Univ Warwick, Dept Comp Sci, Coventry CV4 7AL, W Midlands, England
[2] Chung Cheng Inst Technol, Dept Elect Engn, Taoyuan 33509, Taiwan
关键词
texture segmentation; genetic algorithm; K-means clustering; multiresolution;
D O I
10.1016/S0262-8856(03)00120-3
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This work plans to approach the texture segmentation problem by incorporating genetic algorithm and K-means clustering method within a multiresolution structure. As the algorithm descends the multiresolution structure, the coarse segmentation results are propagated down to the lower levels so as to reduce the inherent class-position uncertainty and to improve the segmentation accuracy. The procedure is described as follows. In the first step, a quad-tree structure of multiple resolutions is constructed. Sampling windows of different sizes are utilized to partition the underlying image into blocks at different resolution levels and texture features are extracted from each block. Based on the texture features, a hybrid genetic algorithm is employed to perform the segmentation. While the select and mutate operators of the traditional genetic algorithm are adopted in this work, the crossover operator is replaced with K-means clustering method. In the final step, the boundaries and the segmentation result of the current resolution level are propagated down to the next level to act as contextual constraints and the initial configuration of the next level, respectively. (C) 2003 Elsevier B.V. All rights reserved.
引用
收藏
页码:955 / 966
页数:12
相关论文
共 27 条
[1]   Unsupervised segmentation of Markov random field modeled textured images using selectionist relaxation [J].
Andrey, P ;
Tarroux, P .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1998, 20 (03) :252-262
[2]  
[Anonymous], GENETIC LEARNING ADA
[3]   An MLP-based texture segmentation method without selecting a feature set [J].
Bhattacharya, U ;
Chaudhuri, BB ;
Parui, SK .
IMAGE AND VISION COMPUTING, 1997, 15 (12) :937-948
[4]   MULTIPLE RESOLUTION SEGMENTATION OF TEXTURED IMAGES [J].
BOUMAN, C ;
LIU, BD .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1991, 13 (02) :99-113
[5]   UNSUPERVISED TEXTURE SEGMENTATION USING MULTICHANNEL DECOMPOSITION AND HIDDEN MARKOV-MODELS [J].
CHEN, JL ;
KUNDU, A .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 1995, 4 (05) :603-619
[6]   MARKOV RANDOM FIELD TEXTURE MODELS [J].
CROSS, GR ;
JAIN, AK .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1983, 5 (01) :25-39
[7]   MODELING AND SEGMENTATION OF NOISY AND TEXTURED IMAGES USING GIBBS RANDOM-FIELDS [J].
DERIN, H ;
ELLIOTT, H .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1987, 9 (01) :39-55
[8]   AN INTRODUCTION TO SIMULATED EVOLUTIONARY OPTIMIZATION [J].
FOGEL, DB .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 1994, 5 (01) :3-14
[9]   OPTIMIZATION OF CONTROL PARAMETERS FOR GENETIC ALGORITHMS [J].
GREFENSTETTE, JJ .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1986, 16 (01) :122-128
[10]   STATISTICAL AND STRUCTURAL APPROACHES TO TEXTURE [J].
HARALICK, RM .
PROCEEDINGS OF THE IEEE, 1979, 67 (05) :786-804