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

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.

[1]  Kuo-Chin Fan,et al.  Genetic-based search for error-correcting graph isomorphism , 1997, IEEE Trans. Syst. Man Cybern. Part B.

[2]  Steven Gold,et al.  A Graduated Assignment Algorithm for Graph Matching , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Eam Khwang Teoh,et al.  Pattern recognition by graph matching using the Potts MFT neural networks , 1995, Pattern Recognit..

[4]  Eam Khwang Teoh,et al.  Pattern recognition by homomorphic graph matching using Hopfield neural networks , 1995, Image Vis. Comput..

[5]  Carsten Peterson,et al.  A New Method for Mapping Optimization Problems Onto Neural Networks , 1989, Int. J. Neural Syst..

[6]  Jeng-Sheng Huang,et al.  Pattern recognition using evolution algorithms with fast simulated annealing , 1998, Pattern Recognit. Lett..

[7]  Edward J. Delp,et al.  Partial Shape Recognition: A Landmark-Based Approach , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  J. J. Hopfield,et al.  “Neural” computation of decisions in optimization problems , 1985, Biological Cybernetics.

[9]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[10]  Steven W. Zucker,et al.  On the Foundations of Relaxation Labeling Processes , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[12]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[13]  K. G. Khoo,et al.  Multiple relational graphs mapping using genetic algorithms , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[14]  Eam Khwang Teoh,et al.  Optimal mapping of graph homomorphism onto self organising Hopfield network , 1997, Image Vis. Comput..

[15]  Vo V. Anh,et al.  Scaling Theorems for Zero Crossings of Bandlimited Signals , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  Edwin R. Hancock,et al.  Inexact graph matching using genetic search , 1997, Pattern Recognit..

[17]  Santanu Chaudhury,et al.  Matching structural shape descriptions using genetic algorithms , 1997, Pattern Recognit..