中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页 机构 成果 学者
  
  1. CAS IR Grid
  2. 自动化研究所
  3. 中国科学院自动化研究所
  4. 多模态人工智能系统全国重点实验室
  5. 机器人应用与理论组
A graph matching algorithm based on concavely regularized convex relaxation

文献类型：期刊论文

作者Liu, Zhi-Yong1; Qiao, Hong1; Jia, Li-Hao1; Xu, Lei2
刊名NEUROCOMPUTING
出版日期2014-06-25
卷号134页码:140-148
关键词Graph matching Concave-convex procedure Concave regularization Frank-Wolfe algorithm Convex relaxation
英文摘要In this paper we propose a concavely regularized convex relaxation based graph matching algorithm. The graph matching problem is firstly formulated as a constrained convex quadratic program by relaxing the feasible set from the permutation matrices to doubly stochastic matrices. To gradually push the doubly stochastic matrix back to be a permutation one, an objective function is constructed by adding a simple weighted concave regularization to the convex relaxation. By gradually increasing the weight of the concave term, minimization of the objective function will gradually push the doubly stochastic matrix back to be a permutation one. A concave-convex procedure (CCCP) together with the Frank-Wolfe algorithm is adopted to minimize the objective function. The algorithm can be used on any types of graphs and exhibits a comparable performance as the PATH following algorithm, a state-of-the-art graph matching algorithm but applicable only on undirected graphs. (C) 2014 Elsevier B.V. All rights reserved.
WOS标题词Science & Technology ; Technology
类目[WOS]Computer Science, Artificial Intelligence
研究领域[WOS]Computer Science
关键词[WOS]SIMPLICIAL DECOMPOSITION ; REPRESENTATION ; RECOGNITION ; DISTANCE
收录类别SCI
语种英语
WOS记录号WOS:000335486000018
源URL[http://ir.ia.ac.cn/handle/173211/3038]  
专题自动化研究所_复杂系统管理与控制国家重点实验室_机器人应用与理论组
作者单位1.Chinese Acad Sci, Inst Automat, State Key Lab Management & Control Complex Syst, Beijing 100190, Peoples R China
2.Chinese Univ Hong Kong, Dept Comp Sci & Engn, Shatin, Hong Kong, Peoples R China
推荐引用方式
GB/T 7714		 Liu, Zhi-Yong,Qiao, Hong,Jia, Li-Hao,et al. A graph matching algorithm based on concavely regularized convex relaxation[J]. NEUROCOMPUTING,2014,134:140-148.
APA Liu, Zhi-Yong,Qiao, Hong,Jia, Li-Hao,&Xu, Lei.(2014).A graph matching algorithm based on concavely regularized convex relaxation.NEUROCOMPUTING,134,140-148.
MLA Liu, Zhi-Yong,et al."A graph matching algorithm based on concavely regularized convex relaxation".NEUROCOMPUTING 134(2014):140-148.

入库方式： OAI收割

来源：自动化研究所

浏览0
下载0
收藏0
其他版本

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。