A New Approach to Weighted Graph Matching

スポンサーリンク

概要

• 論文の詳細を見る

• Weighted graph matching is computationally challenging due to the combinatorial nature of the set of permutations. In this paper, a new relaxation approach to weighted graph matching is proposed, by which a new matching algorithm, named alternate iteration algorithm, is designed. It is proved that the algorithm proposed is locally convergent. Experiments are presented to show the effectiveness of the proposed algorithm.

• （社）電子情報通信学会の論文
• 2009-08-01

著者

• ZHENG Kai-Jie

  Institute for Information and System Sciences, Xian Jiaotong University

• Ying Shi-hui

  School Of Science Shanghai University

• PENG Ji-Gen

  School of Mathematics and Computer Science, Fujian Normal University

• Peng Ji‐gen

  Xi'an Jiaotong Univ. Xi'an Chn

• Zheng Kai‐jie

  Xi'an Jiaotong Univ. Xi'an Chn

• Zheng Kai-jie

  Institute For Information And System Sciences Xi'an Jiaotong University

• ZHENG Kai-Jie

  Institute for Information and System Science, Xi'an Jiaotong University

関連論文

• A New Model for Graph Matching and Its Algorithm
• A New Approach to Weighted Graph Matching
• A New Model for Graph Matching and Its Algorithm

スポンサーリンク