Point correspondence by a new third order graph matching algorithm
Yang, Xu1; Qiao, Hong1,2,3; Liu, Zhi-Yong1,2,3
2017-05-01
发表期刊PATTERN RECOGNITION
卷号65期号:0页码:108-118
文章类型Article
摘要The correspondence between point sets is a fundamental problem in pattern recognition, which is often formulated and solved by graph matching. In this paper, we propose to solve the correspondence problem by a new third order graph matching algorithm. Compared with some previous hyper-graph matching algorithms, the proposed one achieves considerable memory reduction and is applicable to both undirected and directed graphs. Specifically, the correspondence is formulated by the matching between adjacency tensors encoding the third order structural information of each graph, which is then transformed to be a tractable matrix form. Two types of gradient based optimization methods, the graduated nonconvexity and concavity procedure (GNCCP) and graduated assignment (GA) algorithm, are generalized to solve the problem. Comparative experiments with state-of-the-art algorithms on both synthetic and real data witness the effectiveness of the proposed method.
关键词Graph Matching Point Correspondence High Order Constraints Adjacency Tensor
WOS标题词Science & Technology ; Technology
DOI10.1016/j.patcog.2016.12.006
关键词[WOS]RECOGNITION ; COMPUTATION
收录类别SCI
语种英语
项目资助者National Key Research and Development Plan of China(2016YFC0300801) ; National Natural Science Foundation (NSFC) of China(61503383 ; Strategic Priority Research Program of the Chinese Academy of Sciences(XDB02080003) ; 61633009 ; 61375005 ; U1613213 ; 61303174 ; 61210009 ; 61305137)
WOS研究方向Computer Science ; Engineering
WOS类目Computer Science, Artificial Intelligence ; Engineering, Electrical & Electronic
WOS记录号WOS:000394197700010
引用统计
被引频次:4[WOS]   [WOS记录]     [WOS相关记录]
文献类型期刊论文
条目标识符http://ir.ia.ac.cn/handle/173211/14134
专题复杂系统管理与控制国家重点实验室_机器人理论与应用
作者单位1.Chinese Acad Sci, Inst Automat, State Key Lab Management & Control Complex Syst, Beijing 100190, Peoples R China
2.Chinese Acad Sci, Ctr Excellence Brain Sci & Intelligence Technol, Shanghai 200031, Peoples R China
3.Univ Chinese Acad Sci, Beijing 100049, Peoples R China
推荐引用方式
GB/T 7714
Yang, Xu,Qiao, Hong,Liu, Zhi-Yong. Point correspondence by a new third order graph matching algorithm[J]. PATTERN RECOGNITION,2017,65(0):108-118.
APA Yang, Xu,Qiao, Hong,&Liu, Zhi-Yong.(2017).Point correspondence by a new third order graph matching algorithm.PATTERN RECOGNITION,65(0),108-118.
MLA Yang, Xu,et al."Point correspondence by a new third order graph matching algorithm".PATTERN RECOGNITION 65.0(2017):108-118.
条目包含的文件 下载所有文件
文件名称/大小 文献类型 版本类型 开放类型 使用许可
Point Correspondence(1539KB)期刊论文作者接受稿开放获取CC BY-NC-SA浏览 下载
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Yang, Xu]的文章
[Qiao, Hong]的文章
[Liu, Zhi-Yong]的文章
百度学术
百度学术中相似的文章
[Yang, Xu]的文章
[Qiao, Hong]的文章
[Liu, Zhi-Yong]的文章
必应学术
必应学术中相似的文章
[Yang, Xu]的文章
[Qiao, Hong]的文章
[Liu, Zhi-Yong]的文章
相关权益政策
暂无数据
收藏/分享
文件名: Point Correspondence By A New Third Order Graph Matching Algorithm.pdf
格式: Adobe PDF
所有评论 (0)
暂无评论
 

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