参照解约束下数字曲线多边形逼近的PSO算法  

A PSO algorithm for polygonal approximation of digital curves restricted by solution of reference

作　　者：董方敏[1] 李倩[1] 刘勇[1] 肖人彬[2] 孙仁好 

机构地区：[1]三峡大学电气信息学院,湖北宜昌443002 [2]华中科技大学控制科学与工程系,湖北武汉430074 [3]湖北省电力建设第二工程公司,湖北武汉430030

出　　处：《武汉大学学报（工学版）》2008年第4期131-134,共4页Engineering Journal of Wuhan University

基　　金：国家自然科学基金项目(编号:60474077);湖北省数字化纺织装备重点实验室开放基金(编号:DTL200712)

摘　　要：提出了一种参照解约束下的数字曲线多边形逼近的PSO求解算法.该算法将参照解多边形各顶点与PSO求解中间解对应顶点的误差和及方差作为误差测度,将其与现有文献的PSO算法的误差测度进行加权组合形成新的适应度函数.采取调整两个权重系数来灵活控制参照解的约束强度,以满足各种不同的具体要求.通过实例验证表明了该算法的有效性.A PSO algorithm for polygonal approximation of digital curves restricted by the solution of reference is proposed. The algorithm uses the variance and sum of errors from each vertex of the reference solution polygon and corresponding vertices of the intermediate solution which is solved by PSO algorithm as the measure of errors, bringing about a new fitness function which is weighted combination between this measure of errors and the existing PSO algorithm ＇ s, controlling the binding strength of reference solution through adjusting the two weighted factors, to satisfy the variety of specific requirements. The validity of this algorithm has been proved through examples.

关 键 词：数字曲线 多边形逼近 参照解 PSO算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]