一种快速自适应谱估计算法

通过对梯度格型快速自适应算法的研究,结合最大熵谱外推目前存在的缺点,将梯度格型算法应用于最大熵谱外推中,并将其与伯格算法进行了比较。     

区域与特征相结合的立体匹配算法

基于区域的匹配算法是立体匹配中常用的方法之一,而基于特征的匹配算法能解决区域匹配中遇到的某些问题,根据特征匹配与区域匹配的特点,提出了一种特征匹配与区域匹配相结合的立体匹配算法.首先在特征匹配中通过改进的Harris提取角点并结合单调性约束和惟一性约束进行匹配,特征匹配的结果能减少误匹配率,为区域匹配打下了基础.然后在...     

基于二阶梯度的图像增强算法研究

针对PCB图像的特点对图像进行增强处理,使得图像的边缘更加突出,灰度的对比度增加,同时滤除靠近边缘的噪声,为后续图像分割时更有效的选取阈值打下良好基础。使用二阶梯度算子获得图像的增强效果,实验表明,不仅解决了边缘附近噪声去除问题,而且有效地突出了边缘信息,图像的黑白对比分明,尤其是目标图像靠近边缘部分灰度值明显高于其他的非边缘区域。     

基于梯度遗传算法的压电换能器稳健优化设计

悬臂梁式压电振动换能器是一种新型的供电装置,其设计受到加工过程等不确定因素影响。从遗传算法和田口稳健设计的理论方法出发,结合悬臂梁式压电振动换能器的理论模型,设计了以输出平均功率为优化目标的稳健优化设计方案。利用目标函数的梯度信息加速遗传算法的收敛,以遗传算法产生的每一代种群的最优个体作为内表中的一组数据,利用外正交表计算优化目标的信噪比,对优化目标信噪比进行对比分析,得到一组最优设计参数。将该组数据对应的换能器与其它优化方法得到参数对应的换能器性能进行对比,表明该组参数下,换能器有较好的工作特性。     

基于RBF神经网络的Web文本分类的研究

Web文本分类是采用文本分类技术将Web上的信息进行自动分类,使用户能够快速找到自己想要的资源。文本分类的过程中,将特征提取之后的来自Web的数据分成样本数据集和测试数据集,将样本数据集输入到RBF网络中进行训练,RBF网络经过训练之后,输入测试数据集中的数据进行验证,实验证明,RBF网络取得了较好的分类结果。     

Shape optimized design of microwave dielectric resonators by level‐set and topology gradient methods

The finite element method is coupled with the topology gradient (TG) and level‐set (LS) methods for optimizing the shape of microwave components using a computer‐aided design model. On the one hand, the LS approach is based on the classical shape derivative; while on the other hand, the TG method is precisely designed for introducing new perturbations in the optimization domain. These two approaches, which consist in minimizing a cost function related to the component behavior, are first described. Regarding given electrical specifications, these techniques are applied to optimize the distribution of ceramic parts of a dual‐mode resonator in order to improve its behavior. The optimized dielectric resonators result in a wide spurious‐free stop band. A comparison between classical and optimized dual mode resonator is presented. Theoretical results are then validated by careful measurements. © 2009 Wiley Periodicals, Inc. Int J RF and Microwave CAE 2010.     

基于TS201系列DSP的PGA算法实现

相位梯度自聚焦(PGA)算法被广泛用于机载合成孔径雷达(SAR)成像中.由于其过程复杂,数据处理量大,为满足机载SAR实时处理的要求,选用具有强大处理能力的TS201 DSP.为了充分发挥TS201的性能,利用PGA原理和TS201处理器的特点,对算法流程进行优化,并且对最耗时的FFT采用了汇编语言实现,使得运算量和处...     

Self-scaled conjugate gradient training algorithms

This article presents some efficient training algorithms, based on conjugate gradient optimization methods. In addition to the existing conjugate gradient training algorithms, we introduce Perry's conjugate gradient method as a training algorithm [A. Perry, A modified conjugate gradient algorithm, Operations Research 26 (1978) 26–43]. Perry's method has been proven to be a very efficient method in the context of unconstrained optimization, but it has never been used in MLP training. Furthermore, a new class of conjugate gradient (CG) methods is proposed, called self-scaled CG methods, which are derived from the principles of Hestenes–Stiefel, Fletcher–Reeves, Polak–Ribière and Perry's method. This class is based on the spectral scaling parameter introduced in [J. Barzilai, J.M. Borwein, Two point step size gradient methods, IMA Journal of Numerical Analysis 8 (1988) 141–148]. The spectral scaling parameter contains second order information without estimating the Hessian matrix. Furthermore, we incorporate to the CG training algorithms an efficient line search technique based on the Wolfe conditions and on safeguarded cubic interpolation [D.F. Shanno, K.H. Phua, Minimization of unconstrained multivariate functions, ACM Transactions on Mathematical Software 2 (1976) 87–94]. In addition, the initial learning rate parameter, fed to the line search technique, was automatically adapted at each iteration by a closed formula proposed in [D.F. Shanno, K.H. Phua, Minimization of unconstrained multivariate functions, ACM Transactions on Mathematical Software 2 (1976) 87–94; D.G. Sotiropoulos, A.E. Kostopoulos, T.N. Grapsa, A spectral version of Perry's conjugate gradient method for neural network training, in: D.T. Tsahalis (Ed.), Fourth GRACM Congress on Computational Mechanics, vol. 1, 2002, pp. 172–179]. Finally, an efficient restarting procedure was employed in order to further improve the effectiveness of the CG training algorithms. Experimental results show that, in general, the new class of methods can perform better with a much lower computational cost and better success performance.     

Perceptron training algorithms designed using discrete-time control Liapunov functions

Perceptrons, proposed in the seminal paper McCulloch–Pitts of 1943, have remained of interest to neural network community because of their simplicity and usefulness in classifying linearly separable data and can be viewed as implementing iterative procedures for “solving” linear inequalities. Gradient descent and conjugate gradient methods, normally used for linear equalities, can be used to solve linear inequalities by simple modifications that have been proposed in the literature but not been analyzed completely. This paper applies a recently proposed control-inspired approach to the design of iterative steepest descent and conjugate gradient algorithms for perceptron training in batch mode, by regarding certain parameters of the training/algorithm as controls and then using a control Liapunov technique to choose appropriate values of these parameters.     

基于先验信息的运动物体分割与跟踪

提出一种基于先验信息的运动物体分割与跟踪算法。该算法假设帧间运动物体颜色直方图和大小等信息是相对不变的,利用动态规划思想最小化当前帧目标物体颜色直方图和大小与已知目标物体颜色直方图和大小信息的差距,从而找到较准确的目标物体轮廓。与梯度向量流算法相比,该算法对初始轮廓的鲁棒性较好,能在复杂的背景中找到物体轮廓。