Consistent multiple graph matching with multi-layer random walks synchronization

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 14
  • Download : 0
We address the correspondence search problem among multiple graphs with complex properties while considering the matching consistency. We describe each pair of graphs by combining multiple attributes, then jointly match them in a unified framework. The main contribution of this paper is twofold. First, we formulate the global correspondence search problem of multi-attributed graphs by utilizing a set of multi-layer structures. The proposed formulation describes each pair of graphs as a multi-layer structure, and jointly considers whole matching pairs. Second, we propose a robust multiple graph matching method based on the multi-layer random walks framework. The proposed framework synchronizes movements of random walkers, and leads them to consistent matching candidates. In our extensive experiments, the proposed method exhibits robust and accurate performance over the state-of-the-art multiple graph matching algorithms.
Publisher
ELSEVIER SCIENCE BV
Issue Date
2019-11
Language
English
Article Type
Article
Citation

PATTERN RECOGNITION LETTERS, v.127, pp.74 - 86

ISSN
0167-8655
DOI
10.1016/j.patrec.2018.09.018
URI
http://hdl.handle.net/10203/268449
Appears in Collection
ME-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0