Tree edit distances from singularity theory

被引:0
|
作者
Olsen, OF [1 ]
机构
[1] IT Univ Copenhagen, DK-2300 Copenhagen, Denmark
来源
SCALE SPACE AND PDE METHODS IN COMPUTER VISION, PROCEEDINGS | 2005年 / 3459卷
关键词
IMAGES;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
An representation based on the singularity structure of the gradient magnitude over scale is used as the atoms in a space of images. This representation is summarized as a rooted tree. The generic transitions of the functional of the scale space images are analysed and listed for the scale parameter and one free parameter. A distance measure between images is deduced soly from these generic transistions. The singular transitions are translated into the language of the tree transitions such that one generic transition corresponds to one unit edit operation of the tree structure. The distance between two images is the size of the smallest set of edit operations necessary to transform the corresponding tree representations into each other.
引用
收藏
页码:316 / 326
页数:11
相关论文
共 50 条
  • [31] Parallel algorithms for fast computation of normalized edit distances
    Egecioglu, O
    Ibel, M
    EIGHTH IEEE SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 1996, : 496 - 503
  • [32] Using multiple edit distances to automatically grade outputs from machine translation systems
    Akiba, Y
    Imamura, K
    Sumita, E
    Nakaiwa, H
    Yamamoto, S
    Okuno, HG
    IEEE TRANSACTIONS ON AUDIO SPEECH AND LANGUAGE PROCESSING, 2006, 14 (02): : 393 - 402
  • [33] Learning stochastic tree edit distance
    Bernard, Marc
    Habrard, Amaury
    Sebban, Marc
    MACHINE LEARNING: ECML 2006, PROCEEDINGS, 2006, 4212 : 42 - 53
  • [34] ALIGNMENT OF TREES - AN ALTERNATIVE TO TREE EDIT
    JIANG, T
    WANG, LS
    ZHANG, KZ
    THEORETICAL COMPUTER SCIENCE, 1995, 143 (01) : 137 - 148
  • [35] A metric normalization of tree edit distance
    Yujian Li
    Zhang Chenguang
    Frontiers of Computer Science in China, 2011, 5 : 119 - 125
  • [36] Analysis of tree edit distance algorithms
    Dulucq, S
    Touzet, H
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2003, 2676 : 83 - 95
  • [37] A New Perspective on the Tree Edit Distance
    Schwarz, Stefan
    Pawlik, Mateusz
    Augsten, Nikolaus
    SIMILARITY SEARCH AND APPLICATIONS, SISAP 2017, 2017, 10609 : 156 - 170
  • [38] A metric normalization of tree edit distance
    Li, Yujian
    Zhang, Chenguang
    FRONTIERS OF COMPUTER SCIENCE IN CHINA, 2011, 5 (01): : 119 - 125
  • [39] Adversarial Edit Attacks for Tree Data
    Paassen, Benjamin
    INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING - IDEAL 2019, PT I, 2019, 11871 : 359 - 366
  • [40] Efficient Computation of the Tree Edit Distance
    Pawlik, Mateusz
    Augsten, Nikolaus
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2015, 40 (01):