Enhanced direct least square fitting of ellipses
This paper presents a robust and direct algorithm for the least-square fitting of ellipses to scattered data. The proposed algorithm makes use of well-known techniques that improve the robustness of the direct least-square fitting with a modest increase of the computational burden. Furthermore, by trivial modifications of the constrained minimization problem the algorithm may be converted to perform the specific fitting of other types of conics such as hyperbola. The method is simple and accurate and can be implemented with fixed time of computation. These characteristics coupled to its robustness and specificity makes the algorithm well-suited for applications requiring real-time machine vision.
least squares fitting constrained minimization conic fitting