Structural Stereopsis for 3-D Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Stereo Correspondence Through Feature Grouping and Maximal Cliques
IEEE Transactions on Pattern Analysis and Machine Intelligence
Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
3-D Shape Recovery Using Distributed Aspect Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence - Special issue on interpretation of 3-D scenes—part II
Organizing Large Structural Modelbases
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Normalized String Editing Problem Revisited
IEEE Transactions on Pattern Analysis and Machine Intelligence
Structural Matching by Discrete Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
On a relation between graph edit distance and maximum common subgraph
Pattern Recognition Letters
Genetic algorithm parameter sets for line labelling
Pattern Recognition Letters - special issue on pattern recognition in practice V
Error Correcting Graph Matching: On the Influence of the Underlying Cost Function
IEEE Transactions on Pattern Analysis and Machine Intelligence
The String-to-String Correction Problem
Journal of the ACM (JACM)
Computation of Normalized Edit Distance and Applications
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Computation of Normalized Edit Distances
IEEE Transactions on Pattern Analysis and Machine Intelligence
Genetic Algorithms for Structural Editing
SSPR '98/SPR '98 Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
FCRC '96/WACG '96 Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering
Weighted mean of a pair of graphs
Computing
Self-organizing map for clustering in the graph domain
Pattern Recognition Letters - In memory of Professor E.S. Gelsema
Shape recognition using attributed string matching with polygon vertices as the primitives
Pattern Recognition Letters
An algorithm using length-r paths to approximate subgraph isomorphism
Pattern Recognition Letters
Recent Advances in Structural Pattern Recognition with Applications to Visual Form Analysis
IWVF-4 Proceedings of the 4th International Workshop on Visual Form
Graph-Based Methods for Vision: A Yorkist Manifesto
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Recognition of Shapes by Editing Their Shock Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
Graph Edit Distance from Spectral Seriation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Object Recognition as Many-to-Many Feature Matching
International Journal of Computer Vision
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
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Graph matching and clustering using spectral partitions
Pattern Recognition
Image categorization: Graph edit distance+edge direction histogram
Pattern Recognition
A Fast and Efficient Algorithm for Topology-Aware Coallocation
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
Graph Matching Based on Node Signatures
GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
Preserving privacy in collaborative filtering through distributed aggregation of offline profiles
Proceedings of the third ACM conference on Recommender systems
Temporal matching in endoscopic images for remote-controlled robotic surgery
International Journal of Telemedicine and Applications
Large-scale malware indexing using function-call graphs
Proceedings of the 16th ACM conference on Computer and communications security
Comparing stars: on approximating graph edit distance
Proceedings of the VLDB Endowment
A graph matching method and a graph matching distance based on subgraph assignments
Pattern Recognition Letters
The Journal of Machine Learning Research
Tree edit distance from information theory
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
Self-organizing graph edit distance
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
Graph matching using spectral seriation and string edit distance
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
Retinal fundus image registration via vascular structure graph matching
Journal of Biomedical Imaging
Graph attribute embedding via Riemannian submersion learning
Computer Vision and Image Understanding
Object categorization using bone graphs
Computer Vision and Image Understanding
Graph matching based on dot product representation of graphs
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
On the privacy of anonymized networks
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Modeling of remote sensing image content using attributed relational graphs
SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Journal of Biomedical Informatics
Asymmetric inexact matching of spatially-attributed graphs
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
Edit distance based kernel functions for attributed graph matching
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
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
Ontology-Driven conceptual design of ETL processes using graph transformations
Journal on Data Semantics XIII
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 matching based on spectral embedding with missing value
Pattern Recognition
Geometric graph comparison from an alignment viewpoint
Pattern Recognition
Sentimental Spidering: Leveraging Opinion Information in Focused Crawlers
ACM Transactions on Information Systems (TOIS)
Hi-index | 0.15 |
This paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matching by Sanfeliu and Fu [1]. We show how the Levenshtein distance can be used to model the probability distribution for structural errors in the graph-matching problem. This probability distribution is used to locate matches using MAP label updates. We compare the resulting graph-matching algorithm with that recently reported by Wilson and Hancock. The use of edit-distance offers an elegant alternative to the exhaustive compilation of label dictionaries. Moreover, the method is polynomial rather than exponential in its worst-case complexity. We support our approach with an experimental study on synthetic data and illustrate its effectiveness on an uncalibrated stereo correspondence problem. This demonstrates experimentally that the gain in efficiency is not at the expense of quality of match.