A weight regularized relaxation based graph matching algorithm

CASIA OpenIR > 多模态人工智能系统全国重点实验室 > 机器人理论与应用

	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.