Direct least squares fitting of ellipses

  title={Direct least squares fitting of ellipses},
  author={Andrew W. Fitzgibbon and Maurizio Pilu and Robert B. Fisher},
  journal={Proceedings of 13th International Conference on Pattern Recognition},
  pages={253-257 vol.1}
This paper presents a new efficient method for fitting ellipses to scattered data. Previous algorithms either fitted general conics or were computationally expensive. By minimizing the algebraic distance subject to the constraint 4ac-b/sup 2/=1 the new method incorporates the ellipticity constraint into the normalization factor. The new method combines several advantages: 1) it is ellipse-specific so that even bad data will always return an ellipse; 2) it can be solved naturally by a… 

Figures from this paper

This paper presents a numerically stable non-iterative algorithm for fit ting an ellipse to a set of data points. The approach is based on a least squares minimization and it guarantees an
Robust Legendre Moments Ellipse Fitting from Noisy Image
A new statistical approach based on the expansion of the probability density function in terms of Legendre polynomials which guarantees the extraction of an ellipse even for high rate of outliers and an important level of noise.
Numerically Stable Direct Least Squares Fitting of Ellipses
This paper presents a numerically stable non-iterative algorithm for fitting an ellipse to a set of data points based on a least squares minimization which leads to a simple, stable and robust fitting method which can be easily implemented.
Constrained Least Squares Fitting of Ellipse
  • Yuanpeng Liu, Xiaoyan Dong
  • Computer Science
    2010 International Conference on Computational Intelligence and Software Engineering
  • 2010
A new efficient algorithm for fitting an ellipse to scattered points by minimizing the algebraic distance subject to the constraint of length of semi-minor axis and incorporating the ellipticity constraint into the normalization factor is presented.
Ellipse-specific direct least-square fitting
This article presents the first direct method for specifically fitting ellipses in the least squares sense, which is directly solved by a generalised eigen-system, has a desirable low-eccentricity bias, and is robust to noise.
Direct least square fitting of ellipsoids
Experimental results demonstrate the validity of the proposed approach and the extension from 2D to 3D for ellipsoid-specific fitting is not easy as mentioned in the main text.
Constrained Ellipse Fitting with Center on a Line
This work makes use of a constrained algebraic cost function with the incorporated “ellipse center on given line”-prior condition in a global convergent one-dimensional optimization approach and shows computational efficiency and numerical stability.
Geometric interpretation and precision analysis of algebraic ellipse fitting using least squares method
This approach is based on coordinate description of the ellipse geometry to determine the error distances of the fitting method based on combined least squares method and the experimental results revealed that it might be a good choice for precision estimation of theEllipse fitting method.
High Accuracy Ellipse-Specific Fitting
A new method is proposed that always fits an ellipse to a point sequence extracted from images by random sampling of data points and has higher accuracy than the methods of Fitzgibbon et al. and Szpak et al., the two methods so far proposed to always return an ellIPse.


Least-squares fitting of circles and ellipses
This paper presents several algorithms which compute the ellipse for which the sum of the squares of the distances to the given points is minimal and these algorithms are compared with classical simple and iterative methods.
Ellipse fitting by accumulating five-point fits
A note on the least squares fitting of ellipses
Segmenting curves into elliptic arcs and straight lines
  • Paul L. Rosin, G. West
  • Physics
    [1990] Proceedings Third International Conference on Computer Vision
  • 1990
A method is described for segmenting edge data into a combination of straight lines and elliptic arcs based on an iterative Kalman filter, guaranteed to produce an elliptical fit even though the best conic fit may be a hyperbola or parabola.
Ellipse detection and matching with uncertainty
Fitting conic sections to "very scattered" data: An iterative refinement of the bookstein algorithm
  • P. Sampson
  • Mathematics
    Comput. Graph. Image Process.
  • 1982
Fitting ellipses and predicting confidence envelopes using a bias corrected Kalman filter
A RANSAC-Based Approach to Model Fitting and Its Application to Finding Cylinders in Range Data
The technique is specifically designed to filter out gross errors before applying a smoothing procedure to compute a precise model in order to solve the problem of locating cylinders in range data.
A Buyer's Guide to Conic Fitting
This paper evaluates several algorithms under various noise and degeneracy conditions, identifies the key parameters which affect sensitivity, and presents the results of comparative experiments which emphasize the algorithms' behaviours under common examples of degenerate data.