Abstract
When matching the SIFT feature points, there will be lots of mismatches. The RANSAC algorithm can be used to remove the mismatches by finding the transformation matrix of these feature points. But when the data space contains a lot of mismatches, finding the right transformation matrix will be very difficult. What's more, the probability of finding the error model is very large. Aiming at solving the problem, this paper proposed an improved RANSAC algorithm. Before using the RANSAC algorithm, we removed parts of the error feature points by two methods, one is eliminating features not belonging to the target area and the other is removing the crossing points. The two methods aimed to improve the proportion of feature points matched correctly. Experiments showed that, the improved RANSAC algorithm could find the model more accurately, improve efficiency, and make the feature point matching more accurately.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
