离散小波变换快速算法中预滤波器的选取方法研究

离散小波变换快速算法使得小波变换在信号处理领域得到广泛应用,其中抽样空间上测量值的求取是快速算法中的重要步骤。在论述离散小波变换快速算法的基础上,研究了对抽样空间上测量值的求取方法,即预滤波器的小波选取法,直接选取法,取样函数法及其和特点,探讨了一种基于小波系数范数误差极小的预滤波器优化设计方法,仿真分析各种方法的误差,结果表明优化方法具有较好的分解精度。     

���ڽ�ͨԼ���ĸ�Ч·���滮�㷨

分析了路径规划问题及其在交通约束条件下的特点。从算法改进和模型改进两方面对路径规划算法进行了研究,在详细分析Dijkstra算法步骤和对偶法的基础上,给出了交通约束的数学模型及道路网络的相关定理。基于传统Dijkstra算法,对搜索过程中的节点和边的标记方式和规则进行了改进,提出了一种在交通约束条件下的高效路径规划算法。该算法通过减少搜索节点和标记边的次数而减少搜索过程中的运算量。仿真结果表明,该算法对偶法1/3～1/4的运算量。     

飞机起飞滑跑距离数值积分改进算法

应用数值计算理论对飞机起飞滑跑距离数值积分算法进行了研究,用插值法对发动机瞬时推力和起飞气动数据的确定方法进行了改进,用迭代法确定了离地速度,基于改进算法编制了起飞滑跑距离计算程序。在发动机推力曲线已知时,对5种飞机的起飞滑跑距离进行计算,原算法的平均误差为55.6 m,改进算法的平均误差为23.4 m;在发动机推力曲线未知时,用程序计算某型飞机在12种条件下的起飞滑跑距离与实际滑跑距离对比的平均相对误差为2.9%。计算结果表明改进算法计算精度优于原算法。     

基于车载连续序列图像的道路曲率计算方法

提出一种基于车载连续序列图像的道路曲率计算方法.算法首先利用车载视 觉系统进行内外参数标定实现对路面车道线的三维重建,利用三维重建误差模型对重建 的数据点进行误差估计,并对数据点进行选弃.对序列图像中路面车道线重建出来的曲线 采用ICP 算法进行曲线匹配,并将匹配后的曲线映射到统一的参考坐标系中.最后利用匹 配曲线上的数据点进行圆周拟合,计算道路曲率.实验中利用真实的车载连续序列图像对 算法进行验证.针对曲率半径分别为96 m和430 m两段不同程度的弯道,利用本文算法计 算对应道路的曲率半径.结果表明,本文算法能够精确地计算出不同弯道的道路曲率,特 别是针对平缓弯道的曲率计算,比基于单幅图像的曲率计算方法更加准确与稳定.     

基于改进PSO算法的岩石蠕变模型参数辨识

微粒群优化（PSO）算法是一类随机全局优化技术,具有收敛速度快、规则简单、易于实现的优点．针对岩石蠕变本构模型参数的辨识问题,本文利用FLAC软件自带的fish语言实现了改进PSO算法对本构模型参数的辨识．该方法从岩石本构模型参数的随机值出发,以蠕变过程中试件变形的实验值与计算值的误差大小作为适应度函数来评价参数的品质,利用改进PSO算法规则实现模型参数的进化,搜索出全局最优的模型参数值,从而实现了岩石蠕变本构模型参数的自适应辨识．利用该方法对页岩蠕变实验进行了仿真研究,实验结果表明：改进的PSO算法用于岩石蠕变模型的参数辨识是有效的．     

矩形波导缝隙阵列天线的快速综合算法

矩形波导缝隙阵列天线计算复杂,本文提出一种快速综合算法,充分考虑互耦的影响,并且可以对同相或不同相缝隙电压加权进行综合.首先在有源导纳法的基础上得出一个矩阵方程,互耦的影响和缝隙自身的影响分别可以用方程中的一个矩阵完全表示.分析矩阵的特性后,本文可将对面阵的综合转换为对每条波导上缝隙的综合,大大降低计算量.仿真实例验证了算法的有效性.     

基于改进的FCM在人脑MR图像分割中的应用

为解决模糊C-均值聚类（FCM）算法在医学图像分割中存在计算量大、运行时间过长以及样本集不理想会导致不好的聚类结果的问题,提出了相应的改进算法．利用收敛速度快的K均值聚类法得到的聚类中心作为FCM算法的初始聚类中心,并将样本对于各个聚类的隶属度之和为1这一约束条件,改变为所有样本对各类的隶属度总和等于样本总数．实验表明,该方法用于人脑磁共振图像分割时,运行速度提高了近3倍,分割准确度明显得到提高．     

