Least-commitment graph matching with genetic algorithms

DOI10.1016/S0031-3203(99)00217-4zbMath0992.68185OpenAlexW2136377760WikidataQ60431489 ScholiaQ60431489MaRDI QIDQ5957593

Richard Myers, Edwin R. Hancock

Publication date: 7 March 2002

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0031-3203(99)00217-4

zbMATH Keywords

graph matchinggenetic search

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10)

Uses Software

• Genocop
• Triangle

Cites Work

• GAS, a concept on modeling species in genetic algorithms
• The internal representation of solid shape with respect to vision
• Test driving three 1995 genetic algorithms: New test functions and geometric matching
• On the Foundations of Relaxation Labeling Processes
• Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition
• Improving Consistency and Reducing Ambiguity in Stochastic Labeling: An Optimization Approach
• Tabu Search—Part I
• A distance measure between attributed relational graphs for pattern recognition
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Least-commitment graph matching with genetic algorithms