Method for improving speed of randomized circle detection in specific condition
A technology for detecting speed and random circles, which is applied to computer parts, instruments, character and pattern recognition, etc., and can solve the problems of large calculation and storage requirements
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
experiment example 1
[0059] Table 1 Comparison of execution time of three algorithms
[0060]
[0061] Table 2 The algorithm of this paper figure 2 (b) Test result (unit: pixel)
[0062]
[0063] Table 3 Statistics related to innovation points in the algorithm of this paper
[0064]
experiment example 2
[0067] Table 4 Comparison of the execution time of the three algorithms
[0068]
[0069] Table 5 Algorithm pair in this paper image 3 (b) Test result (unit: pixel)
[0070]
[0071] Table 6 Statistics related to innovation points in the algorithm of this paper
[0072]
experiment example 3
[0074] Figure 4 (a) is an actual image with a size of 140 pixels×140 pixels, and there are 4 circles in the image. The circle detection process is as Figure 4 As shown, where the edge image Figure 4 (b) There are 1688 edge points in total. Use RHT, RCD and the algorithm to Figure 4 (b) The time taken for circle detection is 5.4185 seconds, 2.1138 seconds and 0.4958 seconds, respectively. In the process of 50 inspections, these three algorithms can correctly extract the center coordinates and radius of each circle. The average value of p1, c1, r1, r1 / p1, p2, c2, r2, and r2 / p2 in this algorithm They are 765.88, 561.76, 1.04, 0.001358, 2128706, 16487.58, 2.96, 0.000001.
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


