| 摘要 |
PURPOSE:To widely delete a computing time by using the method of probability and obtaining the position of the center of cycle from a partial circular arc under the constant level of significance. CONSTITUTION:Two or three extracting points (xn, yn) are extracted from the boarder point data or the change point data of a curve to include a circular arc 1 of an image and it is decided whether or not these two or three extracting points are effective or ineffective to obtain the center of the circle whose radius is already known. When they are judged to be effective, a processing is executed to obtain the position of a center 2 of the circle, the coordinate value of the position of this obtained center 2 is quantized and a count-up is executed concerning the coordinate value of the position of the center 2 of the circle. The count-up is executed with repeating in plural number times determined from a rate, etc., that a circular arc 1 to be obtained occupies the whole boarder point or the change point. Then, a peak-search is executed for the coordinate value in which a counted value is the largest out of the quantized coordinate values and it is determined as the position of the center 2 of the circular arc 1. Thus, the counting quantity is decreased and also memory capacity is reduced. |
