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 条
  • [41] Branch Decomposition-Independent Edit Distances for Merge Trees
    Wetzels, Florian
    Leitte, Heike
    Garth, Christoph
    COMPUTER GRAPHICS FORUM, 2022, 41 (03) : 367 - 378
  • [42] Applications of single-operator edit distances for permuted sequences
    Uhlmann, Jeffrey
    PATTERN RECOGNITION LETTERS, 2018, 116 : 97 - 100
  • [43] Frequent Generalized Subgraph Mining via Graph Edit Distances
    Palme, Richard
    Welke, Pascal
    MACHINE LEARNING AND PRINCIPLES AND PRACTICE OF KNOWLEDGE DISCOVERY IN DATABASES, ECML PKDD 2022, PT II, 2023, 1753 : 477 - 483
  • [44] Edit distances with block movements and error rate confidence estimates
    Leusch, Gregor
    Ney, Hermann
    MACHINE TRANSLATION, 2009, 23 (2-3) : 129 - 140
  • [45] Homomorphic Fingerprints under Misalignments: Sketching Edit and Shift Distances
    Andoni, Alexandr
    Goldberger, Assaf
    McGregor, Andrew
    Porat, Ely
    STOC'13: PROCEEDINGS OF THE 2013 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2013, : 931 - 940
  • [46] From singularity theory to finiteness of Walrasian equilibria
    Castro, Sofia B. S. D.
    Dakhlia, Sami
    Gothen, Peter B.
    MATHEMATICAL SOCIAL SCIENCES, 2013, 66 (02) : 169 - 175
  • [47] Differential Geometry From a Singularity Theory Viewpoint
    Ilarslan, Kazim
    JOURNAL OF GEOMETRY AND SYMMETRY IN PHYSICS, 2016, 41 : 101 - 103
  • [48] An Optimal Decomposition Algorithm for Tree Edit Distance
    Demaine, Erik D.
    Mozes, Shay
    Rossman, Benjamin
    Weimann, Oren
    ACM TRANSACTIONS ON ALGORITHMS, 2009, 6 (01)
  • [49] A FLEXIBLE TREE DESIGN IN AN EDIT PARTITION SCHEME
    WANG, QR
    PATTERN RECOGNITION LETTERS, 1987, 5 (04) : 261 - 265
  • [50] Graph Edit Distance Compacted Search Tree
    Chegrane, Ibrahim
    Hocine, Imane
    Yahiaoui, Said
    Bendjoudi, Ahcene
    Nouali-Taboudjemat, Nadia
    SIMILARITY SEARCH AND APPLICATIONS (SISAP 2022), 2022, 13590 : 181 - 189