Incorporating Discrete Constraints Into Random Walk-Based Graph Matching
Yang X(杨旭)
2017
发表期刊RANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS
期号0页码:0
摘要
Graph matching is a fundamental problem in theoretical computer science and artificial intelligence, and lays the foundation for many computer vision and machine learning
tasks. Approximate algorithms are necessary for graph matching due to its NP-complete nature. Inspired by the usage in network-related tasks, random walk is generalized to graph matching as a type of approximate algorithm. However, it may be inappropriate for the previous random walk-based graph matching algorithms to utilize continuous techniques without considering the discrete property. In this paper, we propose a novel
random walk-based graph matching algorithm by incorporating both continuous and discrete constraints in the optimization process. Specifically, after interpreting graph matching by random walk, the continuous constraints are directly embedded in the random walk constraint in each iteration. Further, both the assignment matrix (vector) and the pairwise similarity measure between graphs are iteratively updated according the discrete
constraints, which automatically leads the continuous solution
to the discrete domain. Comparisons on both synthetic and
real-world data demonstrate the effectiveness of the proposed
algorithm.
关键词Graph Matching
文献类型期刊论文
条目标识符http://ir.ia.ac.cn/handle/173211/15485
专题复杂系统管理与控制国家重点实验室_机器人理论与应用
推荐引用方式
GB/T 7714
Yang X. Incorporating Discrete Constraints Into Random Walk-Based Graph Matching[J]. RANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS,2017(0):0.
APA Yang X.(2017).Incorporating Discrete Constraints Into Random Walk-Based Graph Matching.RANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS(0),0.
MLA Yang X."Incorporating Discrete Constraints Into Random Walk-Based Graph Matching".RANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS .0(2017):0.
条目包含的文件 下载所有文件
文件名称/大小 文献类型 版本类型 开放类型 使用许可
Incorporating Discre(2006KB)期刊论文作者接受稿开放获取CC BY-NC-SA浏览 下载
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Yang X(杨旭)]的文章
百度学术
百度学术中相似的文章
[Yang X(杨旭)]的文章
必应学术
必应学术中相似的文章
[Yang X(杨旭)]的文章
相关权益政策
暂无数据
收藏/分享
文件名: Incorporating Discrete Constraints Into Random Walk-Based Graph Matching.pdf
格式: Adobe PDF
所有评论 (0)
暂无评论
 

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