Kronecker Match Matrix Estimation Algorithms for Graph Matching

Abstract

In this paper, four novel algorithms for performing attributed graph matching are presented. All four algorithms are based on the Kronecker Product Graph Matching (KPGM) formulation. This new formulation incorporates a general approach to a wide class of graph matching problems based on attributed graphs, allowing the structure of the graphs to be based on… (More)

4 Figures and Tables

Topics

  • Presentations referencing similar topics