A Computational Approach to Edge Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Eigendecomposition Approach to Weighted Graph Matching Problems
IEEE Transactions on Pattern Analysis and Machine Intelligence
Surface shape and curvature scales
Image and Vision Computing
Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
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
Structural Matching by Discrete Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Shape Spectrum Based View Grouping and Matching of 3D Free-Form Objects
IEEE Transactions on Pattern Analysis and Machine Intelligence
On a relation between graph edit distance and maximum common subgraph
Pattern Recognition Letters
Algorithms for straight line fitting using k-means
Pattern Recognition Letters
A Spectral Algorithm for Seriation and the Consecutive Ones Problem
SIAM Journal on Computing
An energy function and continuous edit process for graph matching
Neural Computation
Corner detection via topographic analysis of vector-potential
Pattern Recognition Letters
The String-to-String Correction Problem
Journal of the ACM (JACM)
New Constraints on Data-Closeness and Needle Map Consistency for Shape-from-Shading
IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern Recognition Letters - Special issue on pattern recognition in practice VI
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
Pairwise Data Clustering by Deterministic Annealing
IEEE Transactions on Pattern Analysis and Machine Intelligence
KI '97 Proceedings of the 21st Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Binary Partitioning, Perceptual Grouping, and Restoration with Semidefinite Programming
IEEE Transactions on Pattern Analysis and Machine Intelligence
Polyhedral object recognition by indexing
Pattern Recognition
A Binary Linear Programming Formulation of the Graph Edit Distance
IEEE Transactions on Pattern Analysis and Machine Intelligence
Graphical Models and Point Pattern Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
Computational approaches to temporal sampling of video sequences
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Graph simplification and matching using commute times
Pattern Recognition
Image categorization: Graph edit distance+edge direction histogram
Pattern Recognition
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Recent Advances in Constraints
Graph matching using the interference of continuous-time quantum walks
Pattern Recognition
Median graph: A new exact algorithm using a distance based on the maximum common subgraph
Pattern Recognition Letters
A robust Graph Transformation Matching for non-rigid registration
Image and Vision Computing
Graph matching using the interference of discrete-time quantum walks
Image and Vision Computing
Approximate graph edit distance computation by means of bipartite graph matching
Image and Vision Computing
Graph Matching Based on Node Signatures
GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
A graph matching method and a graph matching distance based on subgraph assignments
Pattern Recognition Letters
Graph classification by means of Lipschitz embedding
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
The Journal of Machine Learning Research
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
A correspondence measure for graph matching using the discrete quantum walk
GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
Graph similarity using interfering quantum walks
CAIP'07 Proceedings of the 12th international conference on Computer analysis of images and patterns
Comparing graph similarity measures for graphical recognition
GREC'09 Proceedings of the 8th international conference on Graphics recognition: achievements, challenges, and evolution
Graph attribute embedding via Riemannian submersion learning
Computer Vision and Image Understanding
Towards performance evaluation of graph-based representation
GbRPR'11 Proceedings of the 8th 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
Graph embedding using a quasi-quantum analogue of the hitting times of continuous time quantum walks
Quantum Information & Computation
The RW2 algorithm for exact graph matching
ICAPR'05 Proceedings of the Third international conference on Advances in Pattern Recognition - Volume Part I
Eigenspaces from seriated graphs
CAIP'05 Proceedings of the 11th international conference on Computer Analysis of Images and Patterns
Evolving spanning trees using the heat equation
CAIP'05 Proceedings of the 11th international conference on Computer Analysis of Images and Patterns
Fast FPT-Algorithms for cleaning grids
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Spanning trees from the commute times of random walks on graphs
ICIAR'06 Proceedings of the Third international conference on Image Analysis and Recognition - Volume Part II
Machine learning with seriated graphs
IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II
Graph seriation using semi-definite programming
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
Probabilistic subgraph matching based on convex relaxation
EMMCVPR'05 Proceedings of the 5th international conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
Pattern analysis with graphs: Parallel work at Bern and York
Pattern Recognition Letters
Network-theoretic classification of parallel computation patterns
International Journal of High Performance Computing Applications
Graph structure analysis based on complex network
Digital Signal Processing
Graph embedding in vector spaces by node attribute statistics
Pattern Recognition
Geometric graph comparison from an alignment viewpoint
Pattern Recognition
Hypergraph-based image retrieval for graph-based representation
Pattern Recognition
Computer Science Review
Sentimental Spidering: Leveraging Opinion Information in Focused Crawlers
ACM Transactions on Information Systems (TOIS)
Biview face recognition in the shape-texture domain
Pattern Recognition
Coloring based approach for matching unrooted and/or unordered trees
Pattern Recognition Letters
Graph matching and clustering using kernel attributes
Neurocomputing
A spectral-multiplicity-tolerant approach to robust graph matching
Pattern Recognition
Journal of Information Science
Graph similarity search with edit distance constraint in large graph databases
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Efficient processing of graph similarity queries with edit distance constraints
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.14 |
This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that they lack some of the formality and rigor of the computation of string edit distance. Hence, our aim is to convert graphs to string sequences so that string matching techniques can be used. To do this, we use a graph spectral seriation method to convert the adjacency matrix into a string or sequence order. We show how the serial ordering can be established using the leading eigenvector of the graph adjacency matrix. We pose the problem of graph-matching as a maximum a posteriori probability (MAP) alignment of the seriation sequences for pairs of graphs. This treatment leads to an expression in which the edit cost is the negative logarithm of the a posteriori sequence alignment probability. We compute the edit distance by finding the sequence of string edit operations which minimizes the cost of the path traversing the edit lattice. The edit costs are determined by the components of the leading eigenvectors of the adjacency matrix and by the edge densities of the graphs being matched. We demonstrate the utility of the edit distance on a number of graph clustering problems.