Efficient Properties-Based Learning for Mismatch Removal

被引:7
作者
Li, Yanping [1 ]
Huang, Qian [1 ,2 ]
Liu, Yizhang [3 ,4 ]
Huang, Yuan [1 ]
Sun, Xiaoqing [1 ]
机构
[1] Hohai Univ, Coll Comp & Informat, Nanjing 211100, Jiangsu, Peoples R China
[2] Jilin Univ, Minist Educ, Key Lab Symbol Computat & Knowledge Engn, Changchun 130012, Jilin, Peoples R China
[3] Fujian Agr & Forestry Univ, Digital Fujian Res Inst Big Data Agr & Forestry, Fuzhou 350002, Fujian, Peoples R China
[4] Fujian Agr & Forestry Univ, Coll Comp & Informat Sci, Fuzhou 350002, Fujian, Peoples R China
基金
中国国家自然科学基金;
关键词
Topology; Training; Reliability; Feature extraction; Supervised learning; Agriculture; Forestry; Feature matching; mismatch removal; supervised learning; geometric consistency; guided strategy; IMAGE; MLESAC; MODEL;
D O I
10.1109/ACCESS.2019.2947178
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Mismatch removal is a critical step of feature matching, which is a prerequisite of many vision-based tasks. This paper aims to develop a general and robust method for mismatch removal. To this end, we propose an efficient learning-based mismatch removal method that can significantly improve outlier identification in terms of both accuracy and efficiency. The key idea of our approach is to use a set of properties to describe the putative matches and feed the match representations to a supervised learning procedure learning a binary classifier for mismatch removal. The efficient properties mainly include three aspects: consistency of neighborhood elements, weighted consistency of neighborhood topology, and the stability of correspondence. Different from existing consistency of neighborhood topology, we adopt a weighted strategy to emphasize the effect of different properties with respect to the identified correspondence. The match representations combine the spatial positions of the correspondences with their descriptor reliabilities, which can effectively enlarge the distributions between outliers and inliers. To handle large proportions of outliers, we design a simple strategy to obtain a subset with high ratio inliers guiding the match representations construction process. This strategy can also boost the number of true correspondences without sacrificing the accuracy. Extensive experiments demonstrate our superiority over the state-of-the-art methods.
引用
收藏
页码:149612 / 149622
页数:11
相关论文
共 42 条
[1]   Discrete Tabu Search for Graph Matching [J].
Adamczewski, Kamil ;
Suh, Yumin ;
Lee, Kyoung Mu .
2015 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2015, :109-117
[2]   Building Rome in a Day [J].
Agarwal, Sameer ;
Furukawa, Yasutaka ;
Snavely, Noah ;
Simon, Ian ;
Curless, Brian ;
Seitz, Steven M. ;
Szeliski, Richard .
COMMUNICATIONS OF THE ACM, 2011, 54 (10) :105-112
[3]  
[Anonymous], 2018, COMPUTER VISION PATT
[4]  
[Anonymous], PROC CVPR IEEE
[5]   Graph-Cut RANSAC [J].
Barath, Daniel ;
Matas, Jiri .
2018 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2018, :6733-6741
[6]   SURF: Speeded up robust features [J].
Bay, Herbert ;
Tuytelaars, Tinne ;
Van Gool, Luc .
COMPUTER VISION - ECCV 2006 , PT 1, PROCEEDINGS, 2006, 3951 :404-417
[7]   NM-Net: Mining Reliable Neighbors for Robust Feature Correspondences [J].
Zhao, Chen ;
Cao, Zhiguo ;
Li, Chi ;
Li, Xin ;
Yang, Jiaqi .
2019 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2019), 2019, :215-224
[8]   Matching with PROSAC - Progressive Sample Consensus [J].
Chum, O ;
Matas, J .
2005 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOL 1, PROCEEDINGS, 2005, :220-226
[9]   RANDOM SAMPLE CONSENSUS - A PARADIGM FOR MODEL-FITTING WITH APPLICATIONS TO IMAGE-ANALYSIS AND AUTOMATED CARTOGRAPHY [J].
FISCHLER, MA ;
BOLLES, RC .
COMMUNICATIONS OF THE ACM, 1981, 24 (06) :381-395
[10]  
Guangjun Shi, 2013, 2013 5th International Conference on Intelligent Human-Machine Systems and Cybernetics (IHMSC), P474, DOI 10.1109/IHMSC.2013.119