检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]同济大学,控制科学与工程系
出 处:《微型电脑应用》2015年第1期17-21,共5页Microcomputer Applications
基 金:上海市科委科技攻关项目(11dz1505202)
摘 要:传统的3次Bezier曲线拟合方法在拟合汉字轮廓曲线时,迭代次数多,效率较低。针对拟合的效率,设计了一种基于3次Bezier曲线的汉字曲线轮廓拟合新方法。该方法的核心是简单高效的参数迭代算法。在3次Bezier曲线控制点的求取方法上,采用最小二乘法拟合;在参数的优化问题上,用过型值点重心的直线与拟合曲线间的交点求解参数,迭代优化参数取值。该迭代算法占用资源少,运算量小,计算简便。实验结果表明,针对一般型值点和汉字轮廓特征点的曲线拟合,在相同精度要求下,该算法迭代次数少,收敛速度快,能达到更好的拟合效果。When Fitting Chinese outline outline curves, the traditional cubic Bezier curve fit method is short fortoo many iterations and low efficiency. In response to the curve fit efficiency, the paper designs a new algorithrntofit Chinese outline fonts basedoncubic Bezier curve. The key of this method is a parameter iterative algorithm which is simple and efficient. Least-squares solution is ap- plied to get the control points of cubic Bezier curves. In terms ofparameters optimization, intersections of lines that cross the contour center and fitting curve are used to calculate parameter through iterative optimization. Compared with traditional curve fitting me- thod, this method has lowcost inealculation and is easy to compute. From the experiments with common data points and Chinese outline fonts, it is found that the results ofthe proposed method is better with less iterationsand faster in the speed of convergence rate under the same precision condition.
关 键 词:Bezier曲线拟合 最小二乘法 型值点重心迭代 汉字曲线轮廓描述
分 类 号:TP311.13[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.144.154.109