The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Direct least squares fitting of ellipses
Abstract
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 generalized eigensystem, and 3) it is extremely robust, efficient and easy to implement. We compare the proposed method to other approaches and show its robustness on several examples in which other nonellipse-specific approaches would fail or require computationally expensive iterative refinements.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fitting conic sections to "very scattered" data: An iterative refinement of the bookstein algorithm
Sampson, P. D. (1982) · Computer Graphics and Image Processing · doi:10.1016/0146-664x(82)90101-0 · Cited by 358
Cited by
A Unifying Theory for Central Panoramic Systems and Practical Implications
Geyer, C., & Daniilidis, K. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45053-x_29 · Cited by 502
Onboard Autonomous rock shape analysis for Mars rovers
Fox, J., Castano, R., & Anderson, R. C. (2003) · Proceedings, IEEE Aerospace Conference · doi:10.1109/aero.2002.1035371 · Cited by 38
Metadata
- Authors
- Fitzgibbon, A. W., Pilu, M., & Fisher, R. B.
- Venue
- Proceedings of 13th International Conference on Pattern Recognition
- Publisher
- IEEE
- Published
- 1996
- Pages
- 253-257 vol.1
- ISSN
- 1041-3278 (ISSN-L)
- OpenAlex
- W4237371814
- Cited by
- 289
- References
- 1
- FWCI
- 5.43
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Direct least squares fitting of ellipses. https://app.cochat.ai/papers/10.1109/icpr.1996.546029
- The paper
- Fitzgibbon, A. W., Pilu, M., & Fisher, R. B. (1996). Direct least squares fitting of ellipses. Proceedings of 13th International Conference on Pattern Recognition. https://doi.org/10.1109/icpr.1996.546029
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
