Theoretical analysis and experimental comparison of graph matching algorithms for database filtering

Authors:
Christophe Irniger;Horst Bunke
Affiliations:
Department of Computer Science, University of Bern, Bern, Switzerland;Department of Computer Science, University of Bern, Bern, Switzerland
Venue:
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
Year:
2003

Citing 6
Cited 2

Organizing Large Structural Modelbases

IEEE Transactions on Pattern Analysis and Machine Intelligence
A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection

IEEE Transactions on Pattern Analysis and Machine Intelligence
An Algorithm for Subgraph Isomorphism

Journal of the ACM (JACM)
Using Support Vector Machines to Enhance the Performance of Elastic Graph Matching for Frontal Face Authentication

IEEE Transactions on Pattern Analysis and Machine Intelligence
Symbol Recognition by Error-Tolerant Subgraph Matching between Region Adjacency Graphs

IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Learning Structural Variations in Shock Trees

Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition

Graph-based tools for data mining and machine learning

MLDM'03 Proceedings of the 3rd international conference on Machine learning and data mining in pattern recognition
Introducing a novel data management approach for distributed large scale data processing in future computer clouds

ICONIP'11 Proceedings of the 18th international conference on Neural Information Processing - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

In structural pattern recognition, an unknown pattern is often transformed into a graph that is matched against a database in order to find the most similar prototype in the database. Graph matching is a powerful yet computationally expensive procedure. If the sample graph is matched against a large database of model graphs, the size of the database is introduced as an additional factor into the overall complexity of the matching process. Database filtering procedures are used to reduce the impact of this additional factor. In this paper we report the results of a basic study on the relation between filtering efficiency and graph matching algorithm performance, using different graph matching algorithms for isomorphism and subgraph-isomorphism.