Extensions To The Standard Ransac Algorithm For Efficiency And Robustness

Over the past decade, many improvements have been made to RANSAC, each of which addresses the specific weaknesses of the original algorithm. However, there are relatively few comprehensive studies on these developments. The purpose of this paper is to fill this gap by researching related technologies, so as to promote the development of new algorithms. This paper first introduces the standard RANSAC algorithm, and discusses its mechanism and limitations. Then, some extensions of RANSAC algorithm are introduced in detail. These extensions solve the limitations of robustness and efficiency. By combining these ideas, the performance of the algorithm can be further improved in terms of real-time performance and robustness