基于混沌变异粒子群优化算法的图像稀疏分解  

Image Sparse Decomposition Based on Particle Swarm Optimization with Chaotic Mutation

作　　者：李恒建[1] 尹忠科[1] 张家树[1] 王建英[1] 

机构地区：[1]西南交通大学信息科学与技术学院,四川成都610031

出　　处：《西南交通大学学报》2008年第4期509-513,共5页Journal of Southwest Jiaotong University

基　　金：国家自然科学基金资助项目(60602043;60772084);四川省重点科技项目(04GG021-020-5;2006X15-038);四川省应用基础研究项目(04JY029-2;2006J13-114)

摘　　要：提出了基于改进的粒子群优化(PSO)算法的匹配追踪算法,用于快速图像稀疏分解.改进的PSO算法利用尺度收缩混沌变异的精细局部搜索性能,使稀疏分解的匹配追踪算法具有良好的全局寻优能力,提高了稀疏分解在冗余字典中原子匹配的速度和准确度.用二维墨西哥草帽函数作为冗余字典的生成函数,以增强对图像边缘和轮廓的表达能力.仿真结果表明,用提出的算法实现图像稀疏分解比用遗传算法和PSO更快更有效,重建图像的视觉效果好.A matching pursuit algorithm based on an improved particle swarm optimization （PSO） was proposed for sparse decomposition of images. The improved PSO uses the fine local search ability of the shrinking chaotic mutation to make the matching pursuit have good global search ability, improves the accuracy and increases the speed of atom matching in the redundant dictionary. The redundant dictionary employs the 2D Mexican hat function as the generating function to represent the edges and contours of images efficiently. Simulation results show that the proposed method is better than the general genetic and PSO algorithms both in speed and visual quality of the reconstructed images.

关 键 词：图像处理 稀疏分解 匹配追踪 粒子群优化算法 尺度收缩混沌变异 

分 类 号：TN911.73[电子电信—通信与信息系统] TP391.4[电子电信—信息与通信工程]