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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
H. G. Barrow and R. M. Burstall, Subgraph isomorphism, matching relational structures and maximal cliques, Inf. Proc. Letter, Vol. 4, pp. 83, 84, 1976.
M. Bartoli et al., Attributed tree homomorphism using association graphs, In ICPR, 2000.
I. M. Bomze, M. Pelillo, and V. Stix, Approximating the maximum weight clique using replicator dynamics, IEEE Trans. on Neural Networks, Vol. 11, 2000.
H. Bunke and A. Kandel, Mean and maximum common subgraph of two graphs, Pattern Recognition Letters, Vol. 21, pp. 163–168, 2000.
W. J. Christmas and J. Kittler, Structural matching in computer vision using probabilistic relaxation, PAMI, Vol. 17, pp. 749–764, 1995.
M. A. Eshera and K-S Fu, An image understanding system using attributed symbolic representation and inexact graph-matching, PAMI, Vol 8, pp. 604–618, 1986.
L. E. Gibbons et al., Continuous characterizations of the maximum clique problem, Math. Oper. Res., Vol. 22, pp. 754–768, 1997
B. B. Kimia, A. R. Tannenbaum, and S. W. Zucker, Shapes, shocks, and deforam-tions I, International Journal of Computer Vision, Vol. 15, pp. 189–224, 1995.
B. Luo, et al., Clustering shock trees, submitted 2001.
T. S. Motzkin and E. G. Straus, Maxima for graphs and a new proof of a theorem of Turán, Canadian Journal of Mathematics, Vol. 17, pp. 533–540, 1965.
M. Pelillo, Replicator equations, maximal cliques, and graph isomorphism, Neural Computation, Vol. 11, pp. 1935–1955, 1999.
M. Pelillo, The dynamics of relaxation labeling process, J. Math. Imaging Vision, Vol. 7, pp. 309–323, 1997.
A. Shokoufandeh, S. J. Dickinson, K. Siddiqi, and S. W. Zucker, Indexing using a spectral encoding of topological structure, In CVPR, 1999.
K. Siddiqi, S. Bouix, A. Tannenbaum, and S. W. Zucker, The hamilton-jacobi skeleton, In ICCV, pp. 828–834, 1999.
K. Siddiqi et al., Shock graphs and shape matching, Int. J. of Comp. Vision, Vol. 35, pp. 13–32, 1999.
K-C Tai, The tree-to-tree correction problem, J. of the ACM, Vol. 26, pp. 422–433, 1979.
A. Torsello and E.R. Hancock, A skeletal measure of 2D shape similarity, Int. Workshop on Visual Form, 2001.
W. H. Tsai and K. S. Fu, Error-correcting isomorphism of attributed relational graphs for pattern analysis, Sys., Man, and Cyber., Vol. 9, pp. 757–768, 1979.
J. T. L. Wang, K. Zhang, and G. Chirn, The approximate graph matching problem, In ICPR, pp. 284–288, 1994.
R. C. Wilson and E. R. Hancock, Structural matching by discrete relaxation, PAMI, 1997.
K. Zhang, A constrained edit distance between unordered labeled trees, Algorith-mica, Vol. 15, pp. 205–222, 1996.
K. Zhang and D. Shasha, Simple fast algorithms for the editing distance between trees and related problems, SIAM J. of Comp., Vol. 18, pp. 1245–1262, 1989.
K. Zhang, R. Statman, and D. Shasha, On the editing distance between unorderes labeled trees, Inf. Proc. Letters, Vol. 42, pp. 133–139, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Torsello, A., Hancock, E.R. (2001). Efficiently Computing Weighted Tree Edit Distance Using Relaxation Labeling. In: Figueiredo, M., Zerubia, J., Jain, A.K. (eds) Energy Minimization Methods in Computer Vision and Pattern Recognition. EMMCVPR 2001. Lecture Notes in Computer Science, vol 2134. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44745-8_29
Download citation
DOI: https://doi.org/10.1007/3-540-44745-8_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42523-6
Online ISBN: 978-3-540-44745-0
eBook Packages: Springer Book Archive