- ORTHOGONAL DISTANCE FITTING OF ELLIPSES
- Kim, Ik-Sung ;
- Communications of the Korean Mathematical Society, volume 17, issue 1, 2002, Pages 121~142
- DOI : 10.4134/CKMS.2002.17.1.121

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.