Direct least square fitting of ellipses

Direct least square fitting of ellipses
复制标题

DOI:
10.1109/34.765658
复制
发表时间:
1999-05-01
影响因子:
23.6
通讯作者:
Fisher, RB
Fisher, RB
中科院分区:
计算机科学1区
文献类型:
--
作者:
Fitzgibbon, A;Pilu, M;Fisher, RB

文献摘要

被引文献

相似文献

本文提出了一种对散乱数据进行椭圆拟合的新方法。以前的算法要么适合一般的二次曲线,要么计算量大。通过最小化约束为4ac-b(2)=1的代数距离,新方法将椭圆性约束融入到归一化因子中。提出的方法结合了几个优点:它是特定于椭圆的,因此即使是坏的数据也总是返回椭圆。它可以用广义本征系统自然地求解。它非常健壮、高效且易于实现。
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(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.