A signal adaptive diffusion filter for video coding: Mathematical framework and complexity reductions

In this paper we combine video compression and modern image processing methods. We construct novel iterative filter methods for prediction signals based on Partial Differential Equation (PDE) based methods. The mathematical framework of the employed diffusion filter class is given and some desirable properties are stated. In particular, two types of diffusion filters are constructed: a uniform diffusion filter using a fixed filter mask and a signal adaptive diffusion filter that incorporates the structures of the underlying prediction signal. The latter has the advantage of not attenuating existing edges while the uniform filter is less complex. The filters are embedded into a software based on HEVC with additional QTBT (Quadtree plus Binary Tree) and MTT (Multi-Type-Tree) block structure. In this setting, several measures to reduce the coding complexity of the tool are introduced, discussed and tested thoroughly. The coding complexity is reduced by up to 70% while maintaining over 80% of the gain. Overall, the diffusion filter method achieves average bitrate savings of 2.27% for Random Access having an average encoder runtime complexity of 119% and 117% decoder runtime complexity. For individual test sequences, results of 7.36% for Random Access are accomplished.     

基于矢量平均的信道估计算法

提出一种适用于DS-CDMA无线通信系统的低计算量而性能良好的信道估计算法。在DS-CDMA系统中，当接收信号经过解扩或多用户检测等时域预处理后，可以认为干扰大大减弱、期望信号在处理后的信号中占主要地位。这样，用预处理后信号相关阵的最大特征值对应的特征矢量可以很好地近似期望信号的信道矢量。但是，直接特征分解需要很大的计算量，特征跟踪计算量较低，但瞬态性能较差。本文提出一种基于相关矩阵列矢量平均的信道估计算法，该算法不需要特征分解或跟踪。仿真结果表明：新算法在降低计算量的情况下可以获得同直接特征分解方法几乎相同的性能。     

具有控制项的限定记忆卡尔曼滤波器

在已有的限定记忆卡尔曼滤波器的基础上 ,将确定性先验信息作为控制项加以应用 ,推导出了完整的限定记忆卡尔曼滤波公式 ,从而在记忆长度确定的情况下 ,有效地减小了模型不准的误差 ,降低了滤波总误差。仿真同样表明了该方法的有效性     

Kalman filtering of a space-time Markov random field

In this paper, finite-dimensional recursive filters for space-time Markov random fields are derived. These filters can be used with the expectation maximization (EM) algorithm to yield maximum likelihood estimates of the parameters of the model.     

Image processing using cellular neural networks based on multi-valued and universal binary neurons

Multi-valued and universal binary neurons (MVN and UBN) are the neural processing elements with the complex-valued weights and high functionality. It is possible to implement an arbitrary mapping described by partially defined multiple-valued function on the single MVN. An arbitrary mapping described by partially defined or fully defined Boolean function, which can be non-threshold, may be implemented on the single UBN. The quickly converging learning algorithms exist for both types of neurons. Such features of the MVN and UBN may be used for solving the different problems. One of the most successful applications of the MVN and UBN is their usage as basic neurons in the Cellular Neural Networks (CNN). It opens the new effective opportunities in nonlinear image filtering and its applications to noise reduction, edge detection and solving of the super resolution problem. A number of experimental results are presented to illustrate the performance of the proposed algorithms.An erratum to this article can be found at     

N指标d维广义Wiener过程象集的m项代数和的几个性质

设珮犠（狋）：犚犖＋ →犚犱是犖指标犱维广义Ｗｉｅｎｅｒ过程，对任意紧集犈１，…，犈犿犚犖＞ ，该文研究了犿项代数和珮犠（犈１）…珮犠（犈犿）的Ｈａｕｓｄｏｒｆｆ维数，Ｐａｃｋｉｎｇ维数和正的Ｌｅｂｅｓｇｕｅ测度及内点的存在性． 其结果包含并推广了布朗单的结果．     

Oracle Inequalities for Efromovich–Pinsker Blockwise Estimates

Oracle inequality is a relatively new statistical tool for the analysis of nonparametric adaptive estimates. Oracle is a good pseudo-estimate that is based on both data and an underlying estimated curve. An oracle inequality shows how well an adaptive estimator mimics the oracle for a particular underlying curve. The most advanced oracle inequalities have been recently obtained by Cavalier and Tsybakov (2001) for Stein type blockwise estimates used in filtering a signal from a stationary white Gaussian process. The authors also conjecture that a similar result can be obtained for Efromovich–Pinsker (EP) type blockwise estimators where their approach, based on Stein's formula for risk calculation, does not work. This article proves the conjecture and extends it upon more general models which include not stationary and dependent processes. Other possible extensions, a discussion of practical implications and a numerical study are also presented.     

磁电垒结构中自旋极化输运性质的研究

研究了电子隧穿几类磁电垒结构的自旋极化输运性质，导出统一的传输概率公式，揭示了非 均匀磁场的分布与自旋过滤的关系，同时表明采用有效朗德因子较大的半导体材料可以显著 增强磁电垒结构的自旋过滤效果. 关键词： 磁电垒 自旋过滤 自旋电子学 自旋极化     

Fourier-Feynman transform, convolution and first variation

We examine several interesting relationships and expressions involving Fourier-Feynman transform, convolution product and first variation for functionals in the Fresnel class F(B) of an abstract Wiener space B. We also prove a translation theorem and Parseval's identity for the analytic Feynman integral. This revised version was published online in June 2006 with corrections to the Cover Date.