Feature Matching via Topology-Aware Graph Interaction Model

计算机科学 离群值 成对比较 匹配(统计) 图形 算法 理论计算机科学 拓扑(电路) 特征(语言学) 模式识别(心理学) 人工智能 数据挖掘 数学 语言学 统计 哲学 组合数学
作者
Yifan Lu,Jiayi Ma,Xiaoguang Mei,Jun Huang,Xiao-Ping Zhang
出处
期刊:IEEE/CAA Journal of Automatica Sinica [Institute of Electrical and Electronics Engineers]
卷期号:11 (1): 113-130
标识
DOI:10.1109/jas.2023.123774
摘要

Feature matching plays a key role in computer vision. However, due to the limitations of the descriptors, the putative matches are inevitably contaminated by massive outliers. This paper attempts to tackle the outlier filtering problem from two aspects. First, a robust and efficient graph interaction model, is proposed, with the assumption that matches are correlated with each other rather than independently distributed. To this end, we construct a graph based on the local relationships of matches and formulate the outlier filtering task as a binary labeling energy minimization problem, where the pairwise term encodes the interaction between matches. We further show that this formulation can be solved globally by graph cut algorithm. Our new formulation always improves the performance of previous locality-based method without noticeable deterioration in processing time, adding a few milliseconds. Second, to construct a better graph structure, a robust and geometrically meaningful topology-aware relationship is developed to capture the topology relationship between matches. The two components in sum lead to topology interaction matching (TIM), an effective and efficient method for outlier filtering. Extensive experiments on several large and diverse datasets for multiple vision tasks including general feature matching, as well as relative pose estimation, homography and fundamental matrix estimation, loop-closure detection, and multi-modal image matching, demonstrate that our TIM is more competitive than current state-of-the-art methods, in terms of generality, efficiency, and effectiveness. The source code is publicly available at http://github.com/YifanLu2000/TIM.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
苹果王子6699完成签到 ,获得积分10
1秒前
Niyuw发布了新的文献求助10
1秒前
Xiaoxiao发布了新的文献求助20
3秒前
醉熏的鑫发布了新的文献求助10
4秒前
迅速海云完成签到,获得积分10
4秒前
4秒前
栗子的小母牛完成签到,获得积分10
5秒前
dh完成签到,获得积分10
8秒前
岩墩墩完成签到,获得积分10
9秒前
克姑美完成签到 ,获得积分10
12秒前
pangao完成签到,获得积分10
12秒前
ysssbq完成签到,获得积分10
14秒前
15秒前
上好佳完成签到 ,获得积分10
15秒前
大模型应助Yeong采纳,获得10
16秒前
量子星尘发布了新的文献求助30
16秒前
17秒前
123完成签到,获得积分10
17秒前
谢陈完成签到 ,获得积分10
18秒前
lilili完成签到,获得积分10
19秒前
20秒前
xiaoying发布了新的文献求助10
20秒前
SciGPT应助Eric_Liuzy采纳,获得10
21秒前
liu完成签到 ,获得积分10
21秒前
qixiaoqi发布了新的文献求助10
22秒前
23秒前
A溶大美噶发布了新的文献求助10
23秒前
24秒前
24秒前
25秒前
26秒前
27秒前
kevin发布了新的文献求助10
27秒前
满意的初南完成签到 ,获得积分10
28秒前
橙橙橙发布了新的文献求助10
28秒前
万能图书馆应助EVEN采纳,获得10
28秒前
28秒前
Yeong发布了新的文献求助10
29秒前
范先生发布了新的文献求助10
30秒前
disciple完成签到,获得积分10
31秒前
高分求助中
【提示信息,请勿应助】关于scihub 10000
Les Mantodea de Guyane: Insecta, Polyneoptera [The Mantids of French Guiana] 3000
徐淮辽南地区新元古代叠层石及生物地层 3000
The Mother of All Tableaux: Order, Equivalence, and Geometry in the Large-scale Structure of Optimality Theory 3000
Global Eyelash Assessment scale (GEA) 1000
Picture Books with Same-sex Parented Families: Unintentional Censorship 550
Research on Disturbance Rejection Control Algorithm for Aerial Operation Robots 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 4038569
求助须知:如何正确求助?哪些是违规求助? 3576279
关于积分的说明 11374944
捐赠科研通 3305979
什么是DOI,文献DOI怎么找? 1819354
邀请新用户注册赠送积分活动 892698
科研通“疑难数据库(出版商)”最低求助积分说明 815048