Constructive fitting and extraction of geometric primitives
Graphical Models and Image Processing
Efficiency of Characterizing Ellipses and Ellipsoids by Discrete Moments
IEEE Transactions on Pattern Analysis and Machine Intelligence
An elementary algorithm for digital arc segmentation
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Arc-based evaluation and detection of ellipses
Pattern Recognition
Fast polynomial segmentation of digitized curves
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Topological relations between separating circles
Discrete Applied Mathematics
| Hi-index | 0.00 |
We propose a simple method for fitting ellipses to data sets. The method first computes the fitting cost of small samples, called elemental subsets. We then prove that the global fitting cost can be easily derived from the fitting cost of the samples. Since fitting costs are computed from small samples, the technique can be incorporated in many ellipse detection and recognition algorithms, and in particular, in algorithms that make use of incremental fitting. Some of the theoretical results are formulated in the more general setting of implicit curve fitting.