Solving Graph Matching with EDAs Using a Permutation-Based Representation

Graph matching has become an important area of research because of the potential advantages of using graphs for solving recognition problems. An example of its use is in image recognition problems, where structures to be recognized are represented by nodes in a graph that are matched against a model, which is also represented as a graph.

[1]  Max Henrion,et al.  Propagating uncertainty in bayesian networks by probabilistic logic sampling , 1986, UAI.

[2]  M. E. Muller,et al.  A Note on the Generation of Random Normal Deviates , 1958 .

[3]  Pedro Larrañaga,et al.  Estimation of Distribution Algorithms , 2002, Genetic Algorithms and Evolutionary Computation.

[4]  Isabelle Bloch,et al.  On fuzzy distances and their use in image processing under imprecision , 1999, Pattern Recognit..

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

[6]  Paul A. Viola,et al.  MIMIC: Finding Optima by Estimating Probability Densities , 1996, NIPS.

[7]  Brian D. Ripley,et al.  Stochastic Simulation , 2005 .

[8]  I. Bloch,et al.  A new definition for fuzzy attributed graph homomorphism with application to structural shape recognition in brain imaging , 1999, IMTC/99. Proceedings of the 16th IEEE Instrumentation and Measurement Technology Conference (Cat. No.99CH36309).

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

[10]  W. Banzhaf,et al.  The “molecular” traveling salesman , 1990, Biological Cybernetics.

[11]  Isabelle Bloch,et al.  Inexact graph matching by means of estimation of distribution algorithms , 2002, Pattern Recognit..

[12]  Edwin R. Hancock,et al.  Matching delaunay graphs , 1997, Pattern Recognit..

[13]  Josef Kittler,et al.  Edge-Labeling Using Dictionary-Based Relaxation , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  Pedro Larrañaga,et al.  Optimization in Continuous Domains by Learning and Simulation of Gaussian Networks , 2000 .

[15]  Edwin R. Hancock,et al.  Convergence of a Hill Climbing Genetic Algorithm for Graph Matching , 1999, EMMCVPR.

[16]  Edwin R. Hancock,et al.  A Bayesian compatibility model for graph matching , 1996, Pattern Recognit. Lett..

[17]  Isabelle Bloch,et al.  Fuzzy Relative Position Between Objects in Image Processing: A Morphological Approach , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  Andrew P. Sage,et al.  Uncertainty in Artificial Intelligence , 1987, IEEE Transactions on Systems, Man, and Cybernetics.

[19]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[20]  Darrell Whitley,et al.  Genitor: a different genetic algorithm , 1988 .

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

[22]  Edwin R. Hancock,et al.  Symbolic graph matching with the EM algorithm , 1998, Pattern Recognit..

[23]  Edwin R. Hancock,et al.  Least-commitment graph matching with genetic algorithms , 2001, Pattern Recognit..

[24]  Heinz Mühlenbein,et al.  The Equation for Response to Selection and Its Use for Prediction , 1997, Evolutionary Computation.

[25]  Edwin R. Hancock,et al.  Graph Matching With a Dual-Step EM Algorithm , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

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

[27]  L. Lovász.  Matching Theory (North-Holland mathematics studies) , 1986 .