AN EFFICIENT SYNTHESIS OF IMAGE MATCHING ALGORITHMS

被引：0
|
作者：
KOCIS, I
KIEM, H
KHOI, PN
机构：
[1] SLOVAK ACAD SCI, INST TECH CYBERNET, CS-84237 BRATISLAVA, CZECHOSLOVAKIA
[2] SLOVAK ACAD SCI, INST TECH CYBERNET, INT BASIC LAB ARTIFICIAL INTELLIGENCE, CS-84237 BRATISLAVA, CZECHOSLOVAKIA
来源：
COMPUTERS AND ARTIFICIAL INTELLIGENCE | 1986年 / 5卷 / 05期
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
引用
收藏
页码：443 / 450
页数：8
相关论文
共 50 条
  • [41] Seeded Graph Matching: Efficient Algorithms and Theoretical Guarantees
    Shirani, Farhad
    Garg, Siddharth
    Erkip, Elza
    2017 FIFTY-FIRST ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS, AND COMPUTERS, 2017, : 253 - 257
  • [42] EFFICIENT LABELING ALGORITHMS FOR THE MAXIMUM NONCROSSING MATCHING PROBLEM
    MALUCELLI, F
    OTTMANN, T
    PRETOLANI, D
    DISCRETE APPLIED MATHEMATICS, 1993, 47 (02) : 175 - 179
  • [43] Efficient approximation algorithms for the maximum weight matching problem
    Takafuji, D
    Taoka, S
    Watanabe, T
    2002 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL IV, PROCEEDINGS, 2002, : 457 - 460
  • [44] Efficient string matching algorithms for combinatorial universal denoising
    Chen, S
    Diggavi, S
    Dusad, S
    Muthukrishnan, S
    DCC 2005: Data Compression Conference, Proceedings, 2005, : 153 - 162
  • [45] Efficient algorithms for pattern matching on directed acyclic graphs
    Chen, L
    Gupta, A
    Kurul, ME
    ICDE 2005: 21ST INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS, 2005, : 384 - 385
  • [46] EFFICIENT ALGORITHMS FOR FINDING MAXIMUM MATCHING IN GRAPHS.
    Galil, Zvi
    Computing surveys, 1986, 18 (01): : 23 - 38
  • [47] Exploring efficient grouping algorithms in regular expression matching
    Xu, Chengcheng
    Su, Jinshu
    Chen, Shuhui
    PLOS ONE, 2018, 13 (10):
  • [48] Pattern Matching with Variables: Efficient Algorithms and Complexity Results
    Fernau, Henning
    Manea, Florin
    Mercas, Robert
    Schmid, Markus L.
    ACM TRANSACTIONS ON COMPUTATION THEORY, 2020, 12 (01)
  • [49] Flexible and Efficient Algorithms for Abelian Matching in Genome Sequence
    Faro, Simone
    Pavone, Arianna
    BIOINFORMATICS AND BIOMEDICAL ENGINEERING, IWBBIO 2019, PT I, 2019, 11465 : 307 - 318
  • [50] Efficient Algorithms for Variants of Weighted Matching and Assignment Problems
    Banerjee, Satyajit
    Chowdhury, Atish Datta
    Ghosh, Subhas Kumar
    MATHEMATICS IN COMPUTER SCIENCE, 2008, 1 (04) : 673 - 688
12345