检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]兰州理工大学计算机与通信学院,兰州730050
出 处:《计算机应用》2008年第10期2622-2624,2627,共4页journal of Computer Applications
基 金:甘肃省自然科学研究基金项目(0803RJZA025)
摘 要:主动轮廓线模型凹陷边界点的寻优属于动态优化问题,由于其复杂性,传统方法不能准确搜索到最佳边界点。若采用单一的粒子群优化算法求解,不仅耗时,而且容易陷入局部极值。针对以上问题,提出一种多种群粒子群优化算法,并将其应用于主动轮廓线模型的边界寻优过程中。该算法为每个控制点设置一个种群,各种群之间通过共享信息的方式协作寻优,从而避免采用单一PSO算法容易早熟的缺点,同时扩大了控制点的搜索区域,提高了收敛速度。将改进方法与传统方法进行了对比,实验结果证明了改进方法的有效性。Searching for the object's concavities of active contour model (Snake model) is a dynamic optimization problem. Due to its complexity, the traditional active contour model and single particle swarm optimization algorithm converge slowly and easily converge to local optima. Aiming at the above problems, multi-swarm PSO algorithm was proposed to apply in active contour models for the sake of expanding the control point of the searching area and optimizing convergence speed. In this algorithm, every control point was corresponding to one swarm. Sub-swarms worked together via information sharing. The results obtained by the multi-swarm PSO algorithm have been compared with that of single PSO algorithm and the conventional method. Experimental results show that the proposed algorithm is more efficient.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249