Edge curvature and convexity based ellipse detection method

被引:123
作者
Prasad, Dilip K. [1 ]
Leung, Maylor K. H. [2 ]
Cho, Siu-Yeung [3 ]
机构
[1] Nanyang Technol Univ, Sch Comp Engn, Singapore, Singapore
[2] Univ Tunku Abdul Rahman Kampar, Fac Informat & Commun Technol, Kampar, Malaysia
[3] Univ Nottingham Ningbo China, Ningbo, Zhejiang, Peoples R China
关键词
Ellipse detection; Real images; Caltech; 256; dataset; Hough transform; Overlapping ellipses; Occluded ellipses; Grouping; Saliency; HOUGH TRANSFORM; DISTINCTIVENESS; SEGMENTATION; CURVES; ROBUST; CIRCLE;
D O I
10.1016/j.patcog.2012.02.014
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we propose a novel ellipse detection method for real images. The proposed method uses the information of edge curvature and their convexity in relation to other edge contours as clues for identifying edge contours that can be grouped together. A search region is computed for every edge contour that contains other edge contours eligible for grouping with the current edge contour. A two-dimensional Hough transform is performed in an intermediate step, in which we use a new 'relationship score' for ranking the edge contours in a group, instead of the conventional histogram count. The score is found to be more selective and thus more efficient. In addition, we use three novel saliency criteria, that are non-heuristic and consider various aspects for quantifying the goodness of the detected elliptic hypotheses and finally selecting good elliptic hypotheses. The thresholds for selection of elliptic hypotheses are determined by the detected hypotheses themselves, such that the selection is free from human intervention. The method requires a few seconds in most cases. So, it is suitable for practical applications. The performance of the proposed ellipse detection method has been tested on a dataset containing 1200 synthetic images and the Caltech 256 dataset containing real images. In both cases, the results show that the proposed ellipse detection method performs far better than existing methods and is close to the ideal results, with precision, recall, and F-measure, all very close to 1. Further, the method is robust to the increase in the complexity of the images (such as overlapping ellipses, occluded ellipses), while the performance of the contemporary methods deteriorates significantly. (C) 2012 Elsevier Ltd. All rights reserved.
引用
收藏
页码:3204 / 3221
页数:18
相关论文
共 49 条
  • [1] On using directional information for parameter space decomposition in ellipse detection
    Aguado, AS
    Montiel, ME
    Nixon, MS
    [J]. PATTERN RECOGNITION, 1996, 29 (03) : 369 - 381
  • [2] [Anonymous], 2006, Introduction to Data Mining
  • [3] [Anonymous], 2010, 2010 25 INT C IM VIS
  • [4] [Anonymous], 1973, Cartographica: the international journal for geographic information and geovisualization, DOI DOI 10.3138/FM57-6770-U75U-7727
  • [5] [Anonymous], 2000, MATLAB and Octave Functions for Computer Vision and Image Processing
  • [6] Splitting touching cells based on concave points and ellipse fitting
    Bai, Xiangzhi
    Sun, Changming
    Zhou, Fugen
    [J]. PATTERN RECOGNITION, 2009, 42 (11) : 2434 - 2446
  • [7] Basca CA, 2005, Eurocon 2005: The International Conference on Computer as a Tool, Vol 1 and 2 , Proceedings, P1397
  • [8] Unbiased estimation of ellipses by bootstrapping
    Cabrera, J
    Meer, P
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1996, 18 (07) : 752 - 756
  • [9] A simple least squares method for fitting of ellipses and circles depends on border points of a two-tone image and their 3-D extensions
    Chaudhuri, D.
    [J]. PATTERN RECOGNITION LETTERS, 2010, 31 (09) : 818 - 829
  • [10] Cheng YC, 2006, IEEE T PATTERN ANAL, V28, P1215, DOI 10.1109/TPAMI.2006.174