Structural pattern recognition using genetic algorithms

This paper presents a genetic algorithm (GA) based optimization procedure for the solution of structural pattern recognition problem using the attributed relational graph representation and matching technique. In this study, candidate solutions are represented by integer strings and the population is randomly initialized. The GA is employed to generate a monomorphic mapping. As all the mapping constraints are not enforced during the search phase in order to speedup the search, an efficient pose clustering algorithm is used to eliminate spurious matches and to determine the presence of the model in the scene. The performance of the proposed approach to pattern recognition by subgraph isomorphism is demonstrated using line patterns and silhouette images.

[1]  C. Darwin.  The Origin of Species by Means of Natural Selection, Or, The Preservation of Favoured Races in the Struggle for Life , 1859 .

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

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

[4]  William Grimson,et al.  Object recognition by computer - the role of geometric constraints , 1991 .

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

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

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

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

[9]  Robert M. Haralick,et al.  Structural Descriptions and Inexact Matching , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  Edwin R. Hancock,et al.  Structural Matching by Discrete Relaxation , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  Bir Bhanu,et al.  Representation and Shape Matching of 3-D Objects , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[13]  Teuvo Kohonen,et al.  In: Self-organising Maps , 1995 .

[14]  Randy L. Haupt,et al.  Practical Genetic Algorithms , 1998 .

[15]  George C. Stockman,et al.  Object recognition and localization via pose clustering , 1987, Comput. Vis. Graph. Image Process..

[16]  N. M. Nasrabadi,et al.  Object recognition based on graph matching implemented by a Hopfield-style neural network , 1989, International 1989 Joint Conference on Neural Networks.

[17]  D. Fogel.  Evolutionary algorithms in theory and practice , 1997, Complex..

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

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

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

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