# Effective elliptic arc selection from connected edge points

- Tomonari Masuzaki
^{1}Email author and - Yasuyuki Sugaya
^{1}

**8**:6

**DOI: **10.1186/s41074-016-0007-y

© The Author(s) 2016

**Received: **14 August 2015

**Accepted: **21 April 2016

**Published: **6 September 2016

## Abstract

Extracting edge points from an image and fitting ellipses to them is a fundamental technique for computer vision applications. However, since the extracted edge points sometimes contain non-elliptic arcs such as line segments, it is a very difficult to extract only elliptic arcs from them. In this paper, we propose a new method for extracting elliptic arcs from a spatially connected point sequence. We first fit an ellipse to an input point sequence and segment the sequence into partial arcs at the intersection points of the fitted ellipse. Next, we compute residuals of the fitted ellipse for all input points and select elliptic arcs among the segmented arcs by checking the curvatures of the residual graph. Then, we fit an ellipse to the selected arcs and repeat the above process until the selected arcs do not change. By using simulated data and real images, we compare the performance of our method with existing methods and show the efficiency of our proposed method.

### Keywords

Elliptic arc selection Ellipse fitting Outlier detection## 1 Introduction

A circular object in a scene is projected onto the image plane as an ellipse, and we can compute its 3-D positions from that ellipse [5]. Therefore, detecting circles and ellipses in images is the first step of many computer vision applications including industrial robotic operations and autonomous navigation. For this purpose, many methods for extracting elliptic arcs from an image and for fitting an ellipse to the extracted elliptic arcs are studied [6, 15, 20].

In order to detect ellipses in images, we usually extract edge points from images and fit or estimate the ellipse parameters from them. We classify ellipse detection problems into two stages. One stage is to estimate ellipse parameters accurately for given points. The other is to select elliptic arcs from the extracted edge points.

For the former problem, many methods have been proposed. The simplest method for fitting an ellipse is *least squares* (*LS*) which minimizes the sum of squares of the ellipse equation. A more accurate method was proposed by Taubin [17]. Moreover, *hyper-LS* [8, 9] and *hyper-renormalization* [10] whose solution has no deviation up to high-order noise terms are also proposed. *Maximum likelihood* (*ML*) is also a well-known method, which minimizes the *reprojection error*, i.e., the sum of the distances from data points to the fitted ellipse [4]. Many ML-based methods have been proposed [1, 7, 11, 13].

Ellipse-specific methods also have been proposed [3, 12, 16, 18, 19]. It is Fitzgibbon et al. [3] who first proposed a method that only fits an ellipse.

The latter problem of ellipse detection is to select elliptic arcs from the extracted edge points. Since all the above methods do not consider the presence of non-elliptic arcs, which we call “outliers” in this paper, in the input point sequence, the accuracy of those solutions deteriorate if the input point sequence includes outliers. So, it is an important task to separate elliptic arcs from the input point sequence.

Ad hoc and simple methods for detecting non-elliptic arcs are line fitting and curvature-based methods. However, these methods may detect special targets, for example, line-fitting methods detect only line segments, so they cannot always remove all outliers. Random sample consensus (RANSAC) is a well-known framework for dealing with outliers [2]. RANSAC has problems that it needs a lot of iterations and does not work well if the number of outliers are larger than that of inliers. Yu et al. [20] detected an outlier point sequence from fitting residuals and removed it from the input data. By iteratively applying the above procedure, they fitted an ellipse to the remaining inliers. Shao et al. [14] segment an input point sequence into some spatially connected arcs and detect elliptic arcs by fitting ellipses to all the combinations of the segmented arcs.

We propose a new method for extracting elliptic arcs from a spatially connected point sequence. Assuming that input data is a spatially connected sequence of edge points, we segment it into partial arcs by considering the ellipse fitting residuals and detect inliers by computing the curvature of the residual graph of each of the segmented arcs.

Our method has several advantages over existing methods. (1) The proposed method can automatically segment an input point sequence at the intersections of the fitted ellipse and select inlier elliptic arcs by repeating point segmentation and ellipse fitting. (2) Our method involves iterations, but the number of iterations is much less than those of iterative methods like RANSAC and Yu’s method. (3) Moreover, in contrast to Yu’s method, our method has the possibility of fitting a more accurate ellipse because inliers are selected from all the input data in each iteration step, meaning that the number of data to fit an ellipse does not decrease by iterations. (4) Our method also detect outlier arcs which are smoothly connected to inlier arcs. This type of outliers cannot detect by the curvature-based method.

