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 条
  • [21] Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes
    Aratsu, Taku
    Hirata, Kouichi
    Kuboyama, Tetsuji
    SOFSEM 2009-THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2009, 5404 : 93 - +
  • [22] LOWER BOUNDING EDIT DISTANCES BETWEEN PERMUTATIONS
    Labarre, Anthony
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (03) : 1410 - 1428
  • [23] Tree edit distance with gaps
    Touzet, H
    INFORMATION PROCESSING LETTERS, 2003, 85 (03) : 123 - 129
  • [24] Approximating tree edit distance through string edit distance
    Akutsu, Tatsuya
    Fukagawa, Daiji
    Takasu, Atsuhiro
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2006, 4288 : 90 - +
  • [25] Approximating Tree Edit Distance through String Edit Distance
    Akutsu, Tatsuya
    Fukagawa, Daiji
    Takasu, Atsuhiro
    ALGORITHMICA, 2010, 57 (02) : 325 - 348
  • [26] Approximating Tree Edit Distance through String Edit Distance
    Tatsuya Akutsu
    Daiji Fukagawa
    Atsuhiro Takasu
    Algorithmica, 2010, 57 : 325 - 348
  • [27] Weighted automata computation of edit distances with consolidations and fragmentations
    Giraud, Mathieu
    Jacquemard, Florent
    INFORMATION AND COMPUTATION, 2022, 282
  • [28] Beyond edit distances: Comparing linguistic reconstruction systems
    List, Johann-Mattis
    THEORETICAL LINGUISTICS, 2019, 45 (3-4) : 247 - 258
  • [29] Period recovery of strings over the Hamming and edit distances
    Amir, Amihood
    Amit, Mika
    Landau, Gad M.
    Sokol, Dina
    THEORETICAL COMPUTER SCIENCE, 2018, 710 : 2 - 18