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 |
| 关键词 | Graph matching Combinatorial optimization Deterministic annealing Graduated optimization Feature correspondence |
| 通讯作者 | Zhi-Yong Liu |
| 英文摘要 | 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. |
| WOS标题词 | Science & Technology ; Technology |
| 类目[WOS] | Computer Science, Artificial Intelligence |
| 研究领域[WOS] | Computer Science |
| 关键词[WOS] | OPTIMIZATION ; RECOGNITION |
| 收录类别 | SCI |
| 语种 | 英语 |
| WOS记录号 | WOS:000340358600001 |
| 源URL | [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. |
入库方式： OAI收割
来源：自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。