H.264帧内预测模式选择快速算法的研究

提出一种适用于H.264帧内预测的快速算法,利用相邻像素间的梯度筛选预测模式来避免不必要的预测模式计算。实验结果表明:用全I帧编码,该算法在图像质量和输出码率基本不变的情况下,编码时间大约节省了60%。     

On calibration error of randomized forecasting algorithms

It has been recently shown that calibration with an error less than Δ>0$\Delta >0$ is almost surely guaranteed with a randomized forecasting algorithm, where forecasts are obtained by random rounding the deterministic forecasts up to Δ$\Delta$. We show that this error cannot be improved for a vast majority of sequences: we prove that, using a probabilistic algorithm, we can effectively generate with probability close to one a sequence “resistant” to any randomized rounding forecasting with an error much smaller than Δ$\Delta$. We also reformulate this result by means of a probabilistic game.     

Stabilizing switching design for switched linear systems: A state-feedback path-wise switching approach

This paper addresses the problem of switching stabilization for discrete-time switched linear systems. Based on the abstraction-aggregation methodology, we propose a state-feedback path-wise switching law, which is a state-feedback concatenation from a finite set of switching paths each defined over a finite time interval. We prove that the set of state-feedback path-wise switching laws is universal in the sense that any stabilizable switched linear system admits a stabilizing switching law in this set. We further develop a computational procedure to calculate a stabilizing switching law in the set.     

Stable local dimensionality reduction approaches

Dimensionality reduction is a big challenge in many areas. A large number of local approaches, stemming from statistics or geometry, have been developed. However, in practice these local approaches are often in lack of robustness, since in contrast to maximum variance unfolding (MVU), which explicitly unfolds the manifold, they merely characterize local geometry structure. Moreover, the eigenproblems that they encounter, are hard to solve. We propose a unified framework that explicitly unfolds the manifold and reformulate local approaches as the semi-definite programs instead of the above-mentioned eigenproblems. Three well-known algorithms, locally linear embedding (LLE), laplacian eigenmaps (LE) and local tangent space alignment (LTSA) are reinterpreted and improved within this framework. Several experiments are presented to demonstrate the potential of our framework and the improvements of these local algorithms.     

Predictive models for emission of hydrogen powered car using various artificial intelligent tools

This paper investigates the use of artificial intelligent models as virtual sensors to predict relevant emissions such as carbon dioxide, carbon monoxide, unburnt hydrocarbons and oxides of nitrogen for a hydrogen powered car. The virtual sensors are developed by means of application of various Artificial Intelligent (AI) models namely; AI software built at the University of Tasmania, back-propagation neural networks with Levenberg–Marquardt algorithm, and adaptive neuro-fuzzy inference systems. These predictions are based on the study of qualitative and quantitative effects of engine process parameters such as mass airflow, engine speed, air-to-fuel ratio, exhaust gas temperature and engine power on the harmful exhaust gas emissions. All AI models show good predictive capability in estimating the emissions. However, excellent accuracy is achieved when using back-propagation neural networks with Levenberg–Marquardt algorithm in estimating emissions for various hydrogen engine operating conditions with the predicted values less than 6% of percentage average root mean square error.     

基于运动方向预测的快速运动估计算法

利用序列图像的相邻块运动矢量的高度相关性和运动矢量的中心偏移特性,提出一种基于运动方向预测的快速运动估计算法。设计4种方向性模板,根据参考运动矢量预测出图像块的运动情况,根据不同的运动方向选择对应的方向性模板进行搜索。实验结果表明,该算法在速度和准确性方面都优于传统的快速运动估计算法。     

一类混沌序列线性复杂度的分析

针对传统密码学中由线性移位寄存器生成的序列在统计特性上的不足,提出一种基于混沌的序列密码生成方法,并在有限精度实现时引入Legendre扰动序列使得输出具有良好的统计特性。用B-M算法对其进行线性复杂度分析,并与等效的线性反馈移位寄存器的复杂度进行比较,结果显示该混沌序列具有良好的非线性特性,保密性好且软件实现简单。     

基于改进基因表达式程序设计的股票指数预测

介绍基因表达式程序设计方法的基本原理,针对股票指数分析与预测问题,在经典的GEP算法基础上,提出一种基于动态变异算子的改进的GEP算法——IGEP算法,动态变异算子随着进化代数和染色体所含基因数目不同而变化,从而加快了GEP的收敛速度和精确度,对算法进行了复杂度和收敛性分析。设计一种基于IGEP的股票指数分析与预测算法,数值实验结果表明,该算法优于经典GEP算法,具有较广泛的通用性。     

一种改进的步态识别方法

步态识别通过人体走路的姿势来识别人的身份。近年来,步态作为一种生物特征识别技术备受计算机视觉研究者的关注。对某个人的一个步态序列利用动态Viterbi算法得到一个样本姿态序列,对其多个步态样本姿态序列的对应姿态取平均得到这个人的特征姿态序列,对特征姿态采用主成分分析法和线性判别分析法处理特征空间,并用最近邻法进行识别。利用CASIA数据库对本文方法进行验证,取得了较高的识别率,并对体形变化具有较强的鲁棒性。     

Output feedback robust MPC for LPV system with polytopic model parametric uncertainty and bounded disturbance

The output feedback robust model predictive control (MPC), for the linear parameter varying (LPV) system with norm-bounded disturbance, is addressed, where the model parametric matrices are only known to be bounded within a polytope. The previous techniques of norm-bounding technique, quadratic boundedness (QB), dynamic output feedback, and ellipsoid (true-state bound; TSB) refreshment formula for guaranteeing recursive feasibility, are fused into the newly proposed approaches. In the notion of QB, the full Lyapunov matrix is applied for the first time in this context. The single-step dynamic output feedback robust MPC, where the infinite-horizon control moves are parameterised as a dynamic output feedback law, is the main topic of this paper, while the multi-step method is also suggested. In order to strictly guarantee the physical constraints, the outer bound of the true state replaces the true state itself, so tightness of this bound has a major effect on the control performance. In order to tighten the TSB, a procedure for refreshing the real-time ellipsoid based on that of the last sampling instant is given. This paper is conclusive for the past results and far-reaching for the future researches. Two benchmark examples are given to show the effectiveness of the novel results.