## 2 Ellipse fitting

*x*and

*y*in the form

*A*,...,

*F*so that the ellipse of Eq. (1) passes through the detected points (

*x*

_{ α },

*y*

_{ α }),

*α*=1,...,

*N*, as closely as possible (Fig. 1). In Eq. (1),

*f*

_{0}is a constant that has the order of the image size for stabilizing finite length numerical computation.

^{1}For a point sequence (

*x*

_{ α },

*y*

_{ α }),

*α*=1,...,

*N*, we define 6-D vectors

*x*

_{ α },

*y*

_{ α }) satisfies Eq. (1) is written as

where (a, b) denotes the inner product of vectors a and b. Since vector θ has scale indeterminacy, we normalize it to unit norm: ||θ||=1.

_{ α },θ) ≈ 0,

*α*=1,...,

*N*. For computing a θ that is close to its true value, we need to consider the statistical properties of noise. The standard model is to regard the noise in (

*x*

_{ α },

*y*

_{ α }) as an independent Gaussian random variable of mean 0 and standard deviation

*σ*. Then, the covariance matrix of the vector ξ

_{ α }has the form

*σ*

^{2}

*V*

_{0}[ξ

_{ α }], where

which we call the “normalized covariance matrix” [7]. We use the normalized covariance matrix to compute residuals of ellipse fitting.

## 3 Fitzgibbon’s method

*algebraic distance*

*A*

*C*−

*B*

^{2}=1. This constraint is written as

*μ*, where the matrix M

_{LS}is defined by

## 4 Proposed method

The principle of our inlier arc selection is nearly equivalent to the curvature-based method. However, our method is more efficient, because our method computes the curvature of the residual graph at only one point where the residual takes a maximum in each segmented arc.

In Fig. 2, the input point sequence is divided into five partial arcs by the fitted ellipse. The residual value of the arc *PQ*, which consists only of an elliptic arc, smoothly changes around the peak value. On the other hand, we can see that the residual graph has a peaky shape over the arcs consisting of non-elliptic arcs.

*P*

*P*

^{′}and

*Q*

*Q*

^{′}, which are connected to the elliptic arc

*PQ*, are also elliptic arcs. The points

*P*

^{′}and

*Q*

^{′}are the peak points of the partial arcs adjacent to the elliptic arc

*PQ*. Therefore, if we use not only the detected inlier arc but also the adjacent arcs like the arcs

*P*

*P*

^{′}and

*Q*

*Q*

^{′}for ellipse fitting, we can effectively fit a correct ellipse. The algorithm of our method is summarized as follows:

- 1.
Fit an ellipse to a point sequence by Fitzgibbon’s method [3].

- 2.
Compute the sign of the left-hand side of Eq. (4) for all the points and segment the point sequence into partial arcs at the points across which the computed sign changes.

- 3.
For each segmented arc, detect the point where the residual value takes a maximum and compute its error curvature

*ϕ*at this point. - 4.
Go to step (a) if it is the first inlier selection, else go to step (b).

- (a)
Select an inlier arc which has the smallest value

*ϕ*among those arcs whose arc lengths are longer than a threshold^{2}and extend it to each peak point of adjacent arcs. Then, we fit an ellipse to the selected arc. - (b)
Select the arcs whose error curvature

*ϕ*s are smaller than a threshold \(\hat {\phi }\)^{3}and fit an ellipse to them.

- (a)
- 5.
Repeat the procedures from step 2 to step 4 until the number of inliers does not change.

As discussed before, if a selected arc is an elliptic arc, the adjacent arcs are also elliptic arcs. Therefore, we can effectively fit a correct ellipse if we use those arcs. However, if we select a non-elliptic arc as an inlier and add adjacent outlier arcs to fit an ellipse, we cannot fit a correct ellipse.

For this reason, in the first iteration of our algorithm, we select among the arcs that are sufficiently long the one whose error curvature *ϕ* at its peak point is the smallest. We regard it as a reliable inlier and extend it to the adjacent partial arcs. After the first iteration, we select all arcs whose error curvature *ϕ*s are smaller than a threshold \(\hat {\phi }\). We do not extend those arcs, because the adjacent arcs are non-elliptic arcs if the selected inlier arcs approximately belong to the correct ellipse.

In the following sections, we describe the details of our method.

## 5 Segmentation of the point sequence

