最小二乘法的椭圆拟合.pdfVIP

2008 年 3 月 March 2008 北京航空航天大学学报 第34 卷第3 期 Journal of Beijing University of Aeronautics and Astronautics Vo l. 34 No.3 基于最小二乘法的椭圆拟合改进算法 闰蓓 王斌 李娱 (北京航空航天大学自动化科学与电气工程学院，北京 100083 ) 摘 要:基于最小二乘法研究了一种改进的椭圆拟合算法.最小二乘椭圆拟合算法， 由于包含误差较大样本点在内的所有样本点都参与运算，所以会对椭圆拟合的最后结果产生 偏差.针对这种情况，采用随机理论的思想，先随机选取 6 个点拟合椭圆，然后计算与此椭圆匹 配的所有样本点个数.重复此过程一定次数，采用投票机制，匹配样本点多的椭圆即为最优椭 圆，构造了一种快速准确剔除误差较大样本点的改进椭圆拟合算法，并在实际图像应用中验证 了算法能够有效地处理包含有较大比例误差点的样本空间，拟合出具有高精度的椭圆，并且算 法的速度能够满足实时性的要求. 关 键 词:最小二乘拟合;曲线拟合;椭圆拟合 中图分类号: 024 1. 5 文献标识码:A 文章编号: 1001-5965 (2008) 03-0295-04 Optimal ellipse fitting method based on least-square principle Yan Bei Wang Bin Li Yuan (School of Automation Science and Electrical Engineering , ßeijing University of Aeronautics and Astronautics , ßeijing 100083 , China) Abstract: The fragmental ellipse fitting algorithm based on least square was studied. The ellipse-con- straint algebraic fitting always provides an elliptical solution , but the bias is inevitably added to result because the algorithm involves all the sample data including some much biased data. Based on this situation , the ran- dom theOIγwas introduced. First , an ellipse was fitted by six points which were selected randomly. Then the number of points which match the ellipse was calculated. Repeating the process some times , according to the voting mechanism , the best ellipse is the ellipse whose matching point number is largest. A rapid algorithm with the ability to abandon the biased sample data was presented. The application of algorithm in a real-time image processing system demonstrates that this algorithm can eff