Direct least Square Fitting of Ellipses (1998)
Cached
Download Links
- [www.hpl.hp.com]
- [ftp.dai.ed.ac.uk]
- [ftp.dai.ed.ac.uk]
- [www.cs.ucsd.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 186 - 3 self |
BibTeX
@MISC{Fitzgibbon98directleast,
author = {Andrew Fitzgibbon and Maurizio Pilu and Robert B. Fisher},
title = {Direct least Square Fitting of Ellipses},
year = {1998}
}
Years of Citing Articles
OpenURL
Abstract
This work 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² = 1 the new method incorporates the ellipticity constraint into the normalization factor. The proposed method combines several advantages: (i) It is ellipse-specific so that even bad data will always return an ellipse; (ii) It can be solved naturally by a generalized eigensystem and (iii) it is extremely robust, efficient and easy to implement.







