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
그래프 매칭은 NP-Hard 문제입니다. 본 논문에서는 허용되는 순열 행렬 세트를 완화하고 장벽 함수를 목적 함수에 통합합니다. 결과 모델은 원본 모델과 동일합니다. 이를 해결하기 위해 대체 반복 알고리즘이 설계되었습니다. 제안된 알고리즘은 국소적으로 수렴하는 것으로 입증되었습니다. 우리의 실험 결과는 제안된 알고리즘이 의 알고리즘보다 성능이 우수하다는 것을 보여줍니다.
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.
부
Kai-Jie ZHENG, Ji-Gen PENG, Ke-Xue LI, "A New Model for Graph Matching and Its Algorithm" in IEICE TRANSACTIONS on Information,
vol. E93-D, no. 5, pp. 1294-1296, May 2010, doi: 10.1587/transinf.E93.D.1294.
Abstract: 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 .
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E93.D.1294/_p
부
@ARTICLE{e93-d_5_1294,
author={Kai-Jie ZHENG, Ji-Gen PENG, Ke-Xue LI, },
journal={IEICE TRANSACTIONS on Information},
title={A New Model for Graph Matching and Its Algorithm},
year={2010},
volume={E93-D},
number={5},
pages={1294-1296},
abstract={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 .},
keywords={},
doi={10.1587/transinf.E93.D.1294},
ISSN={1745-1361},
month={May},}
부
TY - JOUR
TI - A New Model for Graph Matching and Its Algorithm
T2 - IEICE TRANSACTIONS on Information
SP - 1294
EP - 1296
AU - Kai-Jie ZHENG
AU - Ji-Gen PENG
AU - Ke-Xue LI
PY - 2010
DO - 10.1587/transinf.E93.D.1294
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E93-D
IS - 5
JA - IEICE TRANSACTIONS on Information
Y1 - May 2010
AB - 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 .
ER -