量子势阱粒子群优化算法的改进研究

为提高量子势阱粒子群优化算法的优化能力, 通过分析目前量子势阱粒子群优化算法的设计过程, 提出了改进的量子势阱粒子群优化算法. 首先, 分别基于Delta势阱、谐振子和方势阱 提出了改进的量子势阱粒子群优化算法, 并提出了基于统计量均值的控制参数设计方法. 然后, 在势阱中心的设计方面, 为强调全局最优粒子的指导作用, 提出了基于自身最优粒子加权平均和动态随机变量的两种设计策略. 实验结果表明, 三种势阱粒子群优化算法性能比较接近, 都优于原算法, 且Delta势阱模型略优于其他两种.     

基于粒子群优化算法的自适应图像分割方法

提出了一种基于粒子群优化算法的图像分割新方法。粒子群优化(PSO)算法是一类随机全局优化技术,它通过粒子间的相互作用发现复杂搜索空间中的最优区域缩短了寻找阈值的时间。将PSO用于基于改进的最佳加权熵阈值法的图像分割中,试验结果表明,该方法不仅能够避免陷入局部极值,而且其速度得到了明显的改善,是一种有效的图像分割新方法。     

基于Bloch球面搜索的量子粒子群优化算法

通过分析量子势阱粒子群优化算法的设计过程,提出一种基于Bloch球面搜索的量子粒子群优化算法.首先用基于Bloch球面描述的量子位描述粒子,用泡利矩阵建立旋转轴,用Delta势阱模型计算旋转角度,用量子位在Bloch球面上的绕轴旋转实现搜索.然后用Hadamard门实现粒子变异,以避免早熟收敛.这种旋转可使当前量子位沿着Bloch球面上的大圆逼近目标量子位,从而可加速优化进程.仿真结果表明,该算法的优化能力优于原算法.     

A hybrid membrane evolutionary algorithm for solving constrained optimization problems

Solving constrained optimization problems (COPs) is a central research topic in the field of optimization. Given the complexity of COPs, it is difficult to solve them with traditional optimization techniques. In this paper, a hybrid membrane evolutionary algorithm (HMEA) is proposed. It combines a one-level membrane structure with a particle swarm optimization (PSO) local search algorithm. The simulation results show that the proposed algorithm is valid and outperforms the state-of-the-art algorithms.     

一种强噪声背景下微弱超声信号提取方法研究

为解决在强噪声背景下获取超声信号的难题,基于粒子群优化算法和稀疏分解理论提出一种强噪声背景下微弱超声信号提取方法.该方法将降噪问题转换为在无穷大参数集上对函数进行优化的问题,首先以稀疏分解理论和超声信号的结构特点为依据构建了粒子群优化算法运行所需要的目标函数及去噪后信号的重构函数,从而将粒子群优化算法和超声信号降噪联系在一起;然后根据粒子群优化算法可以在连续参数空间寻优的特点建立了用于匹配超声信号的连续超完备字典,并采用改进的自适应粒子群优化算法在该字典中对目标函数进行优化;最后根据对目标函数在字典上的优化结果确定最优原子,并利用最优原子按照重构函数重构出降噪后的超声信号.通过对仿真超声信号和实测超声信号的处理,结果表明本文提出的方法可以有效提取信噪比低至-4 dB的强噪声背景下的微弱超声信号,且和基于自适应阈值的小波方法相比本文方法表现出更好的降噪性能.     

群体智能优化中的虚拟碰撞：雨林算法

启发式优化算法中寻优代理过早收敛易陷入局部最优. 本文对此进行机理分析并发现, 虚拟碰撞作为一种隐性过早收敛现象将直接影响群体智能优化算法的准确性与快速性, 而采样过程的无约束性和样本分布信息的缺失是导致虚拟碰撞的根本原因. 为解决上述问题, 本文提出雨林优化算法. 该算法仿照植物生长模式, 利用规模可变种群代替规模限定种群进行分区分级寻优采样, 并结合均匀与非均匀采样原则来权衡优化算法的探索与挖掘, 可以有效减少虚拟碰撞的发生, 在提高寻优效率的同时, 获取精准性和稳定性较高的全局最优解. 与遗传算法、粒子群算法对标称函数的寻优对比实验表明, 雨林算法在快速性、准确性以及泛化能力等方面均具有优势. 关键词： 优化算法 群体智能 进化计算 计算智能     

