H.264变换编码与量化原理分析

详细分析了 H .2 64视频编码标准中的整数变换和量化过程。 H .2 64采用 4× 4整数变换 ,并将尺度调整融合在量化过程中 ,降低变换算法复杂度和减少乘法次数 ,相对于以前的编码标准更加有效     

基于神经网络的VQ图象编码

文章给出将神经网络与矢量量化相结合的两种编码方法，介绍了其原理和实现的算法。经计算机模拟表明，在比特率低于０．３ｂｐｐ时仍可得到高质量的编码图象。     

基于小波变换的医学图象压缩编码

本文研究了医学图象小波变换系数的统计特征。根据医学图象的特点，提出了基于小波变换的医学图象编码方法。实验表明，这种方法具有较好的压缩编码性能，优于JPEG标准。同时，它支持逐次浮现式传输，从而能满足医学图象存储、通信、检索的需要。     

Best L1 Piecewise Monotonic Data Modelling

Let us consider n data measurements of a univariate process that have been altered by random errors. We assume that an underlying model function has a substantially smaller number of turning points than the observed ones. We propose algorithms that make least the sum of the moduli of the errors by requiring k monotonic sections, alternately increasing and decreasing, in the sequence of the smoothed values. The main difficulty in this calculation is that the optimal positions of the joins of the monotonic sections have to be found automatically among so many combinations that it is impossible to test each one separately. Moreover, the calculation seems to be very intractable to general optimization techniques because O(n^k) local minima can occur. It is shown that dynamic programming can be used for separating the data into optimal disjoint sections of adjacent data, where each section requires a single L₁ monotonic calculation. This procedure is highly efficient, requiring at most O(kn²) computer operations and O(n) best L₁ monotonic calculations to subranges of data for a global minimum.     

迭加与量化水印嵌入方案的比较及量化参数优化

分别研究了迭加法和量化法的隐蔽性和稳健性，并且提出了量化调制水印方案中的参数优化方法。对两类方法的分析比较表明，迭加法适用于在高频分量嵌入水印，而量化法适用于在低频分量嵌入水印。并以实验验证了这一结论。     

Isometric Piecewise Polynomial Curves

The main preoccupations of research in computer-aided geometric design have been on shape-specification techniques for polynomial curves and surfaces, and on the continuity between segments or patches. When modelling with such techniques, curves and surfaces can be compressed or expanded arbitrarily. There has been relatively little work on interacting with direct spatial properties of curves and surfaces, such as their arc length or surface area. As a first step, we derive families of parametric piecewise polynomial curves that satisfy various positional and tangential constraints together with arc-length constraints. We call these curves isometric curves. A space curve is defined as a sequence of polynomial curve segments, each of which is defined by the familiar Hermite or Bézier constraints for cubic polynomials; as well, each segment is constrained to have a specified arc length. We demonstrate that this class of curves is attractive and stable. We also describe the numerical techniques used that are sufficient for achieving real time interaction with these curves on low-end workstations.     

Uniform modeling of parameter dependent nonlinear systems

This paper addresses the problem of approximating parameter dependent nonlinear systems in a unified framework. This modeling has been presented for the first time in the form of parameter dependent piecewise affine systems. In this model, the matrices and vectors defining piecewise affine systems are affine functions of parameters. Modeling of the system is done based on distinct spaces of state and parameter, and the operating regions are partitioned into the sections that we call ’multiplied simplices’. It is proven that this method of partitioning leads to less complexity of the approximated model compared with the few existing methods for modeling of parameter dependent nonlinear systems. It is also proven that the approximation is continuous for continuous functions and can be arbitrarily close to the original one. Next, the approximation error is calculated for a special class of parameter dependent nonlinear systems. For this class of systems, by solving an optimization problem, the operating regions can be partitioned into the minimum number of hyper-rectangles such that the modeling error does not exceed a specified value. This modeling method can be the first step towards analyzing the parameter dependent nonlinear systems with a uniform method.     

一种基于小波变换的非均匀量化索引调制水印算法

为了提高数字水印的稳健性与不可见性,将图像小波变换与量化索引调制算法相结合,提出了一种基于小波变换的非均匀量化索引调制数字水印算法。该算法对原始图像进行离散小波变换,将中频小波系数分成3×3的系数子块作为水印载体,对子块的系数均值采用非均匀量化索引调制,实现二值水印的嵌入。根据人类视觉特性,不同的系数子块采用不同的量化间隔并自适应于子块内相邻系数的差值。实验结果表明,该算法透明性好,安全性高,对高斯白噪声、剪切、滤波以及JPEG压缩等常见攻击具有较强的稳健性。     

点扩展函数与采样频率及量化精度对图像边缘的影响分析

文章在建立理想边缘成像模型的基础上,分析研究了一般成像系统的点扩展函数与空间采样频率的关系及对图像边缘定位精度的影响,给出了边缘定位误差.同时,还分析研究了量化精度对图像边缘的移位影响,给出了移位误差.最后,给出了本文的分析研究在零件视觉精密检测的应用情况.     

New results on PWARX model identification based on clustering approach

This paper deals with the problem of piecewise auto regressive systems with exogenous input(PWARX) model identification based on clustering solution. This problem involves both the estimation of the parameters of the affine sub-models and the hyper planes defining the partitions of the state-input regression. The existing identification methods present three main drawbacks which limit its effectiveness. First, most of them may converge to local minima in the case of poor initializations because they are based on the optimization using nonlinear criteria. Second, they use simple and ineffective techniques to remove outliers. Third, most of them assume that the number of sub-models is known a priori. To overcome these drawbacks, we suggest the use of the density-based spatial clustering of applications with noise(DBSCAN) algorithm. The results presented in this paper illustrate the performance of our methods in comparison with the existing approach. An application of the developed approach to an olive oil esterification reactor is also proposed in order to validate the simulation results.