A study of permutation crossover operators on the traveling salesman problem
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Management Science
Edge-Labeling Using Dictionary-Based Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
The “molecular” traveling salesman
Biological Cybernetics
Theory refinement on Bayesian networks
Proceedings of the seventh conference (1991) on Uncertainty in artificial intelligence
A Bayesian compatibility model for graph matching
Pattern Recognition Letters
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Graduated Assignment Algorithm for Graph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
Structural Matching by Discrete Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Analysis of the behaviour of genetic algorithms when learning Bayesian network structure from data
Pattern Recognition Letters - special issue on pattern recognition in practice V
Graph Matching With a Dual-Step EM Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fuzzy Relative Position Between Objects in Image Processing: A Morphological Approach
IEEE Transactions on Pattern Analysis and Machine Intelligence
Feature subset selection by Bayesian network-based optimization
Artificial Intelligence
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
Convergence of a Hill Climbing Genetic Algorithm for Graph Matching
EMMCVPR '99 Proceedings of the Second International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
Combinatonal Optimization by Learning and Simulation of Bayesian Networks
UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
The equation for response to selection and its use for prediction
Evolutionary Computation
Feature subset selection by genetic algorithms and estimation of distribution algorithms
Artificial Intelligence in Medicine
An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Flexible shape-based query rewriting
FQAS'06 Proceedings of the 7th international conference on Flexible Query Answering Systems
Using symmetry and evolutionary search to minimize sorting networks
The Journal of Machine Learning Research
| Hi-index | 0.00 |
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size of the graphs as well as the number of attributes they contain can be too high for optimization algorithms. This happens for instance in image recognition, where structures of an image to be recognized need to be matched with a model defined as a graph. In order to face this complexity problem, graph matching can be regarded as a combinatorial optimization problem with constraints and it therefore it can be solved with evolutionary computation techniques such as Genetic Algorithms (GAs) and Estimation Distribution Algorithms (EDAs). This work proposes the use of EDAs, both in the discrete and continuous domains, in order to solve the graph matching problem. As an example, a particular inexact graph matching problem applied to recognition of brain structures is shown. This paper compares the performance of these two paradigms for their use in graph matching.