An Eigendecomposition Approach to Weighted Graph Matching Problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
Faster scaling algorithms for network problems
SIAM Journal on Computing
Support Vector Machines for 3D Object Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Approximation algorithms for bipartite and non-bipartite matching in the plane
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices
Journal of the ACM (JACM)
Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Structural Matching in Computer Vision Using Probabilistic Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Using Genetic Algorithms to Solve NP-Complete Problems
Proceedings of the 3rd International Conference on Genetic Algorithms
Performance Evaluation of the VF Graph Matching Algorithm
ICIAP '99 Proceedings of the 10th International Conference on Image Analysis and Processing
A Unified Probabilistic Framework for Web Page Scoring Systems
IEEE Transactions on Knowledge and Data Engineering
ACM Transactions on Internet Technology (TOIT)
A learning algorithm for web page scoring systems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A Binary Linear Programming Formulation of the Graph Edit Distance
IEEE Transactions on Pattern Analysis and Machine Intelligence
Data Fusion and Multicue Data Matching by Diffusion Maps
IEEE Transactions on Pattern Analysis and Machine Intelligence
Methods for Fine Registration of Cadastre Graphs to Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Ancient Graphic Documents Indexing Method Based on Spatial Similarity
Graphics Recognition. Recent Advances and New Opportunities
Graph matching using the interference of continuous-time quantum walks
Pattern Recognition
Graph matching using the interference of discrete-time quantum walks
Image and Vision Computing
Coined quantum walks lift the cospectrality of graphs and trees
Pattern Recognition
Graph Matching Based on Node Signatures
GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
Change detection in ontologies using DAG comparison
CAiSE'07 Proceedings of the 19th international conference on Advanced information systems engineering
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
Probabilistic matching of lines for their homography
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Model comparison with GenericDiff
Proceedings of the IEEE/ACM international conference on Automated software engineering
Reweighted random walks for graph matching
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part V
Virtual network embedding through topology-aware node ranking
ACM SIGCOMM Computer Communication Review
Computing subgraph isomorphic queries using structural unification and minimum graph structures
Proceedings of the 2011 ACM Symposium on Applied Computing
Identifying refactoring opportunities in process model repositories
Information and Software Technology
Graph embedding using a quasi-quantum analogue of the hitting times of continuous time quantum walks
Quantum Information & Computation
On the privacy of anonymized networks
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
The RW2 algorithm for exact graph matching
ICAPR'05 Proceedings of the Third international conference on Advances in Pattern Recognition - Volume Part I
A DAG comparison algorithm and its application to temporal data warehousing
CoMoGIS'06 Proceedings of the 2006 international conference on Advances in Conceptual Modeling: theory and practice
Towards the unification of structural and statistical pattern recognition
Pattern Recognition Letters
Pattern analysis with graphs: Parallel work at Bern and York
Pattern Recognition Letters
Virtual network embedding through topology awareness and optimization
Computer Networks: The International Journal of Computer and Telecommunications Networking
A flexible assembly retrieval approach for model reuse
Computer-Aided Design
SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Approximate graph mining with label costs
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Exploring the design space of multichannel peer-to-peer live video streaming systems
IEEE/ACM Transactions on Networking (TON)
Using local similarity measures to efficiently address approximate graph matching
Discrete Applied Mathematics
Key observation selection-based effective video synopsis for camera network
Machine Vision and Applications
Hi-index | 0.14 |
In this paper, we propose a general framework for graph matching which is suitable for different problems of pattern recognition. The pattern representation we assume is at the same time highly structured, like for classic syntactic and structural approaches, and of subsymbolic nature with real-valued features, like for connectionist and statistic approaches. We show that random walk based models, inspired by Google's PageRank, give rise to a spectral theory that nicely enhances the graph topological features at node level. As a straightforward consequence, we derive a polynomial algorithm for the classic graph isomorphism problem, under the restriction of dealing with Markovian spectrally distinguishable graphs (MSD), a class of graphs that does not seem to be easily reducible to others proposed in the literature. The experimental results that we found on different test-beds of the TC-15 graph database show that the defined MSD class "almost always驴 covers the database, and that the proposed algorithm is significantly more efficient than top scoring VF algorithm on the same data. Most interestingly, the proposed approach is very well-suited for dealing with partial and approximate graph matching problems, derived for instance from image retrieval tasks. We consider the objects of the COIL-100 visual collection and provide a graph-based representation, whose node's labels contain appropriate visual features. We show that the adoption of classic bipartite graph matching algorithms offers a straightforward generalization of the algorithm given for graph isomorphism and, finally, we report very promising experimental results on the COIL-100 visual collection.