共查询到19条相似文献,搜索用时 62 毫秒
1.
凸规划是非线性规划中一种重要的特殊形式,它具有很好的性质。1976年Rockafellar利用极大单调算子的性质提出了求解无约束凸规划的临近点算法,文章根据凸规划的性质、最优性条件等将这一算法推广到带约束凸规划上。 相似文献
2.
提出了一种基于显著性特征的可见光与红外图像融合算法来改善目标的融合质量.引入显著检测器对红外图像进行处理,生成显著映射;进一步分析红外图像并检测兴趣点,提取图像中的显著兴趣点;通过计算显著兴趣点的凸壳确定显著区域;利用显著兴趣点凸壳对初始显著映射进行优化,使目标定位更加精确.根据区域映射获取可见光图像的背景区域;根据不同的融合准则对目标、背景区域进行融合,获得最终的融合图像.结果表明与当前可见光图像融合技术相比,所提算法在标准差、联合熵与边缘信息因子等指标方面具有优势,其融合图像的细节纹理更清晰. 相似文献
3.
凸规划是非线性规划中一种重要的特殊形式,它具有很好的性质。1976年Rockafellar利用极大单调算子的性质提出了求解无约束凸规划的临近点算法,文章根据凸规划的性质、最优性条件等将这一算法推广到带约束凸规划上。 相似文献
4.
Sally Cole Johnson 《集成电路应用》2008,(3):80-80
电子行业中,尤其是高端的倒装芯片,面临着很多散热和功耗管理方面的挑战,因而致力于解决这些挑战的新颖方法自然而然地会吸引大量的目光。 相似文献
5.
一种基于凸集映射的高分辨率图像恢复算法 总被引:1,自引:0,他引:1
介绍了一种基于凸集映射(POCS)算法的高分辨率图像恢复方法,通过仿真对比了其与双线性插值方法恢复高分辨率图像的差异,仿真结果表明,该方法有助于改善高分辨率图像的恢复质量。 相似文献
6.
FC(倒装片)和WLP(圆片级封装)均要在圆片上制作各类凸点,它们与基板焊接互连后,由于各材料间的热失配可能造成凸点——基板间互连失效,从而影响了器件的可靠性和使用寿命。解决这一问题的通常做法是对芯片凸点与基板间进行下填充。本文介绍的柔性凸点技术是在焊球下面增加一层具有弹性的柔性材料,当器件工作产生热失配时,由于柔性材料的自由伸缩,将大大减小以至消除各材料间的失配应力,使芯片凸点与基板下即使不加下填充,也能达到器件稳定、长期、可靠地工作的目的。 相似文献
7.
重点介绍采用金丝球焊机制作IC芯片钉头形金凸点的工艺技术、钉头金凸点的整平方法及金凸点抗剪切强度的评价. 相似文献
8.
9.
10.
11.
To solve basic ant colony algorithm’s drawbacks of large search space,low convergence rate and easiness of trapping in local optimal solution,an ant colony algorithm of partially optimal programming based on dynamic convex hull guidance was proposed.The improved algorithm dynamically controlled the urban selection range of the ants,which could reduce the search space of ants on basis of helping the algorithm to jump out of local optimal solution to global optimal solution.Meanwhile,the delayed drift factor and the convex hull constructed by the cities to be chosen were introduced to intervene the current ants’ urban choice,it could increase the diversity of the early solution of the algorithm and improve the ability of ants’ partially optimal programming.Then the pheromone updating was coordinated by using construction information of convex hull and the complete path information that combined local with whole,it could improve the accuracy of the algorithm by guiding the subsequent ants to partially optimal programming.The pheromone maximum and minimum limit strategy with convergence was designed to avoid the algorithm’s premature stagnation and accelerate the solving speed of the algorithm.Finally,the proposed algorithm was applied to four classic TSP models.Simulation results show that the algorithm has better optimal solution,higher convergence rate and better applicability. 相似文献
12.
基于兴趣点凸包的图像检索方法 总被引:2,自引:0,他引:2
提出了一种基于兴趣点确定感兴趣区域的图像检索方法。在尺度归一化图像中检测兴趣点,然后对兴趣点求取凸包确定感兴趣区域,并用颜色直方图和Zernike矩作为特征进行检索,在保证图像检索对图像旋转、平移、缩放鲁棒性的前提下,将图像检索上升到物体层,克服了传统方法的不足。对1000幅图像进行的大量实验表明,该方法与其他基于兴趣点的方法相比,平均检索准确率提高了13%,可以更准确地查找到用户所需图像。 相似文献
13.
Harris hawks optimization ( HHO) algorithm is an efficient method of solving function optimization problems.
However, it is still confronted with some limitations in terms of low precision, low convergence speed and stagnation
to local optimum. To this end, an improved HHO ( IHHO) algorithm based on good point set and nonlinear
convergence formula is proposed. First, a good point set is used to initialize the positions of the population
uniformly and randomly in the whole search area. Second, a nonlinear exponential convergence formula is designed
to balance exploration stage and exploitation stage of IHHO algorithm, aiming to find all the areas containing the
solutions more comprehensively and accurately. The proposed IHHO algorithm tests 17 functions and uses Wilcoxon
test to verify the effectiveness. The results indicate that IHHO algorithm not only has faster convergence speed than
other comparative algorithms, but also improves the accuracy of solution effectively and enhances its robustness
under low dimensional and high dimensional conditions. 相似文献
14.
15.
图像特征点的提取与匹配是增量式SFM重建系统中至关重要的一步。为了提高匹配的准确率以及有效匹配点对的数量,提出了一种改进方法:首先在多尺度空间中利用自适应阈值的FAST角点检测算法获取特征点;然后计算特征点与其多个环形邻域之间的灰度对比信息,再与采样区域的局部梯度信息融合得到特征点描述子;接着利用曼哈顿距离与切比雪夫距离的线性组合代替欧氏距离完成特征点的稀疏匹配;最后利用稀疏匹配结果作为种子点对进行同步生长,在多约束条件下得到最终的稠密匹配结果。在Oxford数据集上的实验证明了改进的稀疏匹配算法的准确率与有效匹配点对数量都高于SIFT算法,在增量式SFM系统中的实验证明了稀疏匹配与稠密匹配的组合算法可以获得更好的重建效果。 相似文献
16.
17.
18.
19.
In this letter, a simple algorithm for determining the existence of a linear graph from a given edge matrix is given. The algorithm not only provides a means of determining the existence of a linear graph, but also suggests ways by which the given edge matrix must be modified to enable a graph to exist. 相似文献