On a relation between graph edit distance and maximum common subgraph
Pattern Recognition Letters
Intelligent systems and interfaces
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Graph edit distance with node splitting and merging, and its application to diatom identification
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
Measuring the similarity of labeled graphs
ICCBR'03 Proceedings of the 5th international conference on Case-based reasoning: Research and Development
An Algebraic Framework for Schema Matching
Informatica
Approximate graph edit distance computation by means of bipartite graph matching
Image and Vision Computing
Bipartite graph matching for computing the edit distance of graphs
GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
Constraint-based graph matching
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Improving vector space embedding of graphs through feature selection algorithms
Pattern Recognition
Identifying refactoring opportunities in process model repositories
Information and Software Technology
Speeding up graph edit distance computation through fast bipartite matching
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
Inexact graph matching based on kernels for object retrieval in image databases
Image and Vision Computing
Multi-labeled graph matching: an algorithm model for schema matching
ASIAN'05 Proceedings of the 10th Asian Computing Science conference on Advances in computer science: data management on the web
Ant algorithm for the graph matching problem
EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
Towards the unification of structural and statistical pattern recognition
Pattern Recognition Letters
A comparative study of ant colony optimization and reactive search for graph matching problems
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Discriminative prototype selection methods for graph embedding
Pattern Recognition
| Hi-index | 0.00 |
Graph matching is often used for image recognition. Different kinds of graph matchings have been proposed such as (sub)graph isomorphism or error-tolerant graph matching, giving rise to different graph similarity measures. A first goal of this paper is to show that these different measures can be viewed as special cases of a generic similarity measure introduced in [8]. This generic similarity measure is based on a non-bijective graph matching (like [4] and [2]) so that it is well suited to image recognition. In particular, over/under-segmentation problems can be handled by linking one vertex to a set of vertices. In a second part, we address the problem of computing this measure and we describe two algorithms: a greedy algorithm, that quickly computes sub-optimal solutions, and a reactive Tabu search algorithm, that may improve these solutions. Some experimental results are given.