Error analysis for circle fitting algorithms

From MaRDI portal
Publication:1952007

DOI10.1214/09-EJS419zbMATH Open1268.65022arXiv0907.0421MaRDI QIDQ1952007FDOQ1952007


Authors: Ali Al-Sharadqah, Nikolai Chernov Edit this on Wikidata


Publication date: 27 May 2013

Published in: Electronic Journal of Statistics (Search for Journal in Brave)

Abstract: We study the problem of fitting circles (or circular arcs) to data points observed with errors in both variables. A detailed error analysis for all popular circle fitting methods -- geometric fit, Kasa fit, Pratt fit, and Taubin fit -- is presented. Our error analysis goes deeper than the traditional expansion to the leading order. We obtain higher order terms, which show exactly why and by how much circle fits differ from each other. Our analysis allows us to construct a new algebraic (non-iterative) circle fitting algorithm that outperforms all the existing methods, including the (previously regarded as unbeatable) geometric fit.


Full work available at URL: https://arxiv.org/abs/0907.0421




Recommendations




Cites Work


Cited In (19)





This page was built for publication: Error analysis for circle fitting algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1952007)