A New Model for Graph Matching and Its Algorithm
Summary :
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 .
- Publication
- IEICE TRANSACTIONS on Information Vol.E93-D No.5 pp.1294-1296
- Publication Date
- 2010/05/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E93.D.1294
- Type of Manuscript
- LETTER
- Category
- Fundamentals of Information Systems
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
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
Copy
@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},}
Copy
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 -
English
