共查询到19条相似文献,搜索用时 62 毫秒
1.
2.
3.
混沌系统的未知系统参数估计是实现混沌控制和同步的首要问题,通过构造一个合理的适应度函数,可将其转化为一个多维搜索空间的优化问题.提出一种融合改进骨干粒子群算法与改进差分进化算法的混合群智能优化方法来解决上述优化问题.对骨干粒子群算法中的粒子位置更新机制以及差分进化算法中的变异操作、交叉操作、交叉概率因子的设计等进行改进,有效兼顾了种群的多样性与算法的收敛性.在此基础上,讨论骨干粒子群优化算法与差分进化的融合优化策略,实现两个算法的协同进化,进一步提高算法的综合优化性能.用6个基准测试函数以及Lorenz混沌系统为例进行仿真实验,结果表明该方法具有全局寻优能力强、收敛速度快、搜索精度高、稳健性好等优点. 相似文献
4.
针对现有融合方法不易根据后续处理目的对融合规则进行自适应调整,不同方法的优点不易综合的问题,提出一个基于数据同化和差分进化算法的图像融合框架.在该框架下,将基于非采样下的Contourlet变换作为模型算子,离散小波变换作为观测算子,可根据后续处理对图像各个属性指标值的依赖程度确定各个属性指标的权重,构造由图像各个属性评价指标的加权和所组成的目标函数,再利用差分进化算法来优化目标函数,从而获取更合适的图像.二组实验从视觉效果和量化指标(标准方差、平均梯度、熵、空间频率及均方根交叉熵)两方面验证了该框架的有效性. 相似文献
5.
提出一种混合交叉进化算法 来估计混沌系统的未知参数. 首先通过构造一个适当的适应度函数, 将混沌系统的参数估计问题转化为一个多维的优化问题. 在混合交叉进化算法中, 利用佳点集方法初始化种群, 增加了算法的稳定性和全局搜索能力. 在进化过程中, 混合交叉操作既能指导种群个体向最优解子空间靠近, 又能提高算法跳出局部最优的能力, 从而协调了算法的勘探和开采能力. 以几个标准测试函数和典型的Lorenz混沌系统为例进行仿真实验, 结果表明了该方法的有效性. 相似文献
7.
8.
基于改进差分进化算法的相机标定研究 总被引:8,自引:0,他引:8
目前相机标定多采用Tsai和Weng的基于非线性成像模型的分步标定法。在研究标定算法的过程中发现,待优化的目标函数具有多个局部极值点,采用传统的局部优化算法会导致迅速收敛到局部极值点,而非全局最优解,影响了标定精度。差分进化是一种收敛速度很快的进化算法,但当初始种群分布不够理想时,它可能快速收敛到局部极值点。将其改进后用于相机标定,提出了分步法与改进的差分进化算法相结合的相机标定方法。数据实验表明:标定精度比直接采用分步法有所提高。 相似文献
9.
针对现有融合方法不易根据后续处理目的对融合规则进行自适应调整,不同方法的优点不易综合的问题,提出一个基于数据同化和差分进化算法的图像融合框架.在该框架下,将基于非采样下的Contourlet变换作为模型算子,离散小波变换作为观测算子,可根据后续处理对图像各个属性指标值的依赖程度确定各个属性指标的权重,构造由图像各个属性评价指标的加权和所组成的目标函数,再利用差分进化算法来优化目标函数,从而获取更合适的图像.二组实验从视觉效果和量化指标(标准方差、平均梯度、熵、空间频率及均方根交叉熵)两方面验证了该框架的有效性. 相似文献
10.
提出一种基于可重复混沌扩频序列的差分混沌键控保密通信系统, 并对该系统的误码率进行分析。通过复制差分混沌键控调制信号的参考信号产生重复的混沌扩频序列, 再和经串并转换后的部分数据流相乘, 其余并行数据流按照传统差分混沌键控进行调制, 两部分信号相加后发送到信道中进行传输。在接收端进行相关解调恢复出原信息。理论分析和仿真结果表明: 在多径衰落信道下, 该系统的误码率低于DCSK、CDSK和CD-DCSK系统, 且扩频因子越小, 误码率越低。信道中叠加服从高斯分布噪声时的系统误码率相比叠加服从瑞利分布噪声时的小。 相似文献
11.
Adaptive Control and Function Projective Synchronization in 2D Discrete-Time Chaotic Systems 总被引:1,自引:0,他引:1
LI Yin CHEN Yong LI Biao 《理论物理通讯》2009,51(2):270-278
This study addresses the adaptive control and function projective synchronization problems between 2D Rulkov discrete-time system and Network discrete-time system. Based on backstepping design with three controllers, a systematic, concrete and automatic scheme is developed to investigate the function projective synchronization of discretetime chaotic systems. In addition, the adaptive control function is applied to achieve the state synchronization of two discrete-time systems. Numerical results demonstrate the effectiveness of the proposed control scheme. 相似文献
12.
提出一种改进的克隆选择算法用于解决混沌系统的参数辨识问题.该算法利用抗体的高频变异和受体编辑两种机制有效平衡算法的全局探索与局部开发,并引入向精英抗体学习策略进一步提高算法的收敛质量.对10个优化问题的实验表明:所提出算法在求解精度、收敛速度以及稳定性方面具有更好的性能.以参数未知统一混沌系统的同步控制为研究对象,合理设计同步控制器,并对同步系统的稳定性进行理论分析.通过对同步比例因子的设置,实现统一混沌系统的完全同步、反同步、投影同步等多种同步方式.仿真实验结果表明该方法能够实现对未知系统参数的精确辨识以及驱动-响应系统的有效同步控制,验证了所提方法的可行性与有效性. 相似文献
13.
JIN Yi-Liang LI Kin CHEN Yong 《理论物理通讯》2008,50(7):111-116
In this paper, a function projective synchronization scheme is developed to investigate the function projective synchronization between the discrete-time driven chaotic system and the discrete-time response chaotic system. With the aid of symbolic-numeric computation, we use the scheme to study the function projective synchronization between 2D Lorenz discrete-time system and Hdnon discrete-time system, as well as that between 3D discrete-time hyperchaotic system and Henon-like map via three scalar controllers, respectively. Moreover numerical simulations are used to verify the effectiveness of the proposed scheme. 相似文献
14.
15.
16.
Numerical optimization has been a popular research topic within various engineering applications, where differential evolution (DE) is one of the most extensively applied methods. However, it is difficult to choose appropriate control parameters and to avoid falling into local optimum and poor convergence when handling complex numerical optimization problems. To handle these problems, an improved DE (BROMLDE) with the Bernstein operator and refracted oppositional-mutual learning (ROML) is proposed, which can reduce parameter selection, converge faster, and avoid trapping in local optimum. Firstly, a new ROML strategy integrates mutual learning (ML) and refractive oppositional learning (ROL), achieving stochastic switching between ROL and ML during the population initialization and generation jumping period to balance exploration and exploitation. Meanwhile, a dynamic adjustment factor is constructed to improve the ability of the algorithm to jump out of the local optimum. Secondly, a Bernstein operator, which has no parameters setting and intrinsic parameters tuning phase, is introduced to improve convergence performance. Finally, the performance of BROMLDE is evaluated by 10 bound-constrained benchmark functions from CEC 2019 and CEC 2020, respectively. Two engineering optimization problems are utilized simultaneously. The comparative experimental results show that BROMLDE has higher global optimization capability and convergence speed on most functions and engineering problems. 相似文献
17.
A chaotic system refers to a deterministic system with seemingly random irregular motion, and its behavior is uncertain, unrepeatable, and unpredictable. In recent years, researchers have proposed various image encryption schemes based on a single low-dimensional or high-dimensional chaotic system, but many algorithms have problems such as low security. Therefore, designing a good chaotic system and encryption scheme is very important for encryption algorithms. This paper constructs a new double chaotic system based on tent mapping and logistic mapping. In order to verify the practicability and feasibility of the new chaotic system, a displacement image encryption algorithm based on the new chaotic system was subsequently proposed. This paper proposes a displacement image encryption algorithm based on the new chaotic system. The algorithm uses an improved new nonlinear feedback function to generate two random sequences, one of which is used to generate the index sequence, the other is used to generate the encryption matrix, and the index sequence is used to control the generation of the encryption matrix required for encryption. Then, the encryption matrix and the scrambling matrix are XORed to obtain the first encryption image. Finally, a bit-shift encryption method is adopted to prevent the harm caused by key leakage and to improve the security of the algorithm. Numerical experiments show that the key space of the algorithm is not only large, but also the key sensitivity is relatively high, and it has good resistance to various attacks. The analysis shows that this algorithm has certain competitive advantages compared with other encryption algorithms. 相似文献
18.