H.264变换编码及量化策略分析

H.264采用4×4的整数变换替代通用的8×8DCT变换.并将其融合在量化过程中,有效降低了变换算法的复杂度和运算量.避免了逆变换的失配问题.对H.264变换编码及量化策略进行了详细的分析,给出了其具体的实现过程.     

一维DCT变换编码的有限字长效应分析

本文对一维DCT变换压缩编码中变换域系数二次量化引起的图象损伤进行了频域和空间域分析，得出了一些有用的结论．通过对变换矩阵系数字长的分析和计算机模拟，为一维DCT变换压缩编码硬件实现时字长的确定提供了依据．硬件实验结果印证了上述分析的结论．     

基于预测编码与DCT变换编码的比较

深入分析了预测编码与DCT变换编码的异同点，并从编码增益、块效应系数、预测与变换与变换前后的能量关系等多方面比较了两种编码的优缺点。     

变换编码中直流偏移的快速处理

根据变换编辑码的持点,对变换编码中直流偏移处理提出一种快速算法。该算法通过交流常规的直流偏移和变换的顺序,可大大减少直流偏移的运算次数,余弦变换编码器的每个编码块的直流偏移运算次数降低至一次,小波变换变换块后的真流运算降低至分析增益为1的子带大小。例如对8×的DCT块直流偏移次数只需1次,对采用MALLAT方式的L层分解的二维图像,直流偏移次数只有原来的1/4L.     

H.264的变换编码和量化过程分析

对H．264协议的变换编码和量化进行了理论分析，给出了具体实现过程，论证了这种变换和量化方式的特点、有效性及应用前景。     

数字音频压缩中的变换编码算法

变换编码是音频压缩中的一个重要部分,文中叙述ＭＰＥＧ音频编码标准中的变换编码技术,包括改进余弦变换和反变换（ＭＤＣＴ和ＩＭＤＣＴ）时域混叠抵消与自适应窗选择,详细推导了ＭＤＣＴ和ＩＭＤＣＴ的快速算法。     

一种高性能的H.264变换编码IP设计

H.264是ITU与ISO联合共同开发的具有高编码效率、高压缩质量的视频新标准.H.264采用了4×4 块的无乘法整数变换编码算法,有效地降低了编解码的运算量,且避免了反变换的误匹配问题.文章通过详细分析H.264的整数DCT变换及Hardmard变换的算法,提出了一种高性能的变换编码的硬件IP设计,通过Modlesim仿真和DC综合能较好地达到预先设计要求.     

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

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

2D实值离散Gabor变换及其在图像变换编码中的应用

本文提出了二维实值离散Ｇａｂｏｒ变换（ＲＤＧＴ）的快速算法,并探讨了将其应用于图像压缩编码的基本方法。     

自适应变换编码的理论研究与硬件实现

本文介绍了一种建立在心理声学基础上的适用于宽频带数字音频信号的数据压缩技术，我们利用计算机对自适应变换编解码法的全过程进行了模拟，并采用Ｍｏｔｏｒｏｌａ公司的数字信号处理芯片ＤＳＰ５６００９作为硬件平台，实现了高质量的音频信号压缩编码，试验结果压缩比达到１／１０以下，而且没有明显的音质衰减。     

块重叠小波变换及其在音频编码中的应用

小波变换是信源编码技术的重要数学工具。然而,由于基于块的小波变换的基函数在块边界处的不连续性,导致解码信号在块边界存在“块效应”问题。本文采用块重叠小波变换的方法,利用变换基函数在块边界的连续性,消除了解码信号的“块效应”问题。基于块重叠小波包变换技术,设计了一个音频编码器,验证了上述方法的有效性。     

基于线预测及变换的帧内编码方法

提出一种以线为单位进行帧内预测编码的新方法,从预测及变换两方面提高帧内编码的性能。首先在宏块内部以水平或垂直方向的线为单位,分别参考相邻的行或列像素进行多个方向的帧内预测,减少了预测像素与参考像素间的距离,从而提高预测精度;其次,在原有的4×4离散余弦变换（DCT）基础上补充了1×16的一维DCT,并以宏块为基本单位灵...     

Direction-adaptive fixed length discrete cosine transform framework for efficient H.264/AVC video coding

The 2D-discrete cosine transform (2D-DCT) is one of the popular transformation for video coding. Yet, 2D-DCT may not be able to efficiently represent video data with fewer coefficients for oblique featured blocks. To further improve the compression gain for such oblique featured video data, this paper presents a directional transform framework based on direction-adaptive fixed length discrete cosine transform (DAFL-DCT) for intra-, and inter-frame. The proposed framework selects the best suitable transform mode from eight proposed directional transform modes for each block, and modified zigzag scanning pattern rearranges these transformed coefficients into a 1D-array, suitable for entropy encoding. The proposed scheme is analysed on JM 18.6 of H.264/AVC platform. Performance comparisons have been made with respect to rate-distortion (RD), Bjontegaard metrics, encoding time etc. The proposed transform scheme outperforms the conventional 2D-DCT and other state-of-art techniques in terms of compression gain and subjective quality.     

Hadamard transform image coding

