Complexity of computing distances between geometric trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7626 LNCS, Issue , 2012, Pages 89-97

  Feragen, Aasa ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTING DISTANCES; DISTANCE MEASURE; EDGE GEOMETRY; EDGE LENGTH; EDIT DISTANCE; GEOMETRIC INFORMATION; LABEL SETS; MACHINE LEARNING METHODS; NP COMPLETE; NP-COMPLETENESS; PHYLOGENETIC TREES; SKELETAL TREES; STANDARD DISTANCE; TREE EDIT DISTANCE; UNORDERED TREES; VECTOR VALUED;

BLOOD VESSELS; HIERARCHICAL SYSTEMS; LEARNING SYSTEMS; PATTERN RECOGNITION; SYNTACTICS;

GEOMETRY;

EID: 84868147170     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-34166-3_10     Document Type: Conference Paper

References (22)

1. Bille, P.: A survey on tree edit distance and related problems. Theor. Comput. Sci. 337(1-3), 217-239 (2005)
2. Bridson, M.R., Haefliger, A.: Metric spaces of non-positive curvature. Springer (1999)
3. Demaine, E.D., Mozes, S., Rossman, B., Weimann, O.: An optimal decomposition algorithm for tree edit distance. ACM Trans. Algorithms 6, 2:1-2:19 (2009)
4. Demirci, F., Shokoufandeh, A., Dickinson, S.J.: Skeletal shape abstraction from examples. TPAMI 31(5), 944-952 (2009)
5. Demirci, M., Platel, B., Shokoufandeh, A., Florack, L., Dickinson, S.: The representation and matching of images using top points. JMIV 35, 103-116 (2009)
6. Feragen, A., Hauberg, S., Nielsen, M., Lauze, F.: Means in spaces of tree-like shapes. In: ICCV (2011)
7. Feragen, A., Lauze, F., Lo, P., de Bruijne, M., Nielsen, M.: Geometries on Spaces of Treelike Shapes. In: Kimmel, R., Klette, R., Sugimoto, A. (eds.) ACCV 2010, Part II. LNCS, vol. 6493, pp. 160-173. Springer, Heidelberg (2011)
8. Garey, M.J., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman (1979)
9. Klein, P., Tirthapura, S., Sharvit, D., Kimia, B.: A tree-edit-distance algorithm for comparing simple, closed shapes. In: SODA, pp. 696-704 (2000)
10. Klein, P.N., Sebastian, T.B., Kimia, B.B.: Shape matching using edit-distance: an implementation. In: SODA, pp. 781-790 (2001)
11. Klein, P.N.: Computing the Edit-Distance between Unrooted Ordered Trees. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, p. 91. Springer, Heidelberg (1998)
12. Matou?sek, J., Thomas, R.: On the complexity of finding iso-and other morphisms for partial k-trees. Discrete Mathematics 108(1-3), 343-364 (1992)
13. Metzen, J.H., Kroger, T., Schenk, A., Zidowitz, S., Peitgen, H.-O., Jiang, X.: Matching of anatomical tree structures for registration of medical images. Im. Vis. Comp. 27, 923-933 (2009)
14. Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Im. Vis. Comp. 27(7), 950-959 (2009)
15. Sebastian, T.B., Klein, P.N., Kimia, B.B.: Recognition of shapes by editing their shock graphs. TPAMI 26(5), 550-571 (2004)
16. Tai, K.-C.: The tree-to-tree correction problem. J. ACM 26, 422-433 (1979)
17. Torsello, A., Robles-Kelly, A., Hancock, E.R.: Discovering shape classes using tree edit-distance and pairwise clustering. IJCV 72(3), 259-285 (2007)
18. Touzet, H.: A Linear Tree Edit Distance Algorithm for Similar Ordered Trees. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol. 3537, pp. 334-345. Springer, Heidelberg (2005)
19. Trinh, N., Kimia, B.: Skeleton search: Category-specific object recognition and segmentation using a skeletal shape model. IJCV, 1-26 (2011)
20. Tschirren, J., McLennan, G., Palagyi, K., Hoffman, E.A., Sonka, M.: Matching and anatomical labeling of human airway tree. TMI 24(12), 1540-1547 (2005)
21. Weibel, E.R.: What makes a good lung? Swiss Med. Weekly 139(27-28), 375-386 (2009)
22. Zhang, K., Statman, R., Shasha, D.: On the editing distance between unordered labeled trees. Inf. Process. Lett. 42(3), 133-139 (1992)