Abstract

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.

Highlights

  • Feature matching aims to establish reliable correspondences of common regions across images

  • To address the aforementioned issues, this study proposes a method termed as Efficient Properties-based Learning for Mismatch Removal (EPLMR)

  • EXPERIMENTAL RESULTS we test our EPLMR for feature matching on three public available datasets and compare it with six state-of-the-art feature matching methods including Random Sample Consensus (RANSAC) [13], Identifying point correspondences by Correspondence Function (ICF) [24], graph shift (GS) [31], Vector Field Consensus (VFC) [26], Locality Preserving Matching (LPM) [28], and LMR [39]

Read more

Summary

Introduction

Feature matching aims to establish reliable correspondences of common regions across images. It is a fundamental and active research topic in computer vision, since it has been an inherent part in a number of vision applications, such as 3D reconstruction [1], [2], visual homing [3], point registration [4], [5], image deformation [6], contextbased image retrieval [7], [8], etc. The feature matching problem boils down to determine which correspondence in the putative set is true. To this end, many parameter-based methods impose

Objectives
Results
Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.