Ellipse detection through decomposition of circular arcs and line segments

7Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this work we propose an efficient and original method for ellipse detection which relies on a recent contour representation based on arcs and line segments [1]. The first step of such a detection is to locate ellipse candidate with a grouping process exploiting geometric properties of adjacent arcs and lines. Then, for each ellipse candidate we extract a compact and significant representation defined from the segment and arc extremities together with the arc middle points. This representation allows then a fast ellipse detection by using a simple least square technique. Finally some first comparisons with other robust approaches are proposed. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Nguyen, T. P., & Kerautret, B. (2011). Ellipse detection through decomposition of circular arcs and line segments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6978 LNCS, pp. 554–564). https://doi.org/10.1007/978-3-642-24085-0_57

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free