JISE


  [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20]


Journal of Information Science and Engineering, Vol. 24 No. 2, pp. 503-520


A Pruning-and-Voting Strategy to Speed up the Detection for Lines, Circles, and Ellipses


Kuo-Liang Chung+ and Yong-Huai Huang 
Department of Computer Science and Information Engineering 
National Taiwan University of Science and Technology 
Taipei, 106 Taiwan 
E-mail: k.l.chung@mail.ntust.edu.tw


    Shape analysis is a fundamental problem in image processing field. In shape analysis, lines, circles, and ellipses are three important features since they often occur in the image. Based on the determined windows on the edge map, this paper first presents a novel pruning-and-voting strategy to speed up the detection for lines, circles, and ellipses. Especially, our proposed strategy can be plugged into several existing randomized algorithms to reduce the required computation time while preserving the same robustness. In addition, some related time complexity analyses are provided to show the computational advantage of our proposed strategy. Under some real images, experimental results confirm our theoretic analyses.


Keywords: circles, ellipses, lines, pruning-and-voting strategy, randomized algorithms

  Retrieve PDF document (JISE_200802_12.pdf)