The left-hand side of Eq. (4) at the point *p*
_{
α
} has a different sign outside and inside the ellipse *θ*. Using this fact, we can segment the input point sequence {*p*
_{
α
}} into partial arcs at those *p*
_{
α
} points which have different signs from their neighboring points.

However, the value (ξ
_{
α
},θ) may not be exactly zero even if the point *p*
_{
α
} lies on the fitted ellipse *θ*; the points lying on the fitted ellipse may irregularly change their signs, so these points may be segmented in very short arcs. To avoid this, we regard those partial arcs whose fitting residual values are close to zero as elliptic arcs and judge that they are inlier arcs without computing their curvatures. We call such arcs “tangent arcs.”

*e*

_{ α }of a point

*p*

_{ α },

*α*=1,...,

*N*by Eq. (10), which is a first approximation of the distance between the fitted ellipse and the point

*p*

_{ α }. We also compute a sign of the residual by the value of the left-hand side of Eq. (4).

Next, we segment the input point sequence into partial arcs at those *p*
_{
α
} points which have different signs from their neighboring points. If the maximum residual in the segmented arc is smaller than a threshold *E*
_{min}
^{4}, we regard the arc R
_{
κ
} as a *tangent arc*.

## 6 Inlier arc selection

*α*

^{∗}where the fitting residual takes its maximum and compute its

*error curvature*at this point by using its neighboring points

*β*and

*γ*(Fig. 3). If the computed curvature is larger than a threshold, we regard this arc as an outlier. Since the horizontal axis of the residual graph \(\bar {Q}_{\alpha }=(\alpha, e_{\alpha })^{\top }\) is an index of the input point sequence, the computed error curvature depends on the scale of the horizontal axis of the residual graph. For example, if two point sequences have the same shape and different scales, the curvatures of their sequences have different values. Therefore, we normalize the scale of the horizontal axis of the residual graph in the form

where *e*
_{max} is the maximum value of all ellipse-fitting residuals and *λ* is a constant for normalization.^{5} If *e*
_{max} is extremely large, the normalization of Eq. (11) may not work well. So, if *e*
_{max} is larger than a threshold *E*
_{max}
^{6}, we replacing the value *e*
_{max} with the threshold *E*
_{max} in the normalization computation.

In order to compute the error curvature, we need to select neighboring points Q
_{
β
} and Q
_{
γ
}. We first select indices *β* and *γ* such that *β*=*α*
^{∗}−*d* and *γ*=*α*
^{∗}+*d*. Here, *d* is a constant for determining the distance from the point Q
_{
α
}
^{∗}. If both of the points Q
_{
β
} and Q
_{
γ
} are not included in R
_{
κ
}, we decrease *d* until either of them is included in R
_{
κ
}. If Q
_{
α
}
^{∗} is located near the start or the end point of the arc R
_{
κ
}, we cannot select both of the neighboring points properly. In this case, we select at least one neighboring point and compute its symmetric point to *α*
^{∗}. More details are described in the following algorithm.

*M*-segmented arcs R

_{ κ }(

*i*,

*j*)={Q

_{ δ }|

*δ*=

*i*,...,

*j*},

*κ*=1,...,

*M*, we compute error curvatures for selecting inlier arcs by the following algorithm.

- 1.
Let

*α*^{∗}be the index of the point whose residual takes its maximum in the arc R_{ κ }. Here, if a target arc is a tangent arc, finish this procedure. - 2.
Select two points whose indices

*β*and*γ*are such that$$ \beta = \alpha^{*} - d, \gamma = \alpha^{*} + d, d = (j - i) / r, $$(12)where

*r*^{7}is a constant for determining the distance between the point*α*^{∗}and its neighboring points*β*and*γ*. If both*β*and*γ*are out of R_{ κ }, we update*d*to*d*←*d*−1 until either of the two points are in the arc R_{ κ }. - 3.
Compute two vectors x

^{(1)}and x^{(2)}according to the following three rules. Here, \(x^{(a)}_{b}\) denotes the*b*-th component of the vector x^{(a)}. case a: Points Q_{ β }and Q_{ γ }are both in the arc R_{ κ }.$$ \boldsymbol{x}^{(1)}=\boldsymbol{Q}_{\alpha^{*}}-\boldsymbol{Q}_{\beta},~ \boldsymbol{x}^{(2)}=\boldsymbol{Q}_{\alpha^{*}}-\boldsymbol{Q}_{\gamma}. $$(13)case b: Point Q

