Graph matching with hierarchical discrete relaxation

被引：0
|
作者：
Wilson, RC [1 ]
Hancock, ER [1 ]
机构：
[1] Univ York, Dept Comp Sci, York YO1 5DD, N Yorkshire, England
来源：
ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 10 | 1998年 / 10卷
关键词：
D O I：
暂无
中图分类号：
B84 [心理学]; C [社会科学总论]; Q98 [人类学];
学科分类号：
03 ; 0303 ; 030303 ; 04 ; 0402 ;
摘要：
Our aim in this paper is to develop a Bayesian framework for matching hierarchical relational models. The goal is to make discrete label assignments so as to optimise a global cost function that draws information concerning the consistency of match from different levels of the hierarchy. Our Bayesian development naturally distinguishes between intra-level and inter-level constraints. This allows the impact of reassigning a match to be assessed not only at its own (or peer) level of representation, but also upon its parents and children in the hierarchy.
引用
收藏
页码：689 / 695
页数：7
相关论文
共 50 条
  • [41] Effective social graph visualization techniques using friend and hierarchical matching
    Lee, Manjai
    On, Byung-Won
    INTELLIGENT DATA ANALYSIS, 2016, 20 (02) : 417 - 438
  • [42] Matching road network combining hierarchical strokes and probabilistic relaxation method
    Zuo, Zejun, 1600, Bentham Science Publishers B.V., P.O. Box 294, Bussum, 1400 AG, Netherlands (06):
  • [43] On Scene Matching for UAV Based on Spectral Graph and Relaxation Iteration Method
    Xue Yaxin
    2013 32ND CHINESE CONTROL CONFERENCE (CCC), 2013, : 3933 - 3937
  • [44] Discrete particle swarm optimization for high-order graph matching
    Gong, Maoguo
    Wu, Yue
    Cai, Qing
    Ma, Wenping
    Qin, A. K.
    Wang, Zhenkun
    Jiao, Licheng
    INFORMATION SCIENCES, 2016, 328 : 158 - 171
  • [45] Discrete Cycle-Consistency Based Unsupervised Deep Graph Matching
    Tourani, Siddharth
    Khan, Muhammad Haris
    Rother, Carsten
    Savchynskyy, Bogdan
    THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 6, 2024, : 5252 - 5260
  • [46] Graph matching using the interference of discrete-time quantum walks
    Emms, David
    Wilson, Richard C.
    Hancock, Edwin R.
    IMAGE AND VISION COMPUTING, 2009, 27 (07) : 934 - 949
  • [47] Incorporating Discrete Constraints Into Random Walk-Based Graph Matching
    Yang, Xu
    Liu, Zhi-Yong
    Qiao, Hong
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2020, 50 (04): : 1406 - 1416
  • [48] An Accurate Matching Query Method of Natural Language Knowledge Graph Based on Hierarchical Graph Topological Sequence
    Zou, Qifeng
    Lu, Chaoze
    IEEE ACCESS, 2022, 10 : 24080 - 24094
  • [49] Hierarchical Graph Neural Network: A Lightweight Image Matching Model with Enhanced Message Passing of Local and Global Information in Hierarchical Graph Neural Networks
    Gyamfi, Enoch Opanin
    Qin, Zhiguang
    Danso, Juliana Mantebea
    Adu-Gyamfi, Daniel
    INFORMATION, 2024, 15 (10)
  • [50] Watershed from Propagated Markers based on Morphological Hierarchical Segmentation and Graph Matching
    Ortoncelli, Andre Roberto
    Flores, Franklin Cesar
    PROCEEDINGS OF THE 2014 9TH INTERNATIONAL CONFERENCE ON COMPUTER VISION THEORY AND APPLICATIONS (VISAPP), VOL 1, 2014, : 320 - 328
12345