共查询到20条相似文献,搜索用时 109 毫秒
1.
2.
3.
为提高大视场高灵敏度星敏感器的星图识别速度和识别成功率,提出了一种基于混合粒子群算法的星图识别方法,该方法首先根据星图中星点的灰度信息确定候选识别主星集合;然后选择该集合中的一个星点为圆心,以一定角距为半径画圆,将圆内的所有星点构成特征数据集合;然后利用混合粒子群算法对圆内的星点进行快速路径寻优;最后利用最优路径长度进行索引,并利用最优路径中前三个星点间的角距以及它们的星等信息进行匹配识别;实验结果表明,与现有识别方法相比,该方法具有高的识别率,良好的实时性和鲁棒性,且所需的导航星库容量小. 相似文献
4.
针对传统基于灰度变换方法进行图像增强后图像质量不高等现象,对粒子群优化算法、模糊增强算法进行研究,同时结合禁忌搜素和粒子空间对称分布原理,提出一种基于二维粒子群优化的图像模糊增强算法。该算法通过对搜索粒子进行空间对称分布调整以避免算法陷入局部最优、提高全局搜索能力,并且在算法迭代后期加入禁忌搜索算法记录粒子搜索位置,以减少粒子位置重复寻优、提高算法搜索效率。最后将改进后的粒子群优化算法中粒子搜索位置和速度更新方向设定为二维并与模糊增强算法相结合,自适应搜索出模糊参数Fp、Fe最优值,实现模糊增强。实验结果表明,改进后算法对图像增强效果较好,并且将算法用于过暗SAR图像、医学MR图像的增强,可有效提高图像质量。 相似文献
5.
为了实现以较少的内存资源,快速而准确地进行圆 检测, 提出一种基于粒子群的快速圆检测方法。方法中,以每个粒子作为一个候选圆,采用优化策 略,以粒子 运动、融合更新等操作完成圆的检测。优化策略包括提出使用一种图像分块的策略限 定圆检测的感兴趣区 域,各个图像块的大小由各个块内粒子的生成结果决定,以起到抑制部分噪声的作用。为减 少生成无用粒子的概 率,提高检测效率,提出融入图像金字塔的思想,并以循证的方法对粒子的有效性加以验证 。实验结果表明,本文 方法对于检测手绘的、嵌套的、不完整的或包含有大量噪声的圆,均能起到较好的检测效果 ;能 够在较短的时间内排除众多干扰,准确地进行圆的检测,具有检测速度快、内存消耗小和适 用范围广等优点。 相似文献
6.
以均匀线阵(Uniform Linear Array ,ULA)为子阵,结合频率分集阵(Frequency Diverse Array ,FDA)的思想,构建了一种基于分布式子阵的频率分集阵。针对各子阵按等间距布阵将导致严重的栅瓣问题,提出了一种改进粒子群 (Improved Particle Swarm Optimization ,IPSO) 算法来优化分布式FDA中各子阵间的基线距离,以实现高效的栅瓣抑制。同时,从理论上推导了目标距离和角度均未知时参数估计的克拉美罗下界(Cramer-Rao Lower Bound ,CRLB)。仿真结果表明,优化后分布式FDA的栅瓣得到有效抑制,而且阵列角度维分辨率和估计性能亦得到大幅度提升,验证了所提算法的有效性。 相似文献
7.
针对函数优化问题,提出了一种基于离差平方和法的粒子群优化算法。该算法用混沌序列初始化粒子的位置和速度,选择好于粒子群优化算法产生的粒子位置。通过离差平方和法进行聚类,利用分类方式来更新粒子的速度。最后将算法应用到3个典型的函数优化问题中,数值结果比较表明,提高了算法搜索能力,全局最优解的精度和收敛速度。 相似文献
8.
Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper,
we have used two evolutionary algorithms, genetic algorithm and particle swarm optimization for blind source separation. In
these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In
order to evaluate and compare the performance of these methods, we have focused on separation of noisy and noiseless sources.
Simulations results demonstrate that the proposed method for employing fitness function has rapid convergence, simplicity
and a more favorable signal to noise ratio for separation tasks based on particle swarm optimization and continuous genetic
algorithm than binary genetic algorithm. Also, particle swarm optimization enjoys shorter computation time than the other
two algorithms for solving these optimization problems for multiple sources. 相似文献
9.
Meiqin Tang Chengnian Long Xinping Guan 《International Journal of Communication Systems》2008,21(9):971-985
This paper presents a new algorithm for optimal spectrum balancing in modern digital subscriber line (DSL) systems using particle swarm optimization (PSO). In DSL, crosstalk is one of the major performance bottlenecks, therefore various dynamic spectrum management algorithms have been proposed to reduce excess crosstalks among users by dynamically optimizing transmission power spectra. In fact, the objective function in the spectrum optimization problem is always nonconcave. PSO is a new evolution algorithm based on the movement and intelligence of swarms looking for the most fertile feeding location, which can solve discontinuous, nonconvex and nonlinear problems efficiently. The proposed algorithm optimizes the weighted rate sum. These weights allow the system operator to place differing qualities of service or importance levels on each user, which makes it possible for the system to avoid the selfish‐optimum. We can show that the proposed algorithm converges to the global optimal solutions. Simulation results demonstrate that our algorithm can guarantee fast convergence within a few iterations and solve the nonconvex optimization problems efficiently. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
10.
11.
《中国邮电高校学报(英文版)》2014,21(6):78-86
To overcome particle impoverishment, a simultaneous localization and mapping (SLAM) method based on multi-agent particle swarm optimized particle filter (MAPSOPF) was presented by introducing the idea of multi-agent to the particle swarm optimized particle filter (PSOPF) which is an algorithm for SLAM. In MAPSOPF, agents can communicate and compete with each other and learn from each other. The MAPSOPF algorithm can update the prediction of particle, adjust the proposal distribution of particles, improve localization precision and fault tolerance, and propel the particles to concentrate on the robot's true pose. Compared with standard particle filter (PF), the proposed method can achieve better SLAM precision by fewer particles. Simulations verify its effectiveness and feasibility. 相似文献
12.
针对LEA低C功H算法的簇头分布不合理、网络能耗不均的问题,在耗自适应集簇分层路由算法。首先将分割线的选择LE问A题CH转协议的基础上,提出了一种改进粒子群算法优化化成带约束的非线性优化问题,然后利用粒子群算法求解,并针对粒子群算法的不足进行相应的改进,最后采用仿真实验测试算法的性能。仿真结果表明,相对于其它改进LEACH路由算法,本文算法有效提高了网络的能量利用率,能够实现节点之间的能耗均衡,使无线传感器的网络生存时间得到延长。 相似文献
13.
本文针对传统粒子群算法自实际应用中出现速度缓慢及局部最优解等等问题,提出了一种改进粒子群算法,并且将其应用在电力系统中,希望能够解决电力系统所存在的例如无功优化等问题中.改进后的粒子群算法在实际应用中收敛速度更加合理,能够有效保证种群的多元性,有效解决传统粒子群所存在的局部最佳解问题. 相似文献
14.
15.
16.
17.
为了提高激光点云配准精度与配准速度,采用了基于天牛须算法改进的粒子群算法,以点云分布熵为寻优目标, 寻找最优空间变换矩阵的点云粗配准,为点云精配准提供良好的初始条件。结果表明,点云分布熵较传统的均值平方差评价方式有更快的计算速度,基于天牛须算法改进的粒子群算法具有全局搜索能力强、计算速度快等特点,与传统点云粗配准方法相比,该方法配准速度提升了近25%;在点云数据量大的条件下,表现出较快的配准速度。这一方法对如何提高激光点云配准速度具有参考意义。 相似文献
18.
Compared to 2D NoC, 3D NoC has better integrated density and system performance, which was a reliable method to solve the problem about low-power mapping. On the basis of the traditional particle swarm optimization algo-rithm (PSOA), a dynamic adaptive discrete particle swarm optimization algorithm (DADPSOA) was proposed . Parame-ter in this algorithm was adjusted dynamically based on the degree of early convergence and the charge of individual adap-tive value to approach the optimal solution. At the same time, the reasonable structure of the particles was made aiming at reducing the time complexity of this algorithm. Experimental results show that comparing with the random mapping, genetic algorithm (GA), PSOA and dynamic ant colony algorithm (DACA), DADPSOA can save the execution time, reduce the communication power consumption of mapping results. The power consumption of the task graph is reduced. 相似文献
19.
为了优化器件的结构参量,把光栅结构的周期、高度、占空比作为优化的粒子,采用粒子群优化算法和严格耦合波分析算法,对粒子群中粒子的适应值进行了比较,对金属-介质光栅滤光片结构进行了理论分析和仿真优化,在一定范围内找到最优参量。结果表明,根据MATLAB仿真结果进行优化,得到周期为0.300μm,金属光栅厚度为0.035μm,介质光栅厚度为0.400μm,光栅占空比为0.77;在TM光垂直入射时,该结构对波长为0.65μm的红光透射率达到80.27%,旁带透射效率不超过15%;该结构实现了特定波长光的高效透射,从而实现了滤光。该结构为亚波长光栅的设计、制备研究和实际应用提供了参考。 相似文献