Improving the performance of DCT-based fragile watermarking using intelligent optimization algorithms

The performance of a fragile watermarking method based on discrete cosine transform (DCT) has been improved in this paper by using intelligent optimization algorithms (IOA), namely genetic algorithm, differential evolution algorithm, clonal selection algorithm and particle swarm optimization algorithm. In DCT based fragile watermarking techniques, watermark embedding can usually be achieved by modifying the least significant bits of the transformation coefficients. After the embedding process is completed, transforming the modified coefficients from the frequency domain to the spatial domain produces some rounding errors due to the conversion of real numbers to integers. The rounding errors caused by this transformation process were corrected by the use of intelligent optimization algorithms mentioned above. This paper gives experimental results which show the feasibility of using these optimization algorithms for the fragile watermarking and demonstrate the accuracy of these methods. The performance comparison of the algorithms was also realized.     

A comparative study between LMS and PSO algorithms on the optical channel estimation for radio over fiber systems

In this paper the particle swarm optimization (PSO) and least mean square (LMS) algorithms are comparatively studied to estimate the optical communication channel parameters for radio over fiber systems. It is observed that especially in low noise one tap optical channels, the convergence of LMS algorithm is approximately same with PSO algorithm. On the other hand, as a communication medium, selecting high noisy fiber optical channels or free space optical channels; PSO reaches better mean square error values. The computational complexity which is one of the most important features for optimization algorithms has also been taken into account.     

A New Two-Stage Algorithm for Solving Optimization Problems

Optimization seeks to find inputs for an objective function that result in a maximum or minimum. Optimization methods are divided into exact and approximate (algorithms). Several optimization algorithms imitate natural phenomena, laws of physics, and behavior of living organisms. Optimization based on algorithms is the challenge that underlies machine learning, from logistic regression to training neural networks for artificial intelligence. In this paper, a new algorithm called two-stage optimization (TSO) is proposed. The TSO algorithm updates population members in two steps at each iteration. For this purpose, a group of good population members is selected and then two members of this group are randomly used to update the position of each of them. This update is based on the first selected good member at the first stage, and on the second selected good member at the second stage. We describe the stages of the TSO algorithm and model them mathematically. Performance of the TSO algorithm is evaluated for twenty-three standard objective functions. In order to compare the optimization results of the TSO algorithm, eight other competing algorithms are considered, including genetic, gravitational search, grey wolf, marine predators, particle swarm, teaching-learning-based, tunicate swarm, and whale approaches. The numerical results show that the new algorithm is superior and more competitive in solving optimization problems when compared with other algorithms.     

SVM参数优化方法分析与决策

针对支持向量机应用过程中的参数选择问题,从UCI数据库选择样本集,分别采用传统的网格法、智能优化算法中的粒子群法及遗传算法实现核函数参数寻优过程,将所得最佳参数应用到样本测试中。在深入分析优化过程中各参数关系、参数对支持向量机性能的影响以及传统与智能优化算法的优劣后,得出了核函数优化策略。即先使用智能优化算法初步确定最优解范围,再结合网格法进行高精度寻优。实验数据验证了参数优化策略的有效性,为扩大支持向量机泛化率、提高应用性做了铺垫。     

基于多算法优化SVM的粗糙面参数反演

支持向量机（SVM）是粗糙面参数反演中常用的一种反演算法,SVM反演中的惩罚参数C和核函数参数G对反演结果精度的影响较大,若参数取值不当,会使模型产生"过学习"或者"欠学习"的现象,从而降低预测精度.给出几种SVM参数C和参数G的优化算法,如K折交叉验证（K-CV）、遗传算法（GA）和粒子群算法（PSO）,并在此基础上提出一种基于K-CV和GA改进的PSO算法（GA-CV-PSO）.利用矩量法（MoM）获得的粗糙面后向散射系数构造训练集和测试集,通过不同参数反演的仿真结果对比不同优化算法的反演精度和计算时间,表明GA-CV-PSO算法克服了单一优化算法的缺陷,具有更精确的反演精度和更强的泛化能力.     

Learning Competitive Swarm Optimization

