Graph edit distance with node splitting and merging, and its application to diatom identification

被引：0
|
作者：
Ambauen, R [1 ]
Fischer, S [1 ]
Bunke, H [1 ]
机构：
[1] Univ Bern, Dept Comp Sci, CH-3012 Bern, Switzerland
来源：
GRAPH BASED REPRESENTATIONS IN PATTERN RECOGNITION, PROCEEDINGS | 2003年 / 2726卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
A new graph matching scheme based on an extended set of edit operations, which include the splitting and merging of nodes, is proposed in this paper. This scheme is useful in applications where the nodes of the considered graphs represent regions extracted by some segmentation procedure from an image. To demonstrate the feasibility of the proposed method, its application to the automatic identification of diatoms (unicellular algae) is described.
引用
收藏
页码：95 / 106
页数：12
相关论文
共 45 条
  • [1] A graph edit distance based on node merging
    Berretti, S
    Del Bimbo, A
    Pala, P
    IMAGE AND VIDEO RETRIEVAL, PROCEEDINGS, 2004, 3115 : 464 - 472
  • [2] Graph node matching for edit distance
    Moscatelli, Aldo
    Piquenot, Jason
    Berar, Maxime
    Heroux, Pierre
    Adam, Sebastien
    PATTERN RECOGNITION LETTERS, 2024, 184 : 14 - 20
  • [3] Embedding the node-to-node mappings to learn the Graph edit distance parameters
    Algabli, Shaima
    Serratosa, Francesc
    PATTERN RECOGNITION LETTERS, 2018, 112 : 353 - 360
  • [4] NED: An Inter-Graph Node Metric Based On Edit Distance
    Zhu, Haohan
    Meng, Xianrui
    Kollios, George
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2017, 10 (06): : 697 - 708
  • [5] Travel-Activity Patterns Identification Using Graph Edit Distance
    Tran, Yen
    Hashimoto, Naohisa
    Ando, Takafumi
    Sato, Toshihisa
    Miura, Takahiro
    IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC, 2023, : 160 - 167
  • [6] Travel-Activity Patterns Identification Using Graph Edit Distance
    Tran, Yen
    Hashimoto, Naohisa
    Ando, Takafumi
    Sato, Toshihisa
    Miura, Takahiro
    2023 IEEE 26TH INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS, ITSC, 2023, : 160 - 167
  • [7] PyGTED: Python']Python Application for Computing Graph Traversal Edit Distance
    Boroojeny, Ali Ebrahimpour
    Shrestha, Akash
    Sharifi-zarchi, Ali
    Gallagher, Suzanne Renick
    Sahinalp, Suleyman Cenk
    Chitsaz, Hamidreza
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2020, 27 (03) : 436 - 439
  • [8] Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants
    Qiu, Yutong
    Shen, Yihang
    Kingsford, Carl
    ALGORITHMS FOR MOLECULAR BIOLOGY, 2024, 19 (01)
  • [9] MATA*: Combining Learnable Node Matching with A* Algorithm for Approximate Graph Edit Distance Computation
    Liu, Junfeng
    Zhou, Min
    Ma, Shuai
    Pan, Lujia
    PROCEEDINGS OF THE 32ND ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, CIKM 2023, 2023, : 1503 - 1512
  • [10] A Deep Neural Network Architecture to Estimate Node Assignment Costs for the Graph Edit Distance
    Cortes, Xavier
    Conte, Donatello
    Cardot, Hubert
    Serratosa, Francesc
    STRUCTURAL, SYNTACTIC, AND STATISTICAL PATTERN RECOGNITION, S+SSPR 2018, 2018, 11004 : 326 - 336
12345