본문 바로가기

Fast Ellipse Detection based on Three Point Algorithm with Edge Angle Information

문서 유형
연구출판물 · 학술지 논문
등재
KCISCIEScopus
저널 순위
JCR Q3Scopus Q2
피인용
Web of Science 20KCI 1
JCR IF
JCR 2015 1.219
ISSN
1598-6446

저자

  1. 강동중제1저자교신저자부산대학교
  2. 권배근부산대학교
  3. Zhu TengBeijing Jiaotong University
  4. 노태정동명대학교

초록

In this paper, we introduce a fast ellipse detection method that uses the geometric properties of three points on an ellipse. Many conventional ellipse detection methods carry out detection using five points, but a random selection of such points among candidate edges requires much redundant processing. To search for an ellipse with the minimum number of points, this study used the normal and differential equations of an ellipse, which requires three points based on their locations and edge angles. First, to reduce the number of candidate edges, the edges were divided into 8 groups depending on the edge angle, and then a new geometric constraint called the quadrant condition was introduced to reduce noisy candidate edges. Clustering was employed to find prominent candidates in the space of a few ellipse parameters. Experiments using many real images showed that the proposed method satisfies both reliability and computing speed for ellipse detection.

키워드

Ellipse detectionmean-shift clusteringquadrant constraintthree-point algorithm

식별자

WoS UID
000376830800020
KCI
ART002108132