The introduction of the fast Fourier transform algorithm has led to the development of the Fourier transform image coding technique whereby the two-dimensional Fourier transform of an image is transmitted over a channel rather than the image itself. This devlopement has further led to a related image coding technique in which an image is transformed by a Hadamard matrix operator. The Hadamard matrix is a square array of plus and minus ones whose rows and columns are orthogonal to one another. A high-speed computational algorithm, similar to the fast Fourier transform algorithm, which performs the Hadamard transformation has been developed. Since only real number additions and subtractions are required with the Hadamard transform, an order of magnitude speed advantage is possible compared to the complex number Fourier transform. Transmitting the Hadamard transform of an image rather than the spatial representation of the image provides a potential toleration to channel errors and the possibility of reduced bandwidth transmission.     

Pruned discrete Tchebichef transform for image coding in wireless multimedia sensor networks

After the successful development of the discrete cosine transform (DCT) especially in audio, image and video coding, many state-of-the-arts DCT-based fast algorithms have been developed. However, these algorithms are floating-point and are implemented with high algorithmic complexity and memory intensive. Therefore, they consume large system resources. In particular, those requirements pose a serious limitation on multimedia applications in resource-constrained systems, such as wireless multimedia sensor networks (WMSNs). In this paper we investigate an alternative to DCT transform which known as discrete Tchebichef transform (DTT). Despite its good energy compaction property, low algorithmic complexity and low memory requirements, the DTT is potentially unexploited in the literature. To further reduce its complexity and memory requirements, in this paper we propose a pruned version of DTT (P-DTT). Simulation results show that P-DTT requires a reduced number of arithmetic operations, energy consumption and memory. And it has at the same time competitive compression efficiency compared with Loeffler-DCT and exact DTT. The proposed P-DTT transform is a viable option for image compression and/or communication over WMSNs.     

Suboptimality of the Karhunen-Loeve transform for transform coding

We examine the performance of the Karhunen-Loeve transform (KLT) for transform coding applications. The KLT has long been viewed as the best available block transform for a system that orthogonally transforms a vector source, scalar quantizes the components of the transformed vector using optimal bit allocation, and then inverse transforms the vector. This paper treats fixed-rate and variable-rate transform codes of non-Gaussian sources. The fixed-rate approach uses an optimal fixed-rate scalar quantizer to describe the transform coefficients; the variable-rate approach uses a uniform scalar quantizer followed by an optimal entropy code, and each quantized component is encoded separately. Earlier work shows that for the variable-rate case there exist sources on which the KLT is not unique and the optimal quantization and coding stage matched to a "worst" KLT yields performance as much as 1.5 dB worse than the optimal quantization and coding stage matched to a "best" KLT. In this paper, we strengthen that result to show that in both the fixed-rate and the variable-rate coding frameworks there exist sources for which the performance penalty for using a "worst" KLT can be made arbitrarily large. Further, we demonstrate in both frameworks that there exist sources for which even a best KLT gives suboptimal performance. Finally, we show that even for vector sources where the KLT yields independent coefficients, the KLT can be suboptimal for fixed-rate coding.     

On the adaptive three-dimensional transform coding techniques for moving images

In this paper, an adaptive three-dimensional transform coding technique based on the 3-D discrete cosine transform (DCT) for removing the temporal correlation is proposed. Because of the nonstationary nature of the image data, the energy distribution in a 3-D DCT block varies along the vertical, horizontal and temporal directions. Thus, adaptive schemes, such as the 3-D classification, the classified linear scanning technique and the VLC table selection scheme, are used to take local variations into account. Also, in our approach, a hybrid technique, which adaptively combines relatively simple inter-frame coding with intra-frame coding, is presented. Through intensive computer simulations, the performance of the proposed 3-D transform coding technique is evaluated on several well-known moving sequences. The results show that, especially for moving sequences containing slow or moderate motion, the proposed technique provides an improved performance over the scheme with motion compensation (CCITT, 1989) at rates above 0.5 b/pixel (bpp), and a good visual quality of the reconstructed images is also obtained. Thus, the proposed 3-D transform coding technique is believed to be a good candidate for the digital VCR, since motion compensation is not required in the proposed 3-D coding technique.     

Digital image coding using legendre transform

Image coding can be implemented through DPCM, transform, hybrid, or segmentation coding techniques. Some transform coding techniques, such as cosine and Hadamard, have been exhaustively analyzed and evaluated, while others, such as Legendre, have not. This paper introduces the use of Legendre transform in image coding. The transform matrix for different block sizes is calculated, the fast algorithm is derived, and the performance is evaluated through both mean square error and subjective quality. The results obtained have indicated that the system performance is comparable with that of optimum KLT and cosine transforms; moreover, it is simpler in implementation.     

小波变换在傅立叶变换轮廓术中的应用

从小波变换本质、原理出发 ,说明它在提取条纹位相方面的应用 ,通过阐述小波变换与傅立叶变换两者之间的内在联系 ,将小波变换应用到傅立叶变换轮廓术中 ,并着重用傅立叶变换的原理对小波提取位相的原理进行详细解释。模拟结果表明 :小波变换在傅立叶变换轮廓术中的应用是正确的、可行的。