一种变迭代参数的变阶数LMS算法

介绍了基于分数阶数的变阶数最小均方算法(Fractional tap-length least mean square,FTLMS),分析算法中迭代参数对FTLMS算法收敛性能的影响.利用系统输出误差随滤波器阶数及滤波器抽头权系数迭代过程逐渐减小的特点,提出了一种新的变迭代参数的变阶数LMS算法(Variable parameter FTLMS,VP-FTLMS).在高噪声和低噪声环境下对本文提出的算法分别进行仿真验证,并与不同的滤波器阶数迭代参数设置下的FTLMS算法相比较.仿真结果表明,与FTLMS算法相比,本文提出的VP-FTLMS算法具有更快的阶数收敛速度及更小的稳态振荡,同时获得了较小的稳态额外均方误差(Excess mean square error,EMSE).     

基于图像处理技术的离线手写签名鉴别方法

由于手写签名具有高度的唯一性、不遗忘性、自然性与可靠性已成为身份识别的研究热点。文中对手写签名识别技术主要是离线手写签名识别技术进行了详细分析,在研究手写签名的特点和在身份认证中实用性的基础上,提出了一种基于图像处理技术的手写签名鉴别方案,该方案利用了图像的缩放和膨胀细化技术对图像进行处理,然后利用均方差和峰值信噪比来评价签名图像的相似度。试验数据表明该鉴别方法简单可行且高效,能获得较好的验证率和鉴别率。     

一种MIMO-OFDM系统的信道估计算法

导频辅助的最小平方（LS）算法是MIMO—OFDM系统中常用的信道估计方法,特点是易于实现,但精度不高。基于最小均方误差（MMSE）的信道估计算法性能较好,但复杂度高,难以实现。提出了一种基于离散傅里叶变换（DFT）的信道估计算法,首先将LS信道估计循环前缀长度以外的时域响应值置零,然后选择重要路径,再通过计算参考导频的相位偏移量来进行补偿,最终实现信道的估计。算法能够满足一定的估计精度,且便于实现。仿真数据证明了算法的有效性。     

结合Camshift和Kalman预测的运动目标跟踪

针对单一的CamShift跟踪算法在目标发生遮挡时非常容易致使跟踪目标失败的问题,本文提出了一种基于CamShift和Kalman预测的跟踪算法。首先,采用帧间差分阈值法来快速、精确地检测和提取出运动目标;然后,通过在CamShift算法中使用运动目标的颜色特征,在图像序列中找到运动目标的所在位置和大小;最后,使用Kalman滤波预测目标的位置,进而有效地解决了背景中大面积相同颜色的干扰和目标部分被遮挡等问题。用无线遥控车完成了运动目标的跟踪实验,实验证明结合CamShift算法和Kalman预测滤波能实时、准确地跟踪目标。     

Faster ARMA maximum likelihood estimation

A new likelihood based AR approximation is given for ARMA models. The usual algorithms for the computation of the likelihood of an ARMA model require O(n) flops per function evaluation. Using our new approximation, an algorithm is developed which requires only O(1) flops in repeated likelihood evaluations. In most cases, the new algorithm gives results identical to or very close to the exact maximum likelihood estimate (MLE). This algorithm is easily implemented in high level quantitative programming environments (QPEs) such as Mathematica, MatLab and R. In order to obtain reasonable speed, previous ARMA maximum likelihood algorithms are usually implemented in C or some other machine efficient language. With our algorithm it is easy to do maximum likelihood estimation for long time series directly in the QPE of your choice. The new algorithm is extended to obtain the MLE for the mean parameter. Simulation experiments which illustrate the effectiveness of the new algorithm are discussed. Mathematica and R packages which implement the algorithm discussed in this paper are available [McLeod, A.I., Zhang, Y., 2007. Online supplements to “Faster ARMA Maximum Likelihood Estimation”, 〈http://www.stats.uwo.ca/faculty/aim/2007/faster/〉]. Based on these package implementations, it is expected that the interested researcher would be able to implement this algorithm in other QPEs.     

梯度均值预测滤波算法及其应用

测量误差不可避免的存在于各种测量系统之中.针对缓慢变化的测量数据中存在的随机误差,结合传统滤波方法的优点,提出了梯度均值预测滤波算法,阐述了算法的基本思想和流程,并结合桥梁挠度连续测量系统的测量数据进行了滤波实验,结果表明,该算法能够有效去除缓慢变化的测量数据中的干扰信号,滤波效果明显.     

大气湍流图像像素偏差机理分析

对大气湍流导致图像畸变和像素偏差的因素进行了深入分析,对大气湍流状态下激光发射远距离光束的光束漂移均方值进行仿真,分析光束漂移均方值曲线,为后续对图像畸变、像素偏差校正及克服湍流影响提供有效的理论依据。     

A new scaling algorithm for the maximum mean cut problem

We present a new scaling algorithm for the maximum mean cut problem. The mean of a cut is defined by the cut capacity divided by the number of arcs crossing the cut. The algorithm uses an approximate binary search and solves the circulation feasibility problem with relaxed capacity bounds. The maximum mean cut problem has recently been studied as a dual analogue of the minimum mean cycle problem in the framework of the minimum cost flow problem by Ervolina and McCormick. A networkN=(G, lower, upper) with lower and upper arc capacities is said to be -feasible ifN has a feasible circulation when we relax the capacity bounds by ; that is, we use (lower(a)- , upper(a)+) bounds instead of (lower(a), upper(a)) bounds for each arca A. During an approximate binary search we maintain two bounds,LB andUB, such thatN is LB-infeasible andUB-feasible, and we reduce the interval size (LB, UB) by at least one-third at each iteration. For a graph withn vertices, m arcs, and integer capacities bounded byU, the running time of this algorithm is O(mn log(nU). This time bound is better than the time achieved by McCormick and Ervolina under thesimilarity condition (that is,U=O(n^o(1))). Our algorithm can be naturally used for the circulation feasibility problem, and thus provides a new scaling algorithm for the minimum cut problem.Research supported by a grant-in-aid of the Ministry of Education, Science and Culture of Japan.     

基于MELMD-ICA的光纤振动信号降噪方法

针对分布式光纤传感系统所采集含噪信号,提出一种改进集成局部均值分解(MELMD)联合独立成分分析(ICA)的降噪方法,引入排列熵判决机制提高抑制模态混叠与虚假分量能力。首先使用MELMD方法分解含噪信号得到乘积函数(PF)并进行信号重构;将含噪信号和重构信号求差得到虚拟噪声,构造虚拟通道;然后使用ICA对含噪信号和虚拟通道进行信噪分离,得到最终结果。通过实验验证,该方法与EMD-ICA,EEMD-ICA,MELMD相比,能更好地消除信号中的噪声,保留信号的特征信息。