Efficiently Computing Weighted Tree Edit Distance Using Relaxation Labeling

Authors:
Andrea Torsello;Edwin R. Hancock
Affiliations:
-;-
Venue:
EMMCVPR '01 Proceedings of the Third International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
Year:
2001

Citing 15
Cited 7

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
Shapes, shocks, and deformations I: the components of two-dimensional shape and the reaction-diffusion space

International Journal of Computer Vision
Structural Matching by Discrete Relaxation

IEEE Transactions on Pattern Analysis and Machine Intelligence
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)
Shock Graphs and Shape Matching

International Journal of Computer Vision
Mean and maximum common subgraph of two graphs

Pattern Recognition Letters
Replicator equations, maximal cliques, and graph isomorphism

Neural Computation
Structural Matching in Computer Vision Using Probabilistic Relaxation

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Skeletal Measure of 2D Shape Similarity

IWVF-4 Proceedings of the 4th International Workshop on Visual Form
The Hamilton-Jacobi Skeleton

ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Approximating the maximum weight clique using replicator dynamics

IEEE Transactions on Neural Networks

Matching and Embedding through Edit-Union of Trees

ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Graph-Based Methods for Vision: A Yorkist Manifesto

Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Learning Structural Variations in Shock Trees

Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Curvature correction of the Hamilton-Jacobi skeleton

CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Object categorization using bone graphs

Computer Vision and Image Understanding
Stability of the eigenvalues of graphs

CAIP'05 Proceedings of the 11th international conference on Computer Analysis of Images and Patterns
LPP and LPP mixtures for graph spectral clustering

PSIVT'06 Proceedings of the First Pacific Rim conference on Advances in Image and Video Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates an approach to tree edit distance problem with weighted nodes. We show that any tree obtained with a sequence of cut and relabel operations is a subtree of the transitive closure of the original tree. Furthermore, 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 tree edit distance problem into a series of maximum weight clique problems and then we use relaxation labeling to find an approximate solution.