JOURNAL BROWSE
Search
Advanced SearchSearch Tips
ORTHOGONAL DISTANCE FITTING OF ELLIPSES
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
ORTHOGONAL DISTANCE FITTING OF ELLIPSES
Kim, Ik-Sung;
  PDF(new window)
 Abstract
We are interested in the curve fitting problems in such a way that the sum of the squares of the orthogonal distances to the given data points is minimized. Especially, the fitting an ellipse to the given data points is a problem that arises in many application areas, e.g. computer graphics, coordinate metrology, etc. In [1] the problem of fitting ellipses was considered and numerically solved with general purpose methods. In this paper we present another new ellipse fitting algorithm. Our algorithm if mainly based on the steepest descent procedure with the view of ensuring the convergence of the corresponding quadratic function Q(u) to a local minimum. Numerical examples are given.
 Keywords
orthogonal distance;fitting of ellipses;least squares;
 Language
English
 Cited by
1.
Guaranteed Ellipse Fitting with a Confidence Region and an Uncertainty Measure for Centre, Axes, and Orientation, Journal of Mathematical Imaging and Vision, 2015, 52, 2, 173  crossref(new windwow)
 References
1.
BIT, 1994. vol.34. pp.558-578 crossref(new window)

2.
Solving problems in scientific computing using maple and matlab, 1993. pp.251-266

3.
Proceedings of IMACS-GAMM Inter. Symposium on Numerical Methods and Error Bounds, 1995. pp.261-269

4.
Comp. J., 1971. vol.14. pp.169-172 crossref(new window)