|
|||||
|
|
Fast randomized algorithm for center-detection |
|
| Authors: | Kuo-Liang Chung [Author Vitae] Yong-Huai Huang [Author Vitae] Jyun-Pin Wang [Author Vitae] [Author Vitae] Hong-Yuan Mark Liao [Author Vitae] |
| Affiliation: | a Department of Computer Science and Information Engineering, National Taiwan University of Science and Technology, No. 43, Section 4, Keelung Road, Taipei, Taiwan 10672, Republic of China b Institute of Computer and Communication Engineering and Department of Electronic Engineering, Jinwen University of Science and Technology, No. 99, An-Chung Road, Hsin-Tien, Taipei 23154, Taiwan, Republic of China c Institute of Information Science, Academia Sinica, No. 128, Academia Road, Section 2, Taipei, Taiwan 115, Republic of China |
| Abstract: | Recently, Cauchie et al. presented an adaptive Hough transform-based algorithm to successfully solve the center-detection problem which is an important issue in many real-world problems. This paper presents a fast randomized algorithm to solve the same problem. With similar memory requirement and accuracy, the computational complexity analysis and comparison show that our proposed algorithm performs much better in terms of efficiency. We have tested our algorithm on 13 real images. Experimental results indicated that our algorithm has 38% execution-time improvement over Cauchie et al.'s algorithm. The extension of the proposed algorithm to detect multiple centers is also addressed. |
| Keywords: | Center-detection Hough transform Gradient line Multiple centers Randomized algorithm |
| 本文献已被 ScienceDirect 等数据库收录！ | |