Abstract

ABSTRACT Seeking a reliable inliers selection method to image feature matching is a fundamental and important task in image processing and robotic vision. To improve the precision of feature matching on putative matches with heavy outliers, we propose a new strategy to select the inliers from the rough feature correspondence-set. Firstly, we construct the inliers selection problem as a concise mathematical model with linear time complexity based on the local K-nearest neighbour structure preserving (KNNSP). Then, to improve the robustness of this model, we design a threshold decrease strategy for this model to iteratively solve the optimal inliers set. Extensive experiments on various image pairs demonstrate that the proposed method does not need prior information and can be directly used for rigid or non-rigid image matching problems. In addition, compared with other typical image matching algorithms, our method ensures competitive performance in precision and recall.

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.