_{ β }is in the arc R_{ κ }.$$ \boldsymbol{x}^{(1)}=\boldsymbol{Q}_{\alpha^{*}}-\boldsymbol{Q}_{\beta},\; \boldsymbol{x}^{(2)}=\left(-x^{(1)}_{1},x^{(1)}_{2}\right)^{\top}. $$(14)case c: Point Q

_{ γ }is in the arc R_{ κ }.$$ \boldsymbol{x}^{(2)}=\boldsymbol{Q}_{\alpha^{*}}-\boldsymbol{Q}_{\gamma},\; \boldsymbol{x}^{(1)}=\left(-x^{(2)}_{1},x^{(2)}_{2}\right)^{\top}. $$(15) - 4.Compute the error curvature
*ϕ*by$$ \phi= \pi - \cos^{-1}\left(\frac{\left(\boldsymbol{x}^{(1)},\boldsymbol{x}^{(2)}\right)}{||\boldsymbol{x}^{(1)}||||\boldsymbol{x}^{(2)}||} \right). $$(16) - 5.
Regard the arc R

_{ κ }as an inlier arc if*ϕ*is smaller than the threshold \(\hat {\phi }\).

If it is the first iteration of an inlier selection, we extend the selected inlier arc to each peak point of its adjacent arcs. If the adjacent arc is a *tangent arc*, we check the next adjacent arc and add the partial non-*tangent arc* as an inlier.

## 7 Experiment

### 7.1 Inlier selection process

Figure 4(1)-(b) shows the fitted ellipse to all the input data by Fitzgibbon’s method, and Fig. 4(1)-(c) is its signed residual graph. The horizontal and vertical axis of the graph indicate the index of the input points and a signed fitting residual, respectively.

In our first inlier selection, the blue arc was selected as an inlier arc and the green adjacent partial arcs were extended as inliers. These arcs correspond to the blue and green arcs in Fig. 4(2)-(a). In the second step, we fitted an ellipse to the selected inlier arcs (Fig. 4(2)-(a)). The fitted ellipse was shown in Fig. 4(2)-(b). As we can see, the segmented arcs could be obviously separated to inlier arcs (*tangent arcs*) and outlier arcs in Fig. 4(2)-(c). Our method stopped in the third step because the number of inlier points did not change and could fit a correct ellipse to all the inlier points.

The input data of Fig. 5(1)-(a) consists of three different elliptic arcs. Figure 5(1)-(b), (1)-(c) are the fitted ellipse to all the input data and its signed residual graph, respectively. This input point sequence is closed, so we consider that the start and the end points are connected in the residual graph. The blue arc is the selected inlier arc, and the green adjacent arcs are extended arcs as inliers. These arcs correspond to the blue and green arcs in Fig. 5(2)-(a). By checking the selected inlier arcs in Fig. 5(2)-(a), we can confirm that the selected arcs belong to one ellipse. Figure 5(2)-(b) shows the fitted ellipse to them. Since the selected arcs are short for the entire ellipse, the accuracy of the fitted ellipse is not good. However, our method selects the remaining elliptic arcs as inliers from the residual graph of Fig. 5(2)-(c) and fits a correct ellipse in the third step.

From these results, we could confirm that our method could select inlier arcs by repeating inlier selection based on an *error curvature* and ellipse fitting.

### 7.2 Simulations

Input data of Fig. 6(1), (2) have the same shape, but their scales are different. For these data, all the methods fitted a correct ellipse. In Fig. 6(3), two ellipses are tangent to each other. Our proposed method, RANSAC, and Shao’s method fitted an ellipse to the outer arc; however, Yu’s method fitted an ellipse to the inner arc.

Figure 6(4) is an example which includes a line segment as outlier points. All methods fitted an almost correct ellipse. In Fig. 6(4), since Yu’s method fitted an ellipse to a short arc, the accuracy of the resulting ellipse is not good compared with the other methods. Figure 6(5) is an example where an outlier arc is smoothly connected to an inlier arc. For such input data, outlier detection based on the curvature of a point sequence may not work well. However, our method can correctly detect inlier and outlier arcs because it iteratively selects inlier arcs and fits an ellipse. In Fig. 6(6), (7), input point sequences consist of elliptic arcs and contours of other shapes. Our method and RANSAC fitted a correct ellipse for each data. However, Yu’s method fitted a small ellipse to a short arc for Fig. 6(7). Shao’s method detected many outlier points. The inlier selection process of our method for Fig. 6(7) is shown in Fig. 5. The input data of Fig 6(8) includes many outlier points. Our method and Yu’s method output an almost correct ellipse. Since the ratio of outliers was large, RANSAC did not work well.