提高级配指标计算精度方法研究

级配曲线是颗粒分析试验的重要成果图件,用其计算的不均匀系数Cu与曲率系数Cc是路基填料划分的重要指标。传统作图法整理级配曲线时,工作量大且精度不高。在分析线性插值、多项式插值、Lagrange插值与分段抛物线插值算法的基础上,提出了修正样条函数拟合的方法,得到土的光滑颗粒级配曲线。针对非单调样条函数,采用最佳逼近算法求解,克服了曲线出现平台时病态函数问题。文中提供了求解的关键代码,实践表明该法可以提高计算级配指标的精度和自动化程度。     

Mean shift registration algorithm for dissimilar sensors

The mean shift registration (MSR) algorithm is proposed to accurately estimate the biases for multiple dissimilar sensors. The new algorithm is a batch optimization procedure. The maximum likelihood estimator is used to estimate the target states, and then the mean shift algorithm is implemented to estimate the sensor biases. Monte Carlo simulations show that the MSR algorithm has significant improvement in performance with reducing the standard deviation and mean of sensor biased estimation error compared with the maximum likelihood registration algorithm. The quantitative analysis and the qualitative analysis show that the MSR algorithm has less computation than the maximum likelihood registration method.     

IMPLEMENTATION OF GRADIENT-BASED ESTIMATION OF HMM PARAMETERS

IntroductionIn Hidden Markov Model ( HMM) - basedspeech recognition systems,it is very importanttoset the parameters of HMMs correctly.Conven-tional training algorithms such as Baum- Welch al-gorithm,are based on the criterion of maximumlikelihood( ML) .The strength of Baum- Welch al-gorithm lies in its fast convergence andmonotonous improvement[1] . For other criteriasuch as maximum mutual information,however,such an algorithm does not exist.In this case,acommon resort is a gradient- b…     

Iterative algorithm of steered minimum variance and its application in weak targets detection

The steered covariance matrix (STCM) and its inverse matrix should be calculated in each beam for steered minimum variance (STMV). The inverse matrix needs complex computation and restricts its application in engineering. Combining the integration character of one-phase regressive filter with the iterative formula of inverse matrix, an STMV iterative algorithm is proposed. The computational cost of the iterative algorithm is reduced approximately to be 2/M times of the original one when there are M sensors, and is more advantaged for the realization of the algorithm in real time. Simulation results show that the STMV iterative algorithm can preserve the characters of STMV on high azimuth resolution and weak target detection while the computational cost reduced sharply. The analysis on sea trial data proves that the proposed algorithm can estimate each target’s azimuth even when the source powers differ in large scales or their bearings are very approximate.     

基于小波分解的车辆视频检测算法

作为智能交通系统(ITS)的基础部分,车辆检测系统在ITS中占有很重要的地位,目前常用的基于视频的车辆检测方法主要有:灰度比较法、背景差法、帧差法、边缘检测法.本文在分析这几种方法的优缺点的基础上,提出了一种基于数学形态学滤波和小波分解的算法.该算法首先对视频图像进行形态学滤波,然后在虚拟检测区进行小波分解,通过分析小波系数来检测车辆,它计算量小,复杂度低,可正确判断有无车辆、完成车辆的计数,实现车流量计算.     

二型模糊系统降型算法综述

二型模糊系统降型过程的计算精度、计算时间和系统信息的损失会对整个二型模糊系统的性能产生很大地影响. 本文首先介绍了二型模糊集合的基本概念及二型模糊系统的计算过程,然后分别对区间二型模糊系统和广义二型模糊系统的降型算法的研究现状进行了详细综述,并对不同降型算法计算的复杂性进行了全面的分析和比较. 最后,总结了各类降型算法存在的问题,并给出了未来研究的展望. 指出,降型算法的计算成本仍是提升二型模糊系统性能的瓶颈,从理论上完善各种降型算法,通过数学方法解决其计算的复杂性问题,并将其应用于实时系统会是未来研究的重点.      

A New Fusion Chemical Reaction Optimization Algorithm Based on Random Molecules for Multi-Rotor UAV Path Planning in Transmission Line Inspection

