Abstract
Most visual navigation relies on point matching and many of the matching point pairs are faulty. Generally, they are eliminated by the Random Sample Consensus (RANSAC) algorithms. However, RANSAC algorithms are often time-consuming and their parameters are hard to adjust. For such a purpose, a new method is proposed to eliminate the error matching points of every two consecutive images based on motion information. The proposed method is applicable to the cases that the motion information is available and the interest points are all from a horizontal plane. It does not require iteration and thus time-efficient. To demonstrate the effectiveness, the proposed method is tested on synthetic data of both simulation points and real images. The results show that the proposed method has better performance over RANSAC algorithms.
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.