Inlier selection ratios/outlier selection ratios

Our method | RANSAC | Yu’s method | Shao’s method | |
---|---|---|---|---|

(1) | 0.99/0.00 | 0.99/0.00 | 0.49/0.01 | 0.80/0.00 |

(2) | 0.99/0.00 | 1.00/0.01 | 0.49/0.02 | 0.81/0.00 |

(3) | 0.99/0.04 | 1.00/0.07 | 0.40/0.04 | 0.93/0.09 |

(4) | 1.00/0.00 | 1.00/0.01 | 0.36/0.00 | 0.90/0.05 |

(5) | 0.99/0.00 | 1.00/0.04 | 0.47/0.00 | 0.93/0.04 |

(6) | 0.99/0.00 | 1.00/0.01 | 0.48/0.01 | 0.61/0.45 |

(7) | 0.90/0.00 | 1.00/0.02 | 0.45/0.06 | 0.54/0.68 |

(8) | 0.50/0.00 | 0.02/0.98 | 1.00/0.10 | 0.51/0.63 |

Comparison of computation time and number of iterations: computation time in milliseconds (number of iterations)

Our method | RANSAC | Yu’s method | |
---|---|---|---|

(1) | 4 (5) | 41 (111) | 80 (20) |

(2) | 8 (5) | 61 (113) | 148 (48) |

(3) | 12 (7) | 79 (137) | 208 (17) |

(4) | 4 (3) | 49 (152) | 288 (106) |

(5) | 8 (9) | 42 (148) | 600 (178) |

(6) | 4 (4) | 59 (218) | 216 (72) |

(7) | 8 (8) | 68 (134) | 48 (10) |

(8) | 4 (3) | 64 (143) | 424 (157) |

### 7.3 Real image experiment

Inlier selection ratios/outlier selection ratios

Our method | RANSAC | Yu’s method | Shao’s method | |
---|---|---|---|---|

(1) | 1.00/0.00 | 1.00/0.02 | 0.49/0.08 | 0.95/0.23 |

(2) | 1.00/0.00 | 1.00/0.02 | 0.00/1.00 | 0.71/0.46 |

(3) | 0.83/0.02 | 0.83/0.05 | 0.27/0.00 | 0.36/0.48 |

Comparison of computation time and number of iterations: computation time in milliseconds (number of iterations)

Our method | RANSAC | Yu’s method | |
---|---|---|---|

(1) | 3 (4) | 70 (157) | 228 (65) |

(2) | 1 (6) | 16 (141) | 3 (5) |

(3) | 4 (10) | 49 (208) | 56 (35) |

## 8 Concluding remarks

We proposed a new method for extracting elliptic arcs from a spatially connected point sequence. Assuming that input points are a spatially connected sequence of edge points, we fit an ellipse to it and automatically segment it into partial arcs at the intersection points of the fitted ellipse. Then, we compute residuals of the fitted ellipse for all input points and select elliptic arcs among the segmented arcs by checking curvatures of the residual graph.

Our proposed method involves iterations, but the number of iterations is much less than those of RANSAC and Yu’s method. Moreover, in contrast to Yu’s method, our method has the possibility of fitting a more accurate ellipse because inliers are selected from all the input data in each iteration, meaning that the number of data to fit an ellipse does not decrease by iterations.

By using simulated data and real images, we compared the performance of our method with existing methods and showed that the performance of the inlier selection and computation time of the proposed method were superior to existing methods.

## 9 Endnotes

^{1} We set *f*
_{0} = 600.

^{2} We set the threshold to be 5 *%* of the number of input edge points.

^{3} We set \(\hat {\phi } = 80^{\circ}\).

^{4} We set *E*
_{min}=1.5.

^{5} We set *λ*=2.0.

^{6} We set *E*
_{max} to be (maximum image coordinates of the input points)/3.

^{7} We set *r*=8.

## Declarations

### Acknowledgements

The authors thank Kenich Kanatani of Okayama University, Japan, for helpful discussions. The authors also thank Yoshihisa Iriji of OMRON Corporation, Japan, for allowing us to use the source code. This work was supported in part by JSPS Grant-in-Aid for Scientific Research(C) (26330192).