Particle swarm optimization (PSO) is a popular method widely used in solving different optimization problems. Unfortunately, in the case of complex multidimensional problems, PSO encounters some troubles associated with the excessive loss of population diversity and exploration ability. This leads to a deterioration in the effectiveness of the method and premature convergence. In order to prevent these inconveniences, in this paper, a learning competitive swarm optimization algorithm (LCSO) based on the particle swarm optimization method and the competition mechanism is proposed. In the first phase of LCSO, the swarm is divided into sub-swarms, each of which can work in parallel. In each sub-swarm, particles participate in the tournament. The participants of the tournament update their knowledge by learning from their competitors. In the second phase, information is exchanged between sub-swarms. The new algorithm was examined on a set of test functions. To evaluate the effectiveness of the proposed LCSO, the test results were compared with those achieved through the competitive swarm optimizer (CSO), comprehensive particle swarm optimizer (CLPSO), PSO, fully informed particle swarm (FIPS), covariance matrix adaptation evolution strategy (CMA-ES) and heterogeneous comprehensive learning particle swarm optimization (HCLPSO). The experimental results indicate that the proposed approach enhances the entropy of the particle swarm and improves the search process. Moreover, the LCSO algorithm is statistically and significantly more efficient than the other tested methods.     

基于混合群智能优化算法的混沌系统参数估计

混沌系统的未知系统参数估计是实现混沌控制和同步的首要问题,通过构造一个合理的适应度函数,可将其转化为一个多维搜索空间的优化问题.提出一种融合改进骨干粒子群算法与改进差分进化算法的混合群智能优化方法来解决上述优化问题.对骨干粒子群算法中的粒子位置更新机制以及差分进化算法中的变异操作、交叉操作、交叉概率因子的设计等进行改进,有效兼顾了种群的多样性与算法的收敛性.在此基础上,讨论骨干粒子群优化算法与差分进化的融合优化策略,实现两个算法的协同进化,进一步提高算法的综合优化性能.用6个基准测试函数以及Lorenz混沌系统为例进行仿真实验,结果表明该方法具有全局寻优能力强、收敛速度快、搜索精度高、稳健性好等优点.     

基于尺度不变特征变换和区域互信息优化的多源遥感图像配准

为了进一步提高遥感图像配准精度, 提出了尺度不变特征变换(SIFT)结合区域互信息优化的遥感图像配准方法. 首先利用混沌序列的随机性和遍历性, 提出一种混沌量子粒子群优化(CQPSO)算法, 在量子粒子群优化(QPSO)算法迭代陷入早熟收敛时, 采用一种新的机理引入混沌序列, 进化粒子克服早熟. 图像配准算法分为预配准和精配准两个过程. 基于SIFT算法提取特征点, 经匹配和有效地外点排除完成预配准, 然后对匹配特征点坐标进行亚像素级微调, 通过最小二乘法求得一系列匹配参数构造初始粒子群, 最后利用混沌量子粒子群优化区域互信息完成精配准, 得到最优匹配参数. 用一些标准测试函数对所提出的CQPSO和QPSO及粒子群优化(PSO)算法进行了实验比较, 另外, 对SIFT, SIFT结合PSO算法优化区域互信息, SIFT结合QPSO算法优化区域互信息和SIFT结合CQPSO算法优化区域互信息(SRC)等四种算法进行了不同分辨率遥感图像配准实验比较和不同时相遥感图像配准实验比较, 实验结果验证了所提出的CQPSO算法的优越性和SRC配准方法的有效性.     

A Hybrid Rao-NM Algorithm for Image Template Matching

This paper proposes a hybrid Rao-Nelder–Mead (Rao-NM) algorithm for image template matching is proposed. The developed algorithm incorporates the Rao-1 algorithm and NM algorithm serially. Thus, the powerful global search capability of the Rao-1 algorithm and local search capability of NM algorithm is fully exploited. It can quickly and accurately search for the high-quality optimal solution on the basis of ensuring global convergence. The computing time is highly reduced, while the matching accuracy is significantly improved. Four commonly applied optimization problems and three image datasets are employed to assess the performance of the proposed method. Meanwhile, three commonly used algorithms, including generic Rao-1 algorithm, particle swarm optimization (PSO), genetic algorithm (GA), are considered as benchmarking algorithms. The experiment results demonstrate that the proposed method is effective and efficient in solving image matching problems.     

