Graph Matching by Simplified Convex-Concave Relaxation Procedure

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

	Graph Matching by Simplified Convex-Concave Relaxation Procedure
	Liu, Zhi-Yong1 ; Qiao, Hong1 ; Yang, Xu1 ; Hoi, Steven C. H.2; Zhi-Yong Liu
发表期刊	INTERNATIONAL JOURNAL OF COMPUTER VISION
	2014-09-01
卷号	109 期号:3 页码:169-186
文章类型	Article
摘要	The convex and concave relaxation procedure (CCRP) was recently proposed and exhibited state-of-the-art performance on the graph matching problem. However, CCRP involves explicitly both convex and concave relaxations which typically are difficult to find, and thus greatly limit its practical applications. In this paper we propose a simplified CCRP scheme, which can be proved to realize exactly CCRP, but with a much simpler formulation without needing the concave relaxation in an explicit way, thus significantly simplifying the process of developing CCRP algorithms. The simplified CCRP can be generally applied to any optimizations over the partial permutation matrix, as long as the convex relaxation can be found. Based on two convex relaxations, we obtain two graph matching algorithms defined on adjacency matrix and affinity matrix, respectively. Extensive experimental results witness the simplicity as well as state-of-the-art performance of the two simplified CCRP graph matching algorithms.
关键词	Graph Matching Combinatorial Optimization Deterministic Annealing Graduated Optimization Feature Correspondence
WOS标题词	Science & Technology ; Technology
关键词[WOS]	OPTIMIZATION ; RECOGNITION
收录类别	SCI
语种	英语
WOS研究方向	Computer Science
WOS类目	Computer Science, Artificial Intelligence
WOS记录号	WOS:000340358600001
引用统计	被引频次：44[WOS] [WOS记录] [WOS相关记录]
文献类型	期刊论文
条目标识符	http://ir.ia.ac.cn/handle/173211/3035
专题	多模态人工智能系统全国重点实验室_机器人理论与应用
通讯作者	Zhi-Yong Liu
作者单位	1.Chinese Acad Sci, Inst Automat, State Key Lab Management & Control Complex Syst, Beijing, Peoples R China 2.Nanyang Technol Univ, Sch Comp Engn, Singapore 639798, Singapore
第一作者单位	中国科学院自动化研究所
推荐引用方式 GB/T 7714	Liu, Zhi-Yong,Qiao, Hong,Yang, Xu,et al. Graph Matching by Simplified Convex-Concave Relaxation Procedure[J]. INTERNATIONAL JOURNAL OF COMPUTER VISION,2014,109(3):169-186.
APA	Liu, Zhi-Yong,Qiao, Hong,Yang, Xu,Hoi, Steven C. H.,&Zhi-Yong Liu.(2014).Graph Matching by Simplified Convex-Concave Relaxation Procedure.INTERNATIONAL JOURNAL OF COMPUTER VISION,109(3),169-186.
MLA	Liu, Zhi-Yong,et al."Graph Matching by Simplified Convex-Concave Relaxation Procedure".INTERNATIONAL JOURNAL OF COMPUTER VISION 109.3(2014):169-186.

条目包含的文件		下载所有文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
Graph Matching by Si（1584KB）	期刊论文	作者接受稿	开放获取	CC BY-NC-SA	浏览下载