The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Padanan graf berwajaran adalah mencabar dari segi pengiraan kerana sifat gabungan set pilih atur. Dalam makalah ini, pendekatan kelonggaran baharu untuk pemadanan graf berwajaran dicadangkan, yang dengannya algoritma pemadanan baharu, dinamakan algoritma lelaran ganti, direka bentuk. Dibuktikan bahawa algoritma yang dicadangkan adalah konvergen tempatan. Eksperimen dibentangkan untuk menunjukkan keberkesanan algoritma yang dicadangkan.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Kai-Jie ZHENG, Ji-Gen PENG, Shi-Hui YING, "A New Approach to Weighted Graph Matching" in IEICE TRANSACTIONS on Information,
vol. E92-D, no. 8, pp. 1580-1583, August 2009, doi: 10.1587/transinf.E92.D.1580.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E92.D.1580/_p
Salinan
@ARTICLE{e92-d_8_1580,
author={Kai-Jie ZHENG, Ji-Gen PENG, Shi-Hui YING, },
journal={IEICE TRANSACTIONS on Information},
title={A New Approach to Weighted Graph Matching},
year={2009},
volume={E92-D},
number={8},
pages={1580-1583},
abstract={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.},
keywords={},
doi={10.1587/transinf.E92.D.1580},
ISSN={1745-1361},
month={August},}
Salinan
TY - JOUR
TI - A New Approach to Weighted Graph Matching
T2 - IEICE TRANSACTIONS on Information
SP - 1580
EP - 1583
AU - Kai-Jie ZHENG
AU - Ji-Gen PENG
AU - Shi-Hui YING
PY - 2009
DO - 10.1587/transinf.E92.D.1580
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E92-D
IS - 8
JA - IEICE TRANSACTIONS on Information
Y1 - August 2009
AB - 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.
ER -