A Randomized Circle Detection Algorithm: Applying Ptolemy Theorem

• Main Authors: Min Hsiung Chen, 陳閩雄
• Other Authors: Yu Chin Cheng
• Format: Others
• Language: zh-TW
• Published: 2003
• Online Access: http://ndltd.ncl.edu.tw/handle/73133243289068315357

碩士 === 國立臺北科技大學 === 資訊工程系碩士班 === 91 === In the paper, a new randomized circle detection algorithm called Ptolemy Circle Detection Algorithm (PCD) is presented. Computationally, the proposed PCD randomly selects four points in the image and calculate three pairs of edge products. The edge products are used in the Ptolemy theorem to check whether the four points are on the same circle. If so, the circle is verified by counting the number of pixels in the image that are compatible with the circle. Both synthetic and real images with different levels of noises containing circular shapes have been used to test the performance of PCD. Experimental results demonstrate that, in comparison with other four-point circle detection algorithms, PCD favors small circles and is faster in computing the transforms.