检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:狄金海[1]
出 处:《计算机工程与应用》2009年第25期195-197,共3页Computer Engineering and Applications
摘 要:传统的小生境遗传算法收敛太慢,且容易陷入局部最优,对小生境算法做出以下三点改进:一是将解空间划分为多层区域,每层使用不同的距离因子;二是采用差值编码方式,使得算法更易收敛;三是使用伪并行加速算法,改进经典的邻居模型为镜像邻居模型。实验表明改进算法的PSNR比常用的遗传算法以及小生境算法高0.2~0.3dB,且运算时间仅有它们的40%~50%。Traditional Niche Genetic Algorithm(NGA) converges too slowly and is easy to trap in local extrema,thus it is modified in three aspects:Firstly,solution space is partitioned into muhi-layers,and distance factors are forced to vary with layers.Secondly, difference value coding method is adopted to guarantee that this proposed algorithm converges more easily.Finally,the traditional neighborhood model is meliorated into a repeat-neighborhood model.Simulations demonstrate that this Adaptive Niche Genetic Algorithm(ANGA) performs better than the popular GA and NGA.PSNR of ANGA is 0.2-0.3 dB higher than other algorithms while the consumed time of ANGA is only 40%-50% of other algorithms.
分 类 号:TN911.73[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.80