Evaluation of genetic operators and solution representations for shape recognition by genetic algorithms

被引:18
作者
Khoo, KG [1 ]
Suganthan, PN [1 ]
机构
[1] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore
关键词
attributed relational graph; genetic algorithm; graph matching; structural pattern recognition; shape recognition;
D O I
10.1016/S0167-8655(02)00123-X
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we investigate the genetic algorithm based optimization procedure for structural pattern recognition in a model-based recognition system using attributed relational graph matching technique. In this study, potential solutions indicating the mapping between scene and model vertices are represented by integer strings. The test scene may contain multiple occurrences of different or the same model object. Khoo and Suganthan [Proc. IEEE Congr. Evolutionary Comput. Conf. 2001, p. 727] proposed a solution string representation scheme for multiple mapping between a test scene and all model objects and with the uniform crossover operator. In this paper, we evaluate this proposed solution string representation scheme with another representation scheme commonly used to solve the problem. In addition, a comparison between the uniform, one-point and two-point crossover operators was made. An efficient pose-clustering algorithm is used to eliminate any wrong mappings and to determine the presence/pose of the model in the scene. Simulations are carried out to evaluate the various solution representations and genetic operators. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:1589 / 1597
页数:9
相关论文
共 17 条
[1]  
[Anonymous], 1989, GENETIC ALGORITHM SE
[2]   PARTIAL SHAPE-RECOGNITION - A LANDMARK-BASED APPROACH [J].
ANSARI, N ;
DELP, EJ .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1990, 12 (05) :470-483
[3]   Inexact graph matching using genetic search [J].
Cross, ADJ ;
Wilson, RC ;
Hancock, ER .
PATTERN RECOGNITION, 1997, 30 (06) :953-970
[4]  
GOLD S, 1996, IEEE T PATTERN ANAL, V4, P309
[5]  
HOLLAND JH, 1975, ADAPTATION NATURAL A
[6]  
HOPFIELD JJ, 1985, BIOL CYBERN, V52, P141
[7]   ON THE FOUNDATIONS OF RELAXATION LABELING PROCESSES [J].
HUMMEL, RA ;
ZUCKER, SW .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1983, 5 (03) :267-287
[8]  
Khoo KG, 2001, IEEE C EVOL COMPUTAT, P727, DOI 10.1109/CEC.2001.934261
[9]   OPTIMIZATION BY SIMULATED ANNEALING [J].
KIRKPATRICK, S ;
GELATT, CD ;
VECCHI, MP .
SCIENCE, 1983, 220 (4598) :671-680
[10]  
KRCMAR M, 1994, IEEE WORLD C COMP IN, V6, P3872