基于量子粒子群优化的正交小波加权多模盲均衡算法

针对常数模盲均衡算法(CMA)均衡高阶正交振幅调制信号(QAM)存在收敛速度慢、稳态误差大的缺点, 提出了基于量子粒子群优化的正交小波加权多模盲均衡算法(QPSO-WTWMMA). 该算法根据高阶QAM信号星座图分布特点, 将量子粒子群优化算法(QPSO) 和正交小波变换融入于加权多模盲均衡算法(WMMA)中. 因而, 利用QPSO对均衡器权向量进行了优化, 利用正交小波变换降低了输入信号的自相关性, 利用WMMA选择了合适的误差模型匹配QAM星座图. 理论分析及水声信道仿真结果表明, QPSO-WTWMMA算法可以获得更快的收敛速度和更低的稳态误差, 在水声通信中具有重要的参考价值.     

量子粒子群优化算法的收敛性分析及控制参数研究

通过分析粒子群优化算法的特点,将粒子放在量子空间来描述,建立粒子的量子势能场模型,并结合群体的群集性推导了量子粒子群优化(QPSO)算法.在随机算法全局收敛定理的框架下,讨论了QPSO算法的收敛性,证明QPSO算法是一种全局收敛的算法.针对QPSO算法的唯一控制参数,提出了三种控制策略,结合标准测试函数的仿真结果给出了具有实际指导意义的控制参数选择方法.     

Intelligent reversible watermarking technique in medical images using GA and PSO

The advances in recording, editing, and broadcasting multimedia contents in digital form motivate to protect these digital contents from illegal use, such as duplication, manipulation, and redistribution. However, watermarking algorithms are designed to satisfy requirements of applications, as different applications have different concerns. We intend to design a watermarking algorithm for applications which require high embedding capacity and imperceptibility, to maintain the integrity of the host signal as well as embedded information. Reversible watermarking is a promising technique which satisfies our requirements. In this paper, we concentrate on improving the watermark capacity and reducing the perceptual degradation of an image. We investigated the Luo's [1] additive interpolation-error expansion algorithm and enhanced it by incorporating with two intelligent techniques: genetic algorithm (GA), and particle swarm optimization (PSO). Genetic algorithm is applied to exploit the correlation of image pixel values to obtain better estimation of neighboring pixel values, which results in optimal balance between information storage capacity and imperceptibility. Particle swarm optimization (intelligent technique) is also applied for the same purpose. Experimental results show that PSO and GA nearly give the same results, but GA outperforms the PSO. Experimental results also reveal that the proposed strategy outperforms the state of art works in terms of perceptual quality and watermarking payload.     

基于量子粒子群算法的混沌系统参数辨识

针对混沌系统参数辨识问题, 在基本群智能算法粒子群优化算法的基础上, 提出量子粒子群算法, 测试函数证明了算法具有良好的全局优化能力. 进而将其应用于混沌系统参数辨识问题, 将参数辨识问题转化为多维函数空间上的优化问题. 通过对平衡板热对流典型混沌系统Lorenz系统进行研究, 并与基本算法和遗传算法比较. 仿真实验证明, 算法的有效性, 对混沌理论的发展有着非常重要的意义. 关键词： 量子粒子群算法 混沌系统 系统辨识     

微动粒子群优化算法用于Egun的多参量优化

 针对2维电子光学多参量优化问题,采用微动粒子群优化算法,在给出目标电子轨迹和优化范围的前提下,可以得到趋近于该电子轨迹的真空边界和聚束磁结构。该算法分为前后两阶段：第一阶段采用前后试探法(微动),同时参照最优粒子的信息;第二阶段采用标准粒子群优化算法。针对涉及多个相关参量的电子光学设计问题,标准粒子群优化算法仅能保证以较高概率收敛到局部最佳解,而微动粒子群优化算法能以较高概率收敛到全局最佳解,并且展现了多核计算机在电子光学设计上的潜力。初步的软件试验显示：消耗人类工程师几周时间的电子光学设计问题,用微动粒子群算法在普通个人计算机上几十小时就能完成。