A Local Neighborhood Constraint Method for SIFT Features Matching

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

For improving the accuracy of the SIFT matching algorithm with low time cost, this paper proposes a novel matching algorithm which is based on local neighborhood constraints, that is, SIFT matching feature is optimized by the local neighborhood constraint method in the SIFT algorithm. We optimize the matching results by using the information of SIFT feature descriptor and the relative position information of SIFT feature, then the final matching result obtained by RANSANC algorithm to filter the false matched pairs. The experimental results show that our method can improve the accuracy of the matching feature pairs without affecting the time cost.

Cite

CITATION STYLE

APA

Li, Q., Xu, L., Zheng, P., & He, F. (2018). A Local Neighborhood Constraint Method for SIFT Features Matching. In Springer Proceedings in Business and Economics (pp. 313–320). Springer Science and Business Media B.V. https://doi.org/10.1007/978-3-319-72745-5_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free