Computing approximate tree edit distance using relaxation labeling

Pattern Recognition Letters

Volumn 24, Issue 8, 2003, Pages 1089-1097

  Torsello, Andrea ^a   Hancock, Edwin R ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

Edit distance; Shape recognition; Shock trees; Tree matching

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; PROBLEM SOLVING; TREES (MATHEMATICS);

RELAXATION LABELING;

PATTERN RECOGNITION;

PATTERN RECOGNITION;

EID: 0037408246     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(02)00255-6     Document Type: Article

References (16)

1. Barrow, H.G., Burstall, R.M., 1976. Subgraph isomorphism, matching relational structures and maximal cliques. Informat. Process. Lett. 4, 83-84.
2. Bomze, I.M., Pelillo, M., Stix, V., 2000. Approximating the maximum weight clique using replicator dynamics. IEEE Trans. Neural Networks 11.
3. Bunke, H., Kandel, A., 2000. Mean and maximum common subgraph of two graphs. Pattern Recognition Lett. 21, 163-168.
4. Eshera, M.A., Fu, K.-S., 1986. An image understanding system using attributed symbolic representation and inexact graphmatching. IEEE PAMI 8, 604-618.
5. Gibbons, L.E. et al., 1997. Continuous characterizations of the maximum clique problem. Math. Oper. Res. 22, 754-768.
6. Luo, B. et al., 2001. A probabilistic framework for graph clustering. CVPR, vol. 1. pp. 912-919.
7. Motzkin, T.S., Straus, E.G., 1965. Maxima for graphs and a new proof of a theorem of Turán. Can. J. Math. 17, 533-540.
8. Pelillo, M., 1997. The dynamics of relaxation labeling process. J. Math. Imaging Vis. 7, 309-323.
9. Pelillo, M., Siddiqi, K., Zucker, S.W., 1999. Matching hierarchical structures using association graphs. IEEE PAMI 21, 1105-1120.
10. Siddiqi, K., Shokoufandeh, A., Dickinson, S.J., Zucker, S.W., 1999. Shock graphs and shape matching. Internat. J. Comput. Vision 35, 13-32.
11. Tai, K.-C., 1979. The tree-to-tree correction problem. J. Assoc. Comput. Machinery 26, 422-433.
12. Tsai, W.H., Fu, K.S., 1979. Error-correcting isomorphism of attributed relational graphs for pattern analysis. Trans. System Man Cybernet. 9.
13. Wang, J.T.L., Zhang, K., Chirn, G., 1994. The approximate graph matching problem. ICPR. pp. 284-288.
14. Zhang, K., 1996. A constrained edit distance between unordered labeled trees. Algorithmica 15, 205-222.
15. Zhang, K., Shasha, D., 1989. Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput. 18, 1245-1262.
16. Zhang, K., Statman, R., Shasha, D., 1992. On the editing distance between unordered labeled trees. Informat. Process. Lett. 42, 133-139.