Abstract
Traditional Hough circle detection algorithm usually determines the center and radius of a circle by mapping points in cartesian coordinate system to polar coordinate system. Since it accumulates in the three-dimensional space, it requires more calculation consumption. In this paper, we solve the problem of high time complexity of Hough algorithm in judging circle radius and circle center from two aspects of circle angle and circle radius according to the geometric features of quasi-circles. A large number of experiments show that, compared with the traditional algorithm, this algorithm can not only identify quasi-circles, but also improve the detection success rate of circles by about 10%, with efficient running speed, and obtain good experimental results in the detection of craters.
Get full access to this article
View all access options for this article.