### Authors’ contributions

YS proposed a method to automatically segment a consecutive edge points and inlier arc selection method. TM tested the proposed method by using simulated and real data, and wrote the manuscript. YS also revised the manuscript written by TM. Both authors read and approved the final manuscript.

### Competing interests

The authors declare that they have no competing interests.

**Open Access** This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

## Authors’ Affiliations

## References

- Chojnacki W, Brooks MJ, van den Hengel A, Gawley D (2000) On the fitting of surfaces to data with covariances. IEEE Trans Patt Anal Mach Intell 22(11): 1294–1303.View ArticleGoogle Scholar
- Fischler MA, Bolles RC (1981) Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Comm ACM 24(6): 381–395.MathSciNetView ArticleGoogle Scholar
- Fitzgibbon A, Pilu M, Fisher RB (1999) Direct least squares fitting of ellipses. IEEE Trans Patt Anal Mach Intell 21(5): 476–480.View ArticleGoogle Scholar
- Hartley R, Zisserman A (2004) Multiple view geometry in computer vision. 2nd ed.. Cambridge University Press, Cambridge, U.K.View ArticleMATHGoogle Scholar
- Kanatani K (1993) Geometric computation for machine vision. Oxford University Press, Oxford, U.K.MATHGoogle Scholar
- Kanatani K, Ohta N (2004) Automatic detection of circular objects by ellipse growing. Int J Image Graphics 4(1): 35–50.View ArticleGoogle Scholar
- Kanatani K, Sugaya Y (2007) Performance evaluation of iterative geometric fitting algorithms. Comput Stat Data Anal 52(2): 1208–1222.MathSciNetView ArticleMATHGoogle Scholar
- Kanatani K, Rangarajan P (2011) Hyper least squares fitting of circles and ellipses. Comput Stat Data Anal 55(6): 2197–2208.MathSciNetView ArticleMATHGoogle Scholar
- Kanatani K, Rangarajan P, Sugaya Y, Niitsuma H (2011) HyperLS and its applications. IPSJ Trans Comput Vis Appl 3: 80–94.Google Scholar
- Kanatani K, Al-Sharadqah A, Chernov N, Sugaya Y (2012) Renormalization returns: hyper-renormalization and its applications. Proc 12th Euro Conf Comput Vis 3: 385–398.Google Scholar
- Leedan Y, Meer P (2000) Heteroscedastic regression in computer vision: problems with bilinear constraint. Int J Comput Vision 37(2): 127–150.View ArticleMATHGoogle Scholar
- Masuzaki T, Sugaya Y, Kanatani K (2013) High accuracy ellipse-specific fitting. 6th Pacific-Rim Symposium on Image and Video Technology.Guanajuato, Mexico,p 314–324.Google Scholar
- Matei J, Meer P (2006) Estimation of nonlinear errors-in-variables models for computer vision applications. IEEE Trans Patt Anal Mach Intell 28(10): 1537–1552.View ArticleGoogle Scholar
- Shao M, Ijiri Y, Hattori K (2015) Grouped outlier removal for robust ellipse fitting. 14th IAPR International Conference on Machine Vision Applications.Tokyo, Japan,p 138–141.View ArticleGoogle Scholar
- Sugaya Y (2010) Ellipse detection by combining division and model selection based integration of edge points. 4th Pacific-Rim Symposium on Image and Video Technology,Siggapore,p 64–69.View ArticleGoogle Scholar
- Szpak ZL, Chojnacki W, van den Hengel A (2012) Guaranteed ellipse fitting with Sampson distance. Proc 12th Euro Conf Comput Vis 5: 87–100.Google Scholar
- Taubin G (1991) Estimation of planar curves, surfaces, and non-planar space curves defined by implicit equations with applications to edge and range image segmentation. IEEE Trans Patt Anal Mach Intell 13(11): 1115–1138.View ArticleGoogle Scholar
- Waibel P, Matthes J, Gröll L (2015) Constrained ellipse fitting with center on a line. J Math Imaging Vis 53(3): 364–382.MathSciNetView ArticleMATHGoogle Scholar
- Yu J, Kulkarni SR, Poor HV (2012) Robust ellipse and spheroid fitting. Pattern Recognit Lett 33(5): 492–499.View ArticleGoogle Scholar
- Yu Q, Ong SH (2007) Arc-based evaluation and detection of ellipses. J Pattern Recognit 40(7): 1990–2003.View ArticleMATHGoogle Scholar