Extended Neighborhood Consensus With Affine Correspondence for Outlier Filtering in Feature Matching

被引:2
作者
Shen, Liang [1 ]
Zhang, Yani [1 ]
Chen, Cheng [1 ]
Wang, Letian [1 ]
Zhu, Jiahua [2 ]
He, Yi [1 ]
机构
[1] Natl Univ Def Technol, Test Ctr, Xian 710106, Peoples R China
[2] Natl Univ Def Technol, Coll Meteorol & Oceanol, Changsha 410000, Peoples R China
来源
IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING | 2024年 / 62卷
关键词
Feature extraction; Artificial neural networks; Task analysis; Remote sensing; Robustness; Location awareness; Vectors; Image matching; image registration; image stitching; SENSING IMAGE REGISTRATION; MOTION STATISTICS; ROBUST; FRAMEWORK; LOCALITY; SCALE;
D O I
10.1109/TGRS.2024.3388580
中图分类号
P3 [地球物理学]; P59 [地球化学];
学科分类号
0708 ; 070902 ;
摘要
Verifying the neighborhood consensus to remove false correspondence is a popular idea in feature matching. However, traditional neighborhood consensus only considers spatial neighborhoods (SNs), which is not robust in challenging remote sensing tasks. This article extends the traditional neighborhood consensus for improving robustness to the two key issues-significant geometric transformation and repetitive patterns. First, we introduce a novel matching neighborhood (MN) that extends the one-to-one correspondence in traditional neighborhood consensus to one-to-multiple structure to address the repetitive patterns, where one-to-multiple means that multiple matching candidates are preserved in calculating descriptor similarity. Second, the traditional SN is also extended using affine correspondence, which can adaptively address the significant geometric transformations without multiscale processing. On the two bases, we construct a novel extended neighborhood (EN) by combining the extended SN with the MN. Consequently, the false feature correspondences are filtered by measuring the consensus between the ENs. Numerous experiments demonstrate that the proposed method is state-of-the-art (SOTA) in comparison with recent learning and traditional methods, especially for the UAV localization task. We also show that the proposed method is robust to the basic settings, such as the prefiltering threshold and the type of local features.
引用
收藏
页码:1 / 15
页数:15
相关论文
共 85 条
[1]   Fast Explicit Diffusion for Accelerated Features in Nonlinear Scale Spaces [J].
Alcantarilla, Pablo F. ;
Nuevo, Jesus ;
Bartoli, Adrien .
PROCEEDINGS OF THE BRITISH MACHINE VISION CONFERENCE 2013, 2013,
[2]   KAZE Features [J].
Alcantarilla, Pablo Fernandez ;
Bartoli, Adrien ;
Davison, Andrew J. .
COMPUTER VISION - ECCV 2012, PT VI, 2012, 7577 :214-227
[3]   Making Affine Correspondences Work in Camera Geometry Computation [J].
Barath, Daniel ;
Polic, Michal ;
Foestner, Wolfgang ;
Sattler, Torsten ;
Pajdla, Tomas ;
Kukelova, Zuzana .
COMPUTER VISION - ECCV 2020, PT XI, 2020, 12356 :723-740
[4]   MAGSAC: Marginalizing Sample Consensus [J].
Barath, Daniel ;
Matas, Jiri ;
Noskova, Jana .
2019 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2019), 2019, :10189-10197
[5]   Optimal Multi-View Surface Normal Estimation Using Affine Correspondences [J].
Barath, Daniel ;
Eichhardt, Ivan ;
Hajder, Levente .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2019, 28 (07) :3301-3311
[6]   Graph-Cut RANSAC [J].
Barath, Daniel ;
Matas, Jiri .
2018 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2018, :6733-6741
[7]   Efficient Recovery of Essential Matrix From Two Affine Correspondences [J].
Barath, Daniel ;
Hajder, Levente .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2018, 27 (11) :5328-5337
[8]   SURF: Speeded up robust features [J].
Bay, Herbert ;
Tuytelaars, Tinne ;
Van Gool, Luc .
COMPUTER VISION - ECCV 2006 , PT 1, PROCEEDINGS, 2006, 3951 :404-417
[9]   SIFT Matching by Context Exposed [J].
Bellavia, Fabio .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2023, 45 (02) :2445-2457
[10]  
Bian J.-W., 2019, 30 BRIT MACH VIS C 2, V2, P25