An improved RANSAC image stitching algorithm based similarity degree

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

Abstract

In terms of the deficiency in the aspects that the higher computational complexity caused by excessive iterations and the easy happened stitching dislocation caused by the difficult-to-determine parameters. In this paper, an improved RANSANC algorithm based similarity degree is proposed and is applied in image mosaic. This improved algorithm includes that sorting rough matched points by similarity degree, calculating transformation matrix, rejecting obviously wrong matched points and executing classical RANSAC algorithm. It is demonstrated by the experiments that this algorithm can effectively remove wrong matched pairs, reduce iteration times and shorten the calculation time, meanwhile ensure the accuracy of requested matrix transformation. By this method can get high quality stitching images.

Cite

CITATION STYLE

APA

Ge, Y., Gao, C., & Liu, G. (2016). An improved RANSAC image stitching algorithm based similarity degree. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9517, pp. 185–196). Springer Verlag. https://doi.org/10.1007/978-3-319-27674-8_17

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