中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页 机构 成果 学者
  
  1. CAS IR Grid
  2. 自动化研究所
  3. 中国科学院自动化研究所
  4. 多模态人工智能系统全国重点实验室
  5. 机器人应用与理论组
Graph matching based on fast normalized cut and multiplicative update mapping

文献类型：期刊论文

作者Yang, Jing1,2; Yang, Xu2,4,5; Zhou, Zhang-Bing1,3; Liu, Zhi-Yong2,4,5
刊名PATTERN RECOGNITION
出版日期2022-02-01
卷号122页码:11
关键词Graph matching Fast normalized cut Discrete constraint Multiplicative update
ISSN号0031-3203
DOI10.1016/j.patcog.2021.108228
通讯作者Yang, Xu(xu.yang@ia.ac.cn) ; Zhou, Zhang-Bing(zbzhou@cugb.edu.cn)
英文摘要Point correspondence is a fundamental problem in pattern recognition and computer vision, which can be tackled by graph matching. Since graph matching is basically an NP-complete problem, some approximate methods are proposed to solve it. Continuous relaxation offers an effective approximate method for graph matching problem. However, the discrete constraint is not taken into consideration in the optimization step. In this paper, a fast normalized cut based graph matching method is proposed, where the discrete constraint is introduced into the optimization step. Specifically, first a semidefinite positive affinity matrix based form objective function is constructed by introducing a regularization term which is related to the discrete constraint. Then the fast normalized cut algorithm is utilized to find the continuous solution. Last, the discrete solution of graph matching is obtained by a multiplicative update algorithm. Experiments on both synthetic points and real-world images validate the effectiveness of the proposed method by comparing it with the state-of-the-art methods. 0 2021 Elsevier Ltd. All rights reserved.
WOS关键词ALGORITHM ; OPTIMIZATION
资助项目National Key R&D Program of China[2020AAA0108902] ; National Natural Science Foundation (NSFC) of China[61973301] ; National Natural Science Foundation (NSFC) of China[61972020] ; National Natural Science Foundation (NSFC) of China[61633009] ; Beijing Science and Technology Plan Project[Z201100008320029] ; Strategic Priority Research Program of Chinese Academy of Science[XDB32050100]
WOS研究方向Computer Science ; Engineering
语种英语
WOS记录号WOS:000697675100005
出版者ELSEVIER SCI LTD
资助机构National Key R&D Program of China ; National Natural Science Foundation (NSFC) of China ; Beijing Science and Technology Plan Project ; Strategic Priority Research Program of Chinese Academy of Science
源URL[http://ir.ia.ac.cn/handle/173211/46043]  
专题自动化研究所_复杂系统管理与控制国家重点实验室_机器人应用与理论组
通讯作者Yang, Xu; Zhou, Zhang-Bing
作者单位1.China Univ Geosci Beijing, Sch Informat Engn, Beijing 100083, Peoples R China
2.Chinese Acad Sci, Inst Automat, State Key Lab Management & Control Complex Syst, Beijing 100190, Peoples R China
3.TELECOM SudParis, Comp Sci Dept, F-91011 Evry, France
4.Chinese Acad Sci, Ctr Excellence Brain Sci & Intelligence Technol, Shanghai 200031, Peoples R China
5.Univ Chinese Acad Sci, Beijing 100049, Peoples R China
推荐引用方式
GB/T 7714		 Yang, Jing,Yang, Xu,Zhou, Zhang-Bing,et al. Graph matching based on fast normalized cut and multiplicative update mapping[J]. PATTERN RECOGNITION,2022,122:11.
APA Yang, Jing,Yang, Xu,Zhou, Zhang-Bing,&Liu, Zhi-Yong.(2022).Graph matching based on fast normalized cut and multiplicative update mapping.PATTERN RECOGNITION,122,11.
MLA Yang, Jing,et al."Graph matching based on fast normalized cut and multiplicative update mapping".PATTERN RECOGNITION 122(2022):11.

入库方式： OAI收割

来源：自动化研究所

浏览0
下载0
收藏0
其他版本

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