An Eigendecomposition Approach to Weighted Graph Matching Problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
Structural Matching in Computer Vision Using Probabilistic Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Graph Edit Distance from Spectral Seriation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Exact and Approximate Graph Matching Using Random Walks
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Binary Linear Programming Formulation of the Graph Edit Distance
IEEE Transactions on Pattern Analysis and Machine Intelligence
Edit distance-based kernel functions for structural pattern classification
Pattern Recognition
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
Fast suboptimal algorithms for the computation of graph edit distance
SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Feature selection for graph-based image classifiers
IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II
Reactive tabu search for measuring graph similarity
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
Structure-based graph distance measures of high degree of precision
Pattern Recognition
Kernel k-Means Clustering Applied to Vector Space Embeddings of Graphs
ANNPR '08 Proceedings of the 3rd IAPR workshop on Artificial Neural Networks in Pattern Recognition
Reducing the dimensionality of dissimilarity space embedding graph kernels
Engineering Applications of Artificial Intelligence
Approximate graph edit distance computation by means of bipartite graph matching
Image and Vision Computing
Median graphs: A genetic approach based on new theoretical properties
Pattern Recognition
Graph-Based Representations in Pattern Recognition and Computational Intelligence
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
A Recursive Embedding Approach to Median Graph Computation
GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
Improving Graph Classification by Isomap
GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
Large-scale malware indexing using function-call graphs
Proceedings of the 16th ACM conference on Computer and communications security
A family of novel graph kernels for structural pattern recognition
CIARP'07 Proceedings of the Congress on pattern recognition 12th Iberoamerican conference on Progress in pattern recognition, image analysis and applications
A comparison between two representatives of a set of graphs: median vs. barycenter graph
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
Improved call graph comparison using simulated annealing
Proceedings of the 2011 ACM Symposium on Applied Computing
People re-identification by graph kernels methods
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
A graph-kernel method for re-identification
ICIAR'11 Proceedings of the 8th international conference on Image analysis and recognition - Volume Part I
Inexact graph matching based on kernels for object retrieval in image databases
Image and Vision Computing
Malware classification based on call graph clustering
Journal in Computer Virology
Online selection of effective functional test programs based on novelty detection
Proceedings of the International Conference on Computer-Aided Design
Dynamic Landmarking for Surface Feature Identification and Change Detection
ACM Transactions on Intelligent Systems and Technology (TIST)
On graph-associated matrices and their eigenvalues for optical character recognition
ANNPR'12 Proceedings of the 5th INNS IAPR TC 3 GIRPR conference on Artificial Neural Networks in Pattern Recognition
BinSlayer: accurate comparison of binary executables
PPREW '13 Proceedings of the 2nd ACM SIGPLAN Program Protection and Reverse Engineering Workshop
Hand dorsal vein recognition based on hierarchically structured texture and geometry features
CCBR'12 Proceedings of the 7th Chinese conference on Biometric Recognition
Spectral graph features for the classification of graphs and graph sequences
Computational Statistics
| Hi-index | 0.00 |
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to describe relational information in the patterns under consideration. One of the main drawbacks of graph representations is that the computation of standard graph similarity measures is exponential in the number of involved nodes. Hence, such computations are feasible for rather small graphs only. One of the most flexible error-tolerant graph similarity measures is based on graph edit distance. In this paper we propose an approach for the efficient compuation of edit distance based on bipartite graph matching by means of Munkres' algorithm, sometimes referred to as the Hungarian algorithm. Our proposed algorithm runs in polynomial time, but provides only suboptimal edit distance results. The reason for its suboptimality is that implied edge operations are not considered during the process of finding the optimal node assignment. In experiments on semi-artificial and real data we demonstrate the speedup of our proposed method over a traditional tree search based algorithm for graph edit distance computation. Also we show that classification accuracy remains nearly unaffected.