New Methods for Detecting Concentric Objects With High Accuracy
Ali A. Al-Sharadqah, Lorenzo Rull

TL;DR
This paper introduces new statistical methods for accurately detecting concentric geometric objects, such as ellipses, in digitized data, improving robustness and initial estimation for iterative fitting in various applications.
Contribution
The paper develops a general statistical framework, derives variances and biases of existing methods, and proposes new estimators that outperform existing non-iterative approaches.
Findings
New estimators provide more reliable initial guesses.
Proposed methods outperform existing non-iterative techniques.
Methods are robust against large noise levels.
Abstract
Fitting concentric geometric objects to digitized data is an important problem in many areas such as iris detection, autonomous navigation, and industrial robotics operations. There are two common approaches to fitting geometric shapes to data: the geometric (iterative) approach and algebraic (non-iterative) approach. The geometric approach is a nonlinear iterative method that minimizes the sum of the squares of Euclidean distances of the observed points to the ellipses and regarded as the most accurate method, but it needs a good initial guess to improve the convergence rate. The algebraic approach is based on minimizing the algebraic distances with some constraints imposed on parametric space. Each algebraic method depends on the imposed constraint, and it can be solved with the aid of the generalized eigenvalue problem. Only a few methods in literature were developed to solve the…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Statistical Methods and Models · Soil Geostatistics and Mapping · Leaf Properties and Growth Measurement
