Answers are grounded in this paper and cite their sources.
Computational analysis demonstrates robust and efficient ellipse fitting on scattered data, suggesting an optimal direct eigensystem solution for geometric curve estimation.
This work 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 proposed method combines several advantages: It is ellipse-specific, so that even bad data will always return an ellipse. It can be solved naturally by a generalized eigensystem. It is extremely robust, efficient, and easy to implement.
No takes yet. Share an insight, caveat, or question.
Fitzgibbon et al. (1999) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: