Graph algorithms and NP-completeness
Graph algorithms and NP-completeness
Invariant Image Recognition by Zernike Moments
IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern Recognition Letters
An algorithm for optimal isomorphism between two random graphs
Pattern Recognition Letters
A Bayesian compatibility model for graph matching
Pattern Recognition Letters
A Graduated Assignment Algorithm for Graph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
A graph distance metric based on the maximal common subgraph
Pattern Recognition Letters
Graph Matching With a Dual-Step EM Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Structural Matching in Computer Vision Using Probabilistic Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Inexact Graph Matching with Genetic Search
SSPR '96 Proceedings of the 6th International Workshop on Advances in Structural and Syntactical Pattern Recognition
Finding Deformable Shapes Using Loopy Belief Propagation
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Graph multidimensional scaling with self-organizing maps
Information Sciences—Informatics and Computer Science: An International Journal
Structure-Based Similarity Search with Graph Histograms
DEXA '99 Proceedings of the 10th International Workshop on Database & Expert Systems Applications
A fast technique for comparing graph representations with applications to performance evaluation
International Journal on Document Analysis and Recognition
Kernel-based discriminative learning algorithms for labeling sequences, trees, and graphs
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Extensions of marginalized graph kernels
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Graph Edit Distance from Spectral Seriation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Estimation of Dependences Based on Empirical Data: Springer Series in Statistics (Springer Series in Statistics)
Shortest-Path Kernels on Graphs
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
2005 Speical Issue: Graph kernels for chemical informatics
Neural Networks - Special issue on neural networks and kernel methods for structured domains
The representation and matching of categorical shape
Computer Vision and Image Understanding
Inexact graph matching using a genetic algorithm for image recognition
Pattern Recognition Letters
Measuring the similarity of labeled graphs
ICCBR'03 Proceedings of the 5th international conference on Case-based reasoning: Research and Development
Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Spectral median graphs applied to graphical symbol recognition
CIARP'06 Proceedings of the 11th Iberoamerican conference on Progress in Pattern Recognition, Image Analysis and Applications
Object categorization using kernels combining graphs and histograms of gradients
ICIAR'06 Proceedings of the Third international conference on Image Analysis and Recognition - Volume Part II
An experimental comparison of fingerprint classification methods using graphs
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
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
Quotient geometric crossovers and redundant encodings
Theoretical Computer Science
WSM: a novel algorithm for subgraph matching in large weighted graphs
Journal of Intelligent Information Systems
Efficient geometric graph matching using vertex embedding
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Structured representations in a content based image retrieval context
Journal of Visual Communication and Image Representation
Efficient processing of graph similarity queries with edit distance constraints
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.10 |
During the last decade, the use of graph-based object representation has drastically increased. As a matter of fact, object representation by means of graphs has a number of advantages over feature vectors. As a consequence, methods to compare graphs have become of first interest. In this paper, a graph matching method and a distance between attributed graphs are defined. Both approaches are based on subgraphs. In this context, subgraphs can be seen as structural features extracted from a given graph, their nature enables them to represent local information of a root node. Given two graphs G"1,G"2, the univalent mapping can be expressed as the minimum-weight subgraph matching between G"1 and G"2 with respect to a cost function. This metric between subgraphs is directly derived from well-known graph distances. In experiments on four different data sets, the distance induced by our graph matching was applied to measure the accuracy of the graph matching. Finally, we demonstrate a substantial speed-up compared to conventional methods while keeping a relevant precision.