针对差分进化算法开发能力较差的问题,提出一种具有快速收敛的新型差分进化算法.首先,利用最优高斯随机游走策略提高算法的开发能力;然后,采用基于个体优化性能的简化交叉变异策略实现种群的进化操作以加强其局部搜索能力;最后,通过个...针对差分进化算法开发能力较差的问题,提出一种具有快速收敛的新型差分进化算法.首先,利用最优高斯随机游走策略提高算法的开发能力;然后,采用基于个体优化性能的简化交叉变异策略实现种群的进化操作以加强其局部搜索能力;最后,通过个体筛选策略进一步提高算法的探索能力以避免陷入局部最优.12个标准测试函数和两种带约束的工程优化问题的实验结果表明,所提出的算法在收敛速度、算法可靠性及收敛精度方面均优于EPSDE、Sa DE、JADE、BSA、Co Bi DE、GSA和ABC等算法,在加强算法探索能力的同时能够有效地提高算法的开发能力.展开更多
针对无人机路径规划求解计算量大、难收敛等问题,提出了一种基于全粒子推动野马算法的路径规划方法。建立三维环境模型与路径代价模型,将路径规划问题转化为多维函数优化问题;采用一种自适应邻域搜索策略,改善算法的开发能力;利用高斯...针对无人机路径规划求解计算量大、难收敛等问题,提出了一种基于全粒子推动野马算法的路径规划方法。建立三维环境模型与路径代价模型,将路径规划问题转化为多维函数优化问题;采用一种自适应邻域搜索策略,改善算法的开发能力;利用高斯随机游走策略对个体的历史最优位置进行回溯搜索,改善算法的探索能力;考虑到自适应策略对初始种群多样性敏感的问题,结合Tent混沌映射初始化种群,提高算法的鲁棒性以及全局寻优能力;将提出的改进算法在13个经典测试函数中进行性能验证,并移植于无人机三维路径规划问题中。在30峰、40峰、50峰的环境模型下进行测试,与遗传算法、粒子群算法、SRM-PSO(self-regulating and self-perception particle swarm optimization with mutation mechanism)算法以及野马算法对比,全粒子推动野马算法皆取得最短平均路径,且在所有测试中都找到满足约束、无碰的路径。仿真结果证明,在复杂环境下全粒子推动野马算法具有优秀的全局寻优能力以及较好的鲁棒性。展开更多
Automatic image annotation has been an active topic of research in computer vision and pattern recognition for decades.A two stage automatic image annotation method based on Gaussian mixture model(GMM) and random walk...Automatic image annotation has been an active topic of research in computer vision and pattern recognition for decades.A two stage automatic image annotation method based on Gaussian mixture model(GMM) and random walk model(abbreviated as GMM-RW) is presented.To start with,GMM fitted by the rival penalized expectation maximization(RPEM) algorithm is employed to estimate the posterior probabilities of each annotation keyword.Subsequently,a random walk process over the constructed label similarity graph is implemented to further mine the potential correlations of the candidate annotations so as to capture the refining results,which plays a crucial role in semantic based image retrieval.The contributions exhibited in this work are multifold.First,GMM is exploited to capture the initial semantic annotations,especially the RPEM algorithm is utilized to train the model that can determine the number of components in GMM automatically.Second,a label similarity graph is constructed by a weighted linear combination of label similarity and visual similarity of images associated with the corresponding labels,which is able to avoid the phenomena of polysemy and synonym efficiently during the image annotation process.Third,the random walk is implemented over the constructed label graph to further refine the candidate set of annotations generated by GMM.Conducted experiments on the standard Corel5 k demonstrate that GMM-RW is significantly more effective than several state-of-the-arts regarding their effectiveness and efficiency in the task of automatic image annotation.展开更多
文摘针对差分进化算法开发能力较差的问题,提出一种具有快速收敛的新型差分进化算法.首先,利用最优高斯随机游走策略提高算法的开发能力;然后,采用基于个体优化性能的简化交叉变异策略实现种群的进化操作以加强其局部搜索能力;最后,通过个体筛选策略进一步提高算法的探索能力以避免陷入局部最优.12个标准测试函数和两种带约束的工程优化问题的实验结果表明,所提出的算法在收敛速度、算法可靠性及收敛精度方面均优于EPSDE、Sa DE、JADE、BSA、Co Bi DE、GSA和ABC等算法,在加强算法探索能力的同时能够有效地提高算法的开发能力.
文摘针对无人机路径规划求解计算量大、难收敛等问题,提出了一种基于全粒子推动野马算法的路径规划方法。建立三维环境模型与路径代价模型,将路径规划问题转化为多维函数优化问题;采用一种自适应邻域搜索策略,改善算法的开发能力;利用高斯随机游走策略对个体的历史最优位置进行回溯搜索,改善算法的探索能力;考虑到自适应策略对初始种群多样性敏感的问题,结合Tent混沌映射初始化种群,提高算法的鲁棒性以及全局寻优能力;将提出的改进算法在13个经典测试函数中进行性能验证,并移植于无人机三维路径规划问题中。在30峰、40峰、50峰的环境模型下进行测试,与遗传算法、粒子群算法、SRM-PSO(self-regulating and self-perception particle swarm optimization with mutation mechanism)算法以及野马算法对比,全粒子推动野马算法皆取得最短平均路径,且在所有测试中都找到满足约束、无碰的路径。仿真结果证明,在复杂环境下全粒子推动野马算法具有优秀的全局寻优能力以及较好的鲁棒性。
基金Supported by the National Basic Research Program of China(No.2013CB329502)the National Natural Science Foundation of China(No.61202212)+1 种基金the Special Research Project of the Educational Department of Shaanxi Province of China(No.15JK1038)the Key Research Project of Baoji University of Arts and Sciences(No.ZK16047)
文摘Automatic image annotation has been an active topic of research in computer vision and pattern recognition for decades.A two stage automatic image annotation method based on Gaussian mixture model(GMM) and random walk model(abbreviated as GMM-RW) is presented.To start with,GMM fitted by the rival penalized expectation maximization(RPEM) algorithm is employed to estimate the posterior probabilities of each annotation keyword.Subsequently,a random walk process over the constructed label similarity graph is implemented to further mine the potential correlations of the candidate annotations so as to capture the refining results,which plays a crucial role in semantic based image retrieval.The contributions exhibited in this work are multifold.First,GMM is exploited to capture the initial semantic annotations,especially the RPEM algorithm is utilized to train the model that can determine the number of components in GMM automatically.Second,a label similarity graph is constructed by a weighted linear combination of label similarity and visual similarity of images associated with the corresponding labels,which is able to avoid the phenomena of polysemy and synonym efficiently during the image annotation process.Third,the random walk is implemented over the constructed label graph to further refine the candidate set of annotations generated by GMM.Conducted experiments on the standard Corel5 k demonstrate that GMM-RW is significantly more effective than several state-of-the-arts regarding their effectiveness and efficiency in the task of automatic image annotation.
