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 条
  • [1] Tree edit distance from information theory
    Torsello, A
    Hancock, ER
    GRAPH BASED REPRESENTATIONS IN PATTERN RECOGNITION, PROCEEDINGS, 2003, 2726 : 71 - 82
  • [2] Error Tree: A Tree Structure for Hamming and Edit Distances and Wildcards Matching
    Al-Okaily, Anas
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2015, 22 (12) : 1118 - 1128
  • [3] Concept Dissimilarity Based on Tree Edit Distances and Morphological Dilations
    Distel, Felix
    Atif, Jamal
    Bloch, Isabelle
    21ST EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2014), 2014, 263 : 249 - +
  • [4] Learning the costs of edit operations for edit distances
    Weigel, A
    Agne, S
    SCIA '97 - PROCEEDINGS OF THE 10TH SCANDINAVIAN CONFERENCE ON IMAGE ANALYSIS, VOLS 1 AND 2, 1997, : 493 - 500
  • [5] Comparison of AESA and LAESA search algorithms using string and tree-edit-distances
    Rico-Juan, JR
    Micó, L
    PATTERN RECOGNITION LETTERS, 2003, 24 (9-10) : 1417 - 1426
  • [6] Comparison of tree architecture using tree edit distances: application to 2-year-old apple hybrids
    Vincent Segura
    Aïda Ouangraoua
    Pascal Ferraro
    Evelyne Costes
    Euphytica, 2008, 161 : 155 - 164
  • [7] Comparison of tree architecture using tree edit distances: application to 2-year-old apple hybrids
    Segura, Vincent
    Ouangraoua, Aida
    Ferraro, Pascal
    Costes, Evelyne
    EUPHYTICA, 2008, 161 (1-2) : 155 - 164
  • [8] From maximum common submaps to edit distances of generalized maps
    Combier, Camille
    Damiand, Guillaume
    Solnon, Christine
    PATTERN RECOGNITION LETTERS, 2012, 33 (15) : 2020 - 2028
  • [9] Some results about the use of tree/string edit distances in a nearest neighbour classification task
    Rico-Juan, JR
    Micó, L
    PATTERN RECOGNITION AND IMAGE ANALYSIS, PROCEEDINGS, 2003, 2652 : 821 - 828
  • [10] FAST COMPUTATION OF NORMALIZED EDIT DISTANCES
    VIDAL, E
    MARZAL, A
    AIBAR, P
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1995, 17 (09) : 899 - 902