A fusion chemical reaction optimization algorithm based on random molecules (RMCRO) is proposed to meet the special demand of power transmission line inspection. This new algorithm improves the shortcomings of chemical reaction algorithm by merging the idea of repellent-attractant rule and accelerates convergence by using difference algorithm. The molecules in this algorithm avoid obstacles and search optimal path of transmission line inspection by using sensors on multi-rotor unmanned aerial vehicle (UAV). The option of optimal path is based on potential energy of molecules and cost function without repeated parameter adjustment and complicated computation. By compared with an improved particle swarm optimization (IMPSO) in different circumstances of simulation, it can be concluded that the new algorithm presented not only can obtain more optimal path and avoid to trap in local minimum, but also can keep related sensors in a more stable status.     

Regularization method and immune genetic algorithm for inverse problems of ship maneuvering

Ship maneuverability, in the field of ship engineering, is often predicted by maneuvering motion group MMG) mathematical model. Then it is necessary to determine hydrodynamic coefficients and interaction force coefficients of the model. Based on the data of free running model test, the problem for obtaining these coefficients is called inverse one. For the inverse problem, ill-oposedness is inherent, nonlinearity and great computation happen,and the computation is also insensitive, unstable and time-consuming. In the paper, a regnlarization method is introduced to solve ill-posed problem and genetic algorithm is used for nonlinear motion of ship maneuvering. In addition, the immunity is applied to solve the prematurity, to promote the global searching ability and to increase the converging speed. The combination of regnlarization method and immune genetic algorithm(RIGA) applied in MMG mathematical model, showed rapid converging speed and good stability.     

���������ij������������ģ�����㷨�о�

在对多配送中心车辆调度问题进行直观描述的基础上，建立了该问题的数学模型。提出了采用距离最近分配法将多配送中心车辆调度问题分解为多个单配送中心车辆调度问题进行求解的策略．基于求解单配送中心车辆调度问题的禁忌搜索算法，设计了求解多配送中心车辆调度问题的算法，并进行了实验计算．计算结果表明，用本文设计的算法求解多配送中心车辆调度问题，不仅可以取得很好的计算结果，而且算法的计算效率较高，收敛速度较快，计算结果也较稳定．     

Application of Auction Algorithm for Shortest Paths to Traffic Assignment

Auction algorithm is a new and simple algorithm for finding shortest paths in a directed graph proposed by Prof. Bertsekas, whose application has been extended to solve a variety of linear network flow problems. In this paper, auction algorithm for shortest paths is introduced and its characteristics are analyzed. The paper compares the auction algorithm with other algorithms widely used such as label-setting algorithm and label-correcting algorithm. The auction algorithm is particularly applicable to parallel computation and to the solution of a large-scale sparse network, which precisely meets the requirements of the traffic assignment. The algorithm is easy to program. Through a variety of measures the basic algorithm can be improved and speeded up and the computation speed can be increased by several times. The auction algorithm can be adopted in various traffic assignment methods. It can be used efficiently in the case of multiple origins and a single destination, and a single origin and multiple destinations. Different origin sets and destination sets are determined in accordance with the requirement of the traffic assignment. It is not required any more to find the shortest paths connecting any node pairs, so a lot of computation can be avoided and the computing time can be reduced by the use of the auction algorithm in the traffic assignment. Auction algorithms can thus be broadly applied in the transportation fields.     

框架可靠度计算的新方法

基于随机有限元的梯度优化算法引入拥有随机参数的框架可靠度分析.并编制计算程序与精确解Monte-Carlo法的计算结果进行了对比,证明该文方法用于框架结构可靠度分析是可行、可靠的,既避免了Monte-Carlo法计算量过大的缺点,又比传统的定值分析方法更合理,更贴近实际.     

框架可靠度计算的新方法

基于随机有限元的梯度优化算法引入拥有随机参数的框架可靠度分析.并编制计算程序与精确解Monte-Carlo法的计算结果进行了对比,证明该文方法用于框架结构可靠度分析是可行、可靠的,既避免了Monte-Carlo法计算量过大的缺点,又比传统的定值分析方法更合理,更贴近实际.     

DYNAMIC LABELING BASED FPGA DELAY OPTIMIZATION ALGORITHM

IntroductionIn recentyears,many FPGA technology map-ping algorithms for performance optimization havebeen presented[1～ 3 ] .Among them,DAG- MAP is arepresentative algorithm[3 ] .This algorithm is pro-grammed into a package and it mainly consists ofthree parts:1 preprocessing procedures transforman arbitrary Boolean network into a two- inputnet-work;2 the DAG- MAP algorithm maps the two-input network into a K- LUT FPGA network withminimum delay;3 postprocessing procedures per-form ar…