A graph edit distance based on node merging

被引：0
|
作者：
Berretti, S [1 ]
Del Bimbo, A [1 ]
Pala, P [1 ]
机构：
[1] Univ Florence, Dipartimento Sistemi & Informat, I-50139 Florence, Italy
来源：
IMAGE AND VIDEO RETRIEVAL, PROCEEDINGS | 2004年 / 3115卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper a novel solution is proposed for error tolerant graph matching. The solution belongs to the class of edit distance based techniques. In particular, the original edit distance based framework is extended so as to account for a new operator to support node merging during the matching process. An analysis of the computational complexity of the proposed solution is presented as well as some experimental results about its application to retrieval by content of color images.
引用
收藏
页码：464 / 472
页数：9
相关论文
共 50 条
  • [21] A comparative analysis of new graph distance measures and graph edit distance
    Li, Tao
    Dong, Han
    Shi, Yongtang
    Dehmer, Matthias
    INFORMATION SCIENCES, 2017, 403 : 15 - 21
  • [22] A parallel graph edit distance algorithm
    Abu-Aisheh, Zeina
    Raveaux, Romain
    Ramel, Jean-Yves
    Martineau, Patrick
    EXPERT SYSTEMS WITH APPLICATIONS, 2018, 94 : 41 - 57
  • [23] The Reeb Graph Edit Distance is Universal
    Bauer, Ulrich
    Landi, Claudia
    Memoli, Facundo
    FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2021, 21 (05) : 1441 - 1464
  • [24] Suboptimal Graph Edit Distance Based on Sorted Local Assignments
    Riesen, Kaspar
    Ferrer, Miquel
    Bunke, Horst
    MULTIPLE CLASSIFIER SYSTEMS (MCS 2015), 2015, 9132 : 147 - 156
  • [25] Edit distance based kernel functions for attributed graph matching
    Neuhaus, M
    Bunke, H
    GRAPH-BASED REPRESENTATIONS IN PATTERN RECOGNITION, PROCEEDINGS, 2005, 3434 : 352 - 361
  • [26] Graph Traversal Edit Distance and Extensions
    Ebrahimpour Boroojeny, Ali
    Shrestha, Akash
    Sharifi-Zarchi, Ali
    Gallagher, Suzanne Renick
    Sahinalp, S. Cenk
    Chitsaz, Hamidreza
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2020, 27 (03) : 317 - 329
  • [27] Edit distance from graph spectra
    Robles-Kelly, A
    Hancock, ER
    NINTH IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION, VOLS I AND II, PROCEEDINGS, 2003, : 234 - 241
  • [28] On the edit distance function of the random graph
    Martin, Ryan R.
    Riasanovsky, Alex W. N.
    COMBINATORICS PROBABILITY & COMPUTING, 2022, 31 (02): : 345 - 367
  • [29] Graph Edit Distance as a Quadratic Program
    Bougleux, Sebastien
    Gauzere, Benoit
    Brun, Luc
    2016 23RD INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR), 2016, : 1701 - 1706
  • [30] An Edit Distance Between Graph Correspondences
    Moreno-Garcia, Carlos Francisco
    Serratosa, Francesc
    Jiang, Xiaoyi
    GRAPH-BASED REPRESENTATIONS IN PATTERN RECOGNITION (GBRPR 2017), 2017, 10310 : 232 - 241
12345