Modelling and simulation: an improved RANSAC algorithm based on the relative angle information of samples Online publication date: Fri, 18-Aug-2017
by Chengbo Liu; Qiang Shen; Hai Pan; Miao Li
International Journal of Modelling, Identification and Control (IJMIC), Vol. 28, No. 2, 2017
Abstract: Random sample consensus (RANSAC) algorithm is the most widely used one in the field of computer vision. In order to reduce the high complexity of RANSAC, this paper proposes a novel method which can reject samples before calculating the homography matrix. This algorithm can eliminate random samples that may be wrong through calculating the relative angle information of the random samples, and then, use the correct samples for the next step. The algorithm can ensure the accuracy of the premise while greatly reducing the computational complexity. Not only that, the improved algorithm can also be combined with the existing RANSAC extensions to improve the computational efficiency.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Modelling, Identification and Control (IJMIC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com