A weight regularized relaxation based graph matching algorithm
Liu, Zhi-Yong; Qiao, Hong; Xu, Lei
2012
会议名称2nd Sino-Foreign-Interchange Workshop on Intelligence Science and Intelligent Data Engineering (IScIDE)
会议录名称2nd Sino-Foreign-Interchange Workshop on Intelligence Science and Intelligent Data Engineering (IScIDE)
会议日期OCT 23-25, 2011
会议地点Xian, PEOPLES R CHINA
摘要In this paper we propose a regularized relaxation based graph matching algorithm. The graph matching problem is formulated as a constrained convex quadratic program, by relaxing the permutation matrix to a doubly stochastic one. To gradually push the doubly stochastic matrix back to a permutation one, a simple weighted concave regular term is added to the convex objective function. The concave regular function is not a concave relaxation of the original matching problem. However, it is shown that such a simple concave regular term has a comparative performance as the concave relaxation of the PATH following algorithm, which works only on undirected graphs. A concave-convex procedure (CCCP) together with the Frank-Wolfe algorithm is adopted to solve the matching problem, and some experimental results witness the state-of-art performance of the proposed algorithm.
关键词Graph Matching Cccp Frank-wolfe Algorithm Convex Relaxation
文献类型会议论文
条目标识符http://ir.ia.ac.cn/handle/173211/12808
专题复杂系统管理与控制国家重点实验室_机器人理论与应用
通讯作者Liu, Zhi-Yong
作者单位Chinese Acad Sci, Inst Automat, State Key Lab Management & Control Complex Syst,
推荐引用方式
GB/T 7714
Liu, Zhi-Yong,Qiao, Hong,Xu, Lei. A weight regularized relaxation based graph matching algorithm[C],2012.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Liu, Zhi-Yong]的文章
[Qiao, Hong]的文章
[Xu, Lei]的文章
百度学术
百度学术中相似的文章
[Liu, Zhi-Yong]的文章
[Qiao, Hong]的文章
[Xu, Lei]的文章
必应学术
必应学术中相似的文章
[Liu, Zhi-Yong]的文章
[Qiao, Hong]的文章
[Xu, Lei]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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