An analysis of the exponential stability of linear stochastic neutral delay systems

This paper is concerned with the analysis of the mean square exponential stability and the almost sure exponential stability of linear stochastic neutral delay systems. A general stability result on the mean square and almost sure exponential stability of such systems is established. Based on this stability result, the delay partitioning technique is adopted to obtain a delay‐dependent stability condition in terms of linear matrix inequalities (LMIs). In obtaining these LMIs, some basic rules of the Ito calculus are also utilized to introduce slack matrices so as to further reduce conservatism. Some numerical examples borrowed from the literature are used to show that, as the number of the partitioning intervals increases, the allowable delay determined by the proposed LMI condition approaches h_max, the maximal allowable delay for the stability of the considered system, indicating the effectiveness of the proposed stability analysis. Copyright © 2013 John Wiley & Sons, Ltd.     

On stability delay bounds of simple input-delayed linear and non-linear systems: Computational results

This paper deals with the problem of delay size stability analysis of single input-delayed linear and nonlinear systems. Conventional reduction, reduction linked by sliding mode, and linear memoryless control approaches are used for simple input-delayed systems to obtain the stability conditions. Several first order examples are investigated systematically to demonstrate the capabilities and limitations of the advanced stability analysis techniques including Lyapunov-Krasovskii functionals, Newton-Leibniz formula, and a newly addressed Lagrange mean value theorem. Numerical comparative results show the usefulness and effectiveness of the advanced delay size analysis techniques proposed in this paper.     

基于特征参数归一化的鲁棒语音识别方法综述

目前,自动语音识别系统往往会因为环境中复杂因素的影响,造成训练环境和测试环境存在不匹配现象,使得识别系统性能大幅度下降,极大地限制了语音识别技术的应用范围。近年来,很多鲁棒语音识别技术成功地被提出,这些技术的目标都是相同的,主要是提高系统的鲁棒性,进而提高识别率。其中,基于特征的归一化技术简单而有效,常常被作为鲁棒语音识别的首选方法,它主要是通过对特征向量的统计属性、累积密度函数或功率谱的归一化来补偿环境不匹配产生的影响。该文主要对目前主流的归一化方法进行介绍,其中包括倒谱矩归一化方法、直方图均衡化方法以及调频谱归一化方法等。     

GPU并行加速的均值偏移算法

为克服mean shift算法计算复杂度高、运行速度慢的缺点,提出一种基于GPU的快速mean shift算法.首先使用k-means算法对图像像素进行预分类,之后在预分类、下采样后缩小的数据集上进行mean shift聚类,以有效地降低算法复杂度.此外,借助GPU的通用计算功能对k-means和mean shift分别进行并行了处理.实验结果表明,通过对图像进行预处理,有效地提高了几何模板查找在强噪声、低信噪比图像中的识别率;同时,改进后的mean shift算法的运行速度提高了近40倍,满足了高速机器视觉检测的实时性要求.     

一种变迭代参数的变阶数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预测滤波能实时、准确地跟踪目标。     

control with limited communication and message losses

We propose an H^∞ approach to a remote control problem where the communication is constrained due to the use of a shared channel. The controller employs a periodic time sequencing scheme for message transmissions from multiple sensors and to multiple actuators of the system. It further takes into account the information on the random message losses that occur in the channel. An exact characterization for controller synthesis is obtained and is stated in terms of linear matrix inequalities. Furthermore, an analysis on the loss probabilities of the messages to accomplish stabilization is carried out. The results are illustrated through a numerical example.