首页 | 本学科首页   官方微博 | 高级检索  
     

混沌微粒群优化算法在图像匹配中的应用
引用本文:黄力明.混沌微粒群优化算法在图像匹配中的应用[J].计算机工程与应用,2009,45(32):168-170.
作者姓名:黄力明
作者单位:镇江高等专科学校 电子信息系,江苏 镇江 212003
摘    要:针对传统图像匹配计算量较大、匹配速度慢、抗干扰能力差的问题,将混沌算子与微粒群优化算法相结合,提出一种鲁棒性强、计算速度快的图像匹配方法。该算法利用微粒群优化算法的收敛快速性和混沌运动的遍历性、随机性等特点,实现了非遍历性搜索。在算法初始化阶段,对粒子位置混沌初始化;在算法运行期间,对优秀个体进行混沌扰动避免落入局部最优。提高了算法对多维空间的全局搜索能力,并可以有效避免早熟现象。实验结果表明该算法的图像匹配具有快速性和较高的准确性,对解决噪声情况下的图像匹配问题十分有效。

关 键 词:图像匹配  微粒群优化算法  适应度函数  混沌  
收稿时间:2009-4-20
修稿时间:2009-6-29  

Application of Chaos Particle Swarm Optimization algorithm in image matching
HUANG Li-ming.Application of Chaos Particle Swarm Optimization algorithm in image matching[J].Computer Engineering and Applications,2009,45(32):168-170.
Authors:HUANG Li-ming
Affiliation:Department of Electronics and Information,Zhenjiang College,Zhenjiang,Jiangsu 212003,China
Abstract:For the problems of the image matching are computationally expensive and slow speed and poor robustness,by introducing chaos state into the original Particle Swarm Optimization(PSO),this paper proposes a new algorithm Chaos Particle Swarm Optimization (CPSO).The new algorithm makes good use of the properties-ergodicity,randomicity, and initial sensitivity of chaos, which realizes non-ergodic searching and can be used to find the best matching point very quickly.At the beginning,the location of the particle is evaluated by chaos.During the running time,chaos perturbation is utilized to avoid the search being trapped in local optimum.CPSO is able to search the global optimizer and avoid the premature convergence on the multidimensional variable space.The experimental results indicate that this approach has high speed and accuracy in image matching and is very effectivefor image matching processing with noise.
Keywords:image matching  particle swarm optimization algorithm  fitness function  chaos
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号