An Image Understanding System Using Attributed Symbolic Representation and Inexact Graph-Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
On the editing distance between unordered labeled trees
Information Processing Letters
Continuous characterizations of the maximum clique problem
Mathematics of Operations Research
The Dynamics of Nonlinear Relaxation Labeling Processes
Journal of Mathematical Imaging and Vision
The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
Matching Hierarchical Structures Using Association Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
Shock Graphs and Shape Matching
International Journal of Computer Vision
Mean and maximum common subgraph of two graphs
Pattern Recognition Letters
Approximating the maximum weight clique using replicator dynamics
IEEE Transactions on Neural Networks
Shock-Based Indexing into Large Shape Databases
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Recognition of Shapes by Editing Their Shock Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
A skeletal measure of 2D shape similarity
Computer Vision and Image Understanding
XML application schema matching using similarity measure and relaxation labeling
Information Sciences: an International Journal
Discovering Shape Classes using Tree Edit-Distance and Pairwise Clustering
International Journal of Computer Vision
Edit distance-based kernel functions for structural pattern classification
Pattern Recognition
Region-Based Hierarchical Image Matching
International Journal of Computer Vision
On Euclidean Corrections for Non-Euclidean Dissimilarities
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
A game-theoretic approach to partial clique enumeration
Image and Vision Computing
Matching Hierarchies of Deformable Shapes
GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
Graph classification by means of Lipschitz embedding
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Tree edit distance from information theory
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
Rectifying non-euclidean similarity data through tangent space reprojection
IbPRIA'11 Proceedings of the 5th Iberian conference on Pattern recognition and image analysis
Towards the unification of structural and statistical pattern recognition
Pattern Recognition Letters
Graph structure analysis based on complex network
Digital Signal Processing
| Hi-index | 0.00 |
This paper presents a new method for computing the tree edit distance problem with uniform edit cost. We commence by showing that any tree obtained with a sequence of cut operations is a subtree of the transitive closure of the original tree, we show that the necessary condition for any subtree to be a solution can be reduced to a clique problem in a derived structure. Using this idea we transform the problem of computing tree edit distance into a series of maximum weight clique problems. We, then use relaxation labeling to find an approximation to the tree edit distance.