A New Model for Graph Matching and Its Algorithm

スポンサーリンク

概要

• 論文の詳細を見る

• Graph matching is a NP-Hard problem. In this paper, we relax the admissible set of permutation matrices and meantime incorporate a barrier function into the objective function. The resulted model is equivalent to the original model. Alternate iteration algorithm is designed to solve it. It is proven that the algorithm proposed is locally convergent. Our experimental results reveal that the proposed algorithm outperforms the algorithm in [1].

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

著者

• ZHENG Kai-Jie

  Institute for Information and System Sciences, Xian Jiaotong University

• PENG Ji-Gen

  Institute for Information and System Sciences, Xian Jiaotong University

• LI Ke-Xue

  Institute for Information and System Sciences, Xian Jiaotong University

• Peng Ji-gen

  Institute For Information And System Sciences Xi'an Jiaotong University

• Zheng Kai-jie

  Institute For Information And System Sciences Xi'an Jiaotong University

• Li Ke-xue

  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

スポンサーリンク