The DOI matches its Crossref record; 12 of the 12 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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
The Algebraic Eigenvalue Problem
I., E., & Wilkinson, J. H. (1966) · Mathematics of Computation · doi:10.2307/2003558 · Cited by 5,140
Optimization—Theory and Applications
Cesari, L. (1983) · Springer eBooks · doi:10.1007/978-1-4613-8165-5 · Cited by 2,559
Taubin, G. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.103273 · Cited by 1,147
Least-squares fitting of circles and ellipses
Gander, W., Golub, G. H., & Strebel, R. (1994) · BIT · doi:10.1007/bf01934268 · Cited by 860
Recovery of parametric models from range images: the case for superquadrics with global deformations
Solina, F., & Bajcsy, R. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.44401 · Cited by 603
Fitting conic sections to scattered data
Bookstein, F. L. (1979) · Computer Graphics and Image Processing · doi:10.1016/0146-664x(79)90082-0 · Cited by 528
Trucco, E. (1995) · AI Communications · doi:10.3233/aic-1995-8111 · Cited by 472
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
A Buyer's Guide to Conic Fitting.
Fitzgibbon, A., & Fisher, R. (1995) · Procedings of the British Machine Vision Conference 1995 · doi:10.5244/c.9.51 · Cited by 316
Self-citationA RANSAC-based approach to model fitting and its application to finding cylinders in range data
Bolles, R. C., & Fischler, M. A. (1981) · International Joint Conference on Artificial Intelligence · Cited by 303
A note on the least squares fitting of ellipses
Rosin, P. L. (1993) · Pattern Recognition Letters · doi:10.1016/0167-8655(93)90062-i · Cited by 207
Detecting partially occluded ellipses using the Hough transform
Yuen, H. K., Illingworth, J., & Kittler, J. (1989) · Image and Vision Computing · doi:10.1016/0262-8856(89)90017-6 · Cited by 201
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
Least-squares orthogonal distances fitting of circle, sphere, ellipse, hyperbola, and parabola
Ahn, S. J., Rauh, W., & Warnecke, H.-J. (2001) · Pattern Recognition · doi:10.1016/s0031-3203(00)00152-7 · Cited by 374
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
- 12
- 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
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.