A new relaxation model for weighted graph matching

被引：0
|
作者：
Zheng K.-J. [1 ,2 ]
Gao Y.-T. [1 ]
Peng J.-G. [1 ]
机构：
[1] Institute for Information and System Science, Xi'an Jiaotong University
[2] School of Mathematics and Computer Science, Fujian Normal University
来源：
Zidonghua Xuebao/Acta Automatica Sinica | 2010年 / 36卷 / 08期
关键词：
Graph matching; NP-hard problem; Permutation matrix; Relaxation method;
D O I：
10.3724/SP.J.1004.2010.01200
中图分类号：
学科分类号：
摘要：
Graph matching is an NP-hard problem. In this paper, we relax the admissible set of permutation matrices based on a well known result that permutation matrix is a non-negative orthogonal matrix. Meantime, a barrier function is incorporated into the objective function. In theory, the solution of the proposed model is the same as the original model, which distinguishes from the traditional relaxation matching models. The proposed model is a binary optimization problem which is a linear optimization problem on orthogonal variable and a quadratic convex optimization problem on non-negative variable. So, a new matching algorithm, named alternate iteration algorithm, is designed to solve it. It is proved that the proposed algorithm is locally convergent. The numerical experiments show that the proposed algorithm is more accurate than linear programming algorithm and eigen-decomposition algorithm. Copyright © Acta Automatica Sinica. All rights reserved.
引用
收藏
页码：1200 / 1203
页数：3
相关论文
共 15 条
  • [1] Ying S.-H., Peng J.-G., Zheng K.-J., Qiao H., Lie group method for data set registration problem with anisotropic scale deformation, Acta Automatica Sinica, 35, 7, pp. 867-874, (2009)
  • [2] Rangarajan A., Chui H., Mjolsness E., A relationship between spline-based deformable models and weighted graphs in non-rigid matching, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 897-910, (2001)
  • [3] Loiola E.M., de Abreu N.M., Boaventura-Netto P.O., Hahn P., Querido T., A survey for the quadratic assignment problem, European Journal of Operational Research, 176, 2, pp. 657-690, (2007)
  • [4] Chen Z.-P., Xu Z.-B., Computer Mathematics, (2001)
  • [5] Conte D., Foggia P., Sansone C., Vento M., Thirty years of graph matching in pattern recognition, International Journal of Pattern Recognition and Artificial Intelligence, 18, 3, pp. 265-298, (2004)
  • [6] Moe R., GRIBB: branch-and-bound methods on the internet, Proceedings of the 5th International Conference on Parallel Processing and Applied Mathematics, pp. 1020-1027, (2003)
  • [7] Umeyama S., An eigendecomposition approach to weighted graph matching problems, IEEE Transactions on Pattern Analysis and Machine Intelligence, 10, 5, pp. 695-703, (1988)
  • [8] Zhao G., Luo B., Tang J., Ma J., Using eigen-decomposition method for weighted graph matching, Proceedings of the 3rd International Conference on Intelligent Computing, pp. 1283-1294, (2007)
  • [9] Almohamad H.A., Duffuaa S.O., A linear programming approach for the weighted graph matching problem, IEEE Transactions on Pattern Analysis and Machine Intelligence, 15, 5, pp. 522-525, (1993)
  • [10] Papadimitriou C.H., Stciglitr K., Combinarorial Optimization Algorithms and Complexity, (1982)
12