Least squares fitting of circles and lines
N. Chernov, C. Lesort
TL;DR
This paper investigates the theoretical foundations and computational methods for least squares fitting of circles and arcs, introduces a new reliable algorithm, and compares algebraic fitting techniques.
Contribution
It provides a comprehensive analysis of existence, uniqueness, and parametrization in circle fitting, and proposes a novel, more reliable fitting algorithm.
Findings
New algorithm surpasses existing methods in reliability
Analysis of existence and uniqueness conditions for circle fitting
Comparison of algebraic circle fitting methods
Abstract
We study theoretical and computational aspects of the least squares fit (LSF) of circles and circular arcs. First we discuss the existence and uniqueness of LSF and various parametrization schemes. Then we evaluate several popular circle fitting algorithms and propose a new one that surpasses the existing methods in reliability. We also discuss and compare direct (algebraic) circle fits.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsImage and Object Detection Techniques · Advanced Surface Polishing Techniques · Image Processing and 3D Reconstruction