基于混沌粒子群优化的图像相关匹配算法研究

杨延西; 刘丁; 辛菁

doi:10.3724/SP.J.1146.2006.01344

基于混沌粒子群优化的图像相关匹配算法研究

doi: 10.3724/SP.J.1146.2006.01344

基金项目:

国家自然科学基金(60675048)，教育部科学技术研究重大项目(204181)和陕西省教育厅基金(04JK248)资助课题

计量
- 文章访问数: 3540
- HTML全文浏览量: 68
- PDF下载量: 1051
- 被引次数: 0
出版历程
- 收稿日期: 2006-09-07
- 修回日期: 2007-01-24
- 刊出日期: 2008-03-19

Research of Image Correlation Matching Method Based on CPSO

摘要

摘要: 该文将混沌优化搜索技术应用于粒子群优化算法(PSO)，提出了一种基于混沌搜索的粒子群优化算法(CPSO)，该算法利用了PSO算法的收敛快速性和混沌运动的遍历性、随机性等特点，采用混沌初始化粒子初始位置，在运行过程中根据粒子群适应度的方差来自适应混沌更新粒子位置。几种典型函数的测试结果表明：CPSO提高了对多维空间的全局搜索能力，并可以有效避免早熟现象。将该方法用于图像相关匹配算法，提出了一种新的基于CPSO的图像相关匹配算法。实验结果证明该方法对解决噪声情况下的图像匹配问题十分有效。
- 图像相关匹配; 图像匹配; 粒子群优化算法; 混沌
Abstract: A Chaos Particle Swarm Optimization (CPSO) algorithm is presented. The initial location of the particle is evaluated by chaos. During the running time, according to the variance of the populations fitness, the chaotic location update of the particle is performed adaptively. The experimental results using the testing functions show that CPSO is able to search the global optimizer and avoiding the premature convergence on the multidimensional variable space. Applied the algorithm to image correlation matching, a new image correlation matching method based on CPSO is presented. The experimental results show that this method is very effective for image matching processing with noise.

HTML全文

参考文献(1)

Chalermwat P, El-Ghazawi T, and Le Moigne J. Two-phasegenetic algorithm-based image registration on parallelclusters [J].Journal of Future Generation ComputingSystems.2001, 17(3):467-476[2]Brumby S, Theiler J, and Perkins S, et al.. Investigation offeature extraction by a genetic algorithm[R]. in Proc. 1999,SPIE 3812: 24-31.[3]徐建斌, 洪文, 吴一戎. 一种基于距离变换和遗传算法的遥感图像匹配算法[J].电子与信息学报.2005, 27(7):1009-1012浏览[4]熊兴华, 钱增波, 王任享. 遗传算法与最小二乘相结合的遥感图像子像素匹配[J]. 测绘学报, 2001(30), 1: 54-59.Xiong Xing-hua, Qian Zeng-bo, and Wang Ren-xiang. Aremote sensing image subpixel matching combined geneticalgorithm with least square matching[J]. Acta Geodaetica EtCartographic Sinica, 2001(30), 1: 54-59.[5]Kennedy J and Eberhart R. Particle swarm optimization[R].Proc. IEEE Int. Conf. on Neural Networks, IV, Piscataway,NJ: IEEE Service Center, 1995: 1942-1948.[6]Shi Y H and Eberhart R C. Parameter selection in particleswarm optimization[R]. In proc. of the 7th Annual Conf. onEvolutionary Programming, New York, 1998: 591-600.[7]Angeline P J. Using selection to improve particle swarmoptimization[R]. Proceedings of the IEEE Congress onEvolutionary Computation, Anchorage, Alaska, May 4-9,1998: 84-89.[8]Clerc M. The swarm and queen: Towards a deterministicand adaptive particle swarm optimization[R]. Proceedingsof the IEEE Congress on Evolutionary Computation,Washington, DC, 1999: 1951-1957.[9]杨俊杰, 周建中, 喻菁等. 基于混沌搜索的粒子群优化算法[J].计算机工程与应用, 2005(16): 69-71.Yang Jun-jie, Zhou Jian-zhong, and Yu Jing, et al.. Particleswarm optimization algorithm based on chaos searching[J].Computer Engineering and Applications, 2005(16): 69-71.[10]唐巍, 郭镇明, 唐嘉亨等. 复杂函数优化的混沌遗传算法[J].哈尔滨工程大学学报, 2000, 21(5): 1-5.Tang Wei, Guo Zhenming, and Tang Jiaheng, et al..Optimizing complex functions by chaos genetic algorithm[J].Journal of Harbin Engineering University, 2000, 21(5):1-5.[11]刘永红. 图像匹配时矩的高效算法[J].信号处理, 1996,12(4): 356-361.Liu Yong-hong. A high efficient image moments matchingalgorithm [J]. Signal Processing, 1996, 12(4): 356-361.

施引文献

资源附件(0)

访问统计