Efficient Level and Zero Coding Methods for H.264/AVC Lossless Intra Coding

Since H.264/AVC was designed mainly for lossy video coding, the entropy coding methods in H.264/AVC are not appropriate for lossless video coding. Based on statistical differences of residual data in lossy and lossless coding, we develop efficient level and zero coding methods. Therefore, we design an improved context-based adaptive variable length coding (CAVLC) scheme for lossless intra coding by modifying the relative entropy coding parts in H.264/AVC. Experimental results show that the proposed method provides approximately 6.8% bit saving, compared with the H.264/AVC FRExt high profile.      

Efficient entropy coding scheme for H.264/AVC lossless video coding

Context-based adaptive variable length coding (CAVLC) and context-based adaptive binary arithmetic coding (CABAC) are entropy coding methods employed in the H.264/AVC standard. Since these entropy coders are originally designed for encoding residual data, which are zigzag scanned and quantized transform coefficients, they cannot provide adequate coding performance for lossless video coding where residual data are not quantized transform coefficients, but the differential pixel values between the original and predicted pixel values. Therefore, considering the statistical characteristics of residual data in lossless video coding, we newly design each entropy coding method based on the conventional entropy coders in H.264/AVC. From the experimental result, we have verified that the proposed method provides not only positive bit-saving of 8% but also reduced computational complexity compared to the current H.264/AVC lossless coding mode.     

Efficient Differential Pixel Value Coding in CABAC for H.264/AVC Lossless Video Compression

Since context-based adaptive binary arithmetic coding (CABAC) as the entropy coding method in H.264/AVC was originally designed for lossy video compression, it is inappropriate for lossless video compression. Based on the fact that there are statistical differences of residual data between lossy and lossless video compression, we propose an efficient differential pixel value coding method in CABAC for H.264/AVC lossless video compression. Considering the observed statistical properties of the differential pixel value in lossless coding, we modified the CABAC encoding mechanism with the newly designed binarization table and the context-modeling method. Experimental results show that the proposed method achieves an approximately 12% bit saving, compared to the original CABAC method in the H.264/AVC standard.     

Improved lossless intra coding for H.264/MPEG-4 AVC.

A new lossless intra coding method based on sample-by-sample differential pulse code modulation (DPCM) is presented as an enhancement of the H.264/MPEG-4 AVC standard. The H.264/AVC design includes a multidirectional spatial prediction method to reduce spatial redundancy by using neighboring samples as a prediction for the samples in a block of data to be encoded. In the new lossless intra coding method, the spatial prediction is performed based on samplewise DPCM instead of in the block-based manner used in the current H.264/AVC standard, while the block structure is retained for the residual difference entropy coding process. We show that the new method, based on samplewise DPCM, does not have a major complexity penalty, despite its apparent pipeline dependencies. Experiments show that the new lossless intra coding method reduces the bit rate by approximately 12% in comparison with the lossless intra coding method previously included in the H.264/AVC standard. As a result, the new method is currently being adopted into the H.264/AVC standard in a new enhancement project.     

VLC table prediction for CAVLC in H.264/AVC using correlation,statistics, and structural characteristics of mode information

The H.264/AVC video coding standard adopted context-based adaptive variable length coding (CAVLC) as an entropy coding tool. By combining adaptive variable length coding (VLC) with context modeling, we can achieve a high coding performance. However, CAVLC in H.264/AVC has the problem that VLC table prediction is not always accurate. In this paper, we propose a new VLC table prediction algorithm using the correlation between coding modes of the current and neighboring sub-blocks and the statistics of mode distribution in both intra and inter frames. In addition, we can further increase correctness of VLC table prediction considering the structural characteristics of mode information in inter frames. Experimental results show that the proposed algorithm increases correctness of VLC table prediction by 10.07% and reduces the bit rate by 1.21% on average without significant increment of encoding time.     

General Architecture for MPEG-2/H.263/H.264/AVC to H.264/AVC Intra Frame Transcoding

The latest international video-coding standard H.264/AVC significantly achieves better coding performance compared to prior video coding standards such as MPEG-2 and H.263, which have been widely used in today’s digital video applications. To provide the interoperability between different coding standards, this paper proposes an efficient architecture for MPEG-2/H.263/H.264/AVC to H.264/AVC intra frame transcoding, using the original information such as discrete cosine transform (DCT) coefficients and coded mode type. Low-frequency components of DCT coefficients and a novel rate distortion cost function are used to select a set of candidate modes for rate distortion optimization (RDO) decision. For H.263 and H.264/AVC, a mode refinement scheme is utilized to eliminate unlikely modes before RDO mode decision, based on coded mode information. The experimental results, conducted on JM12.2 with fast C8MB mode decision, reveal that average 58%, 59% and 60% of computation (re-encoding) time can be saved for MPEG-2, H.263, H.264/AVC to H.264/AVC intra frame transcodings respectively, while preserving good coding performance when compared with complex cascaded pixel domain transcoding (CCPDT); or average 88% (a speed up factor of 8) when compared with CCPDT without considering fast C8MB. The proposed algorithm for H.264/AVC homogeneous transcoding is also compared to the simple cascaded pixel domain transcoding (with original mode reuse). The results of this comparison indicate that the proposed algorithm significantly outperforms the mode reuse algorithm in coding performance, with only slightly higher computation.     

A pixel-wise directional intra prediction method

In a decade where the prominence of video applications has become increasingly prevalent, the optimization of video coding processes remains as important as ever. The directional intra prediction has been proved as an effective tool for intra picture coding. However, in a directional intra prediction based coding structure, there is a considerable gap between the transform efficiency of DCT and the optimal transform KLT. In this paper, we analyze these problems and propose a pixel-wise directional intra prediction (PDIP) method to solve this problem. This method exploits the reconstruction value of the adjacent pixels to predict the current pixel, and keeps the block-based lossy coding structure of H.264/AVC. The proposed method can significantly improve the coding efficiency with little decoding complexity increment.     

Data-parallel intra decoding for block-based image and video coding on massively parallel architectures

With the increasing number of processor cores available in modern computing architectures, task or data parallelism is required to maximally exploit the available hardware and achieve optimal processing speed. Current state-of-the-art data-parallel processing methods for decoding image and video bitstreams are limited in parallelism by dependencies introduced by the coding tools and the number of synchronization points introduced by these dependencies, only allowing task or coarse-grain data parallelism. In particular, entropy decoding and data prediction are bottleneck coding tools for parallel image and video decoding. We propose a new data-parallel processing scheme for block-based intra sample and coefficient prediction that allows fine-grain parallelism and is suitable for integration in current and future state-of-the-art image and video codecs. Our prediction scheme enables maximum concurrency, independent of slice or tile configuration, while minimizing synchronization points. This paper describes our data-parallel processing scheme for one- and two-dimensional prediction and investigates its application to block-based image and video codecs using JPEG XR and H.264/AVC Intra as a starting point. We show how our scheme enables faster decoding than the state-of-the-art wavefront method with speedup factors of up to 21.5 and 7.9 for JPEG XR and H.264/AVC Intra coding tools respectively. Using the H.264/AVC Intra coding tool, we discuss the requirements of the algorithm and the impact on decoded image quality when these requirements are not met. Finally, we discuss the impact on coding rate in order to allow for optimal parallel intra decoding.     

Fast block mode decision algorithm in H.264/AVC video coding

The recent video coding standard H.264/AVC show extremely higher coding efficiency compare to any other previous standards. H.264/AVC can achieve over 50% of bit rate saving with same quality using the rate–distortion process, but it brings high computational complexity. In this paper, we propose an algorithm that can reduce the complexity of the codec by reducing the block mode decision process adaptively. Block mode decision process in H.264/AVC consists of inter mode decision process and intra mode decision process. We deal with reduction method for inter and intra mode decision. In this paper an efficient method is proposed to reduce the inter mode decision complexity using the direct prediction methods based on block correlation and adaptive rate distortion cost threshold for early stopping. The fast intra mode reduction algorithm based on inter mode information is also proposed to reduce the computational complexity. The experimental results show that the proposed algorithm can achieve up to 63.34–77.39% speed up ratio with a little PSNR loss. Increment in bit requirement is also not much noticeable.     

一种基于H.264/AVC压缩域的GOP级视频场景转换检测算法

本文提出了一种基于H.264/AVC压缩域的GOP(Group of Pictures)级视频场景转换检测算法.该算法利用H.264/AVC基本档次码流中的帧内预测模式、运动矢量和宏块编码类型等可用信息,提出了基于子块的色度模式差异、累积运动值和累积帧内宏块数等三个判决准则,然后综合利用这三个判决准则,提出了一种GOP级的视频场景转换检测算法.实验结果表明,与现有的一个COP级场景检测算法对比,本文提出的GOP级视频场景转换检测算法可以获得更好的检测性能.     

融合宏块平坦度和时空相关性的预测模式选择算法

H.264/AVC以巨大编码复杂度为代价,在获得更高压缩率的同时,编码实时性也随之降低。针对视频编码中重要且耗时的帧间预测技术,分析了宏块平坦度和时空相关性,提出了一种快速的预测模式选择算法。仿真实验结果表明,本文提出算法与H.264/AVC(JM12.2)标准算法相比,在保持重建视频图像质量和输出码流结构的前提下,平均节省约70%的编码时间,并继承了H.264/AVC低码率的编码优势。     

Implicit Line-Based Intra 16×16 Prediction for H.264/AVC High-Quality Video Coding

In this paper, we propose an implicit line-based linear intra 16×16 prediction method for high-quality video coding. Typically, in H.264/AVC intra 16×16 vertical and horizontal prediction modes, 256 pixels in the current macroblock are predicted using 16 adjacent boundary pixels of reconstructed neighboring macroblocks. One problem of such a block-based intra prediction is that the prediction error increases as the distance between the reference and current pixels increases. Thus, the prediction accuracy of intra 16×16 vertical and horizontal modes is not sufficient for the mode decision stage. To ensure that the pixels are close to their predictor, we propose a new implicit intra prediction scheme, which makes full use of the correlation between lines instead of blocks. In the proposed method, we perform prediction, transformation, quantization, and reconstruction using the line-of-pixels (LOP) to improve the prediction accuracy. Experimental results show that the proposed algorithm provides an approximately 6.42?% bit-rate reduction compared to the H.264/AVC FRExt high profile, while maintaining the same decoding quality.     

A Fast Intra Skip Detection Algorithm for H.264/AVC Video Encoding

A fast intra skip detection algorithm based on the rate‐distortion (RD) cost for an inter frame (P‐slices) is proposed for H.264/AVC video encoding. In the H.264/AVC coding standard, a robust rate‐distortion optimization technique is used to select the best coding mode and reference frame for each macroblock (MB). There are three types of intra predictions according to profiles. These are 16×16 and 4×4 intra predictions for luminance and an 8×8 intra prediction for chroma. For the high profile, an 8×8 intra prediction has been added for luminance. The 4×4 prediction mode has 9 prediction directions with 4 directions for 16×16 and 8×8 luma, and 8×8 chrominance. In addition to the inter mode search procedure, an intra mode search causes a significant increase in the complexity and computational load for an inter frame. To reduce the computational load of the intra mode search at the inter frame, the RD costs of the neighborhood MBs for the current MB are used and we propose an adaptive thresholding scheme for the intra skip extraction. We verified the performance of the proposed scheme through comparative analysis of experimental results using joint model reference software. The overall encoding time was reduced up to 32% for the IPPP sequence type and 35% for the IBBPBBP sequence type.     

Modification and implementation of an edge-based fast intra prediction mode decision algorithm for H.264/AVC high resolution real-time systems

In this paper, we propose an architecture for H.264/AVC fast intra-prediction-mode decision making in high resolution real-time applications. Intra-prediction-mode decision making requires many computations of H.264/AVC video coding, and also extra time for mode generation for intra prediction mode decisions. Hence, there exists a bottleneck in the execution of high resolution real-time applications. To improve the operation of intra prediction mode decision, we use an algorithm which, based on the edge information of an object, will reduce estimations of mode predictions by 66%; with negligible loss of video quality and a small increase in bit-rate of video stream. We propose a low cost architecture, with gate counts reduced by 50% compared with former design. The total gate count is 86,671 and the maximum operating frequency is 250 MHz using TSMC 0.18 μm cell-based technology. The experimental results show our design is a strong competitor with most modern high resolution, real-time video processing.     

Introduction to the High-Efficiency Video Coding Standard

The high-efficiency video coding(HEVC) standard is the newest video coding standard currently under joint development by ITU-T Video Coding Experts Group(VCEG) and ISO/IEC Moving Picture Experts Group(MPEG).HEVC is the next-generation video coding standard after H.264/AVC.The goals of the HEVC standardization effort are to double the video coding efficiency of existing H.264/AVC while supporting all the recognized potential applications,such as,video telephony,storage,broadcast,streaming,especially for large picture size video(4k × 2k).The HEVC standard will be completed as an ISO/IEC and ITU-T standard in January 2013.In February 2012,the HEVC standardization process reached its committee draft(CD) stage.The ever-improving HEVC standard has demonstrated a significant gain in coding efficiency in rate-distortion efficiency relative to the existing H.264/AVC.This paper provides an overview of the technical features of HEVC close to HEVC CD stage,covering high-level structure,coding units,prediction units,transform units,spatial signal transformation and PCM representation,intra-picture prediction,inter-picture prediction,entropy coding and in-loop filtering.The HEVC coding efficiency performances comparing with H.264/AVC are also provided.     

一种HEVC帧内快速编码算法

高效视频编码(HEVC)采用编码单元(CU)四叉树的 分割结构,相比H.264/AVC显著地提升了编码效 率,但却使编码复杂度急剧增加。为此,本文提出一种帧内快速编码算法。首先,根据视 频图像纹理复 杂度,提前判断是否进行最大编码单元(LCU)分割。然后,根据空域相邻CU的深度预测当前C U的深度范围, 跳过不必要的计算;最后,根据预测模式被选为最优预测模式的统计特性,去掉可能性小的 帧内预测模式。本文算法在HM14.0的基础上实现。 仿真结果表明,本文算法在全I帧模式下与HM14.0相比,帧内编码时 间平均减少38%,码率(BR)只增加1.41%,峰值信噪比(PSNR)只降低0.29dB,在保证编码性能和视频质量几乎不变的 情况下,本文算法降低了编码的计算复杂度。     

H.264中帧内编码算法及其快速实现研究

新的视频编码标准H.264使用了帧内预测的编码方式,这与以往的视频编码标准相比在很大程度上提高了帧内编码效率,节省了码流,但同时也增加了编码器的复杂度,因此有必要对H.264帧内编码算法进行快速实现,以满足实时视频通信的要求.首先详细介绍H.264帧内编码的实现过程,然后使用SIMD(单指令多数据流)技术对帧内编码进行快速实现.实验结果表明,与未使用快速算法相比,使用该快速实现算法后,H.264帧内编码速度得到显著提高.     

A high performance and low complexity sampling-based intra coding method for H.264/AVC

The H.264/AVC video coding standard can achieves higher compression performance than previous video coding standards, such as MPEG-2, MPEG-4, and H.263. Especially, in order to obtain the high coding performance in intra pictures, the H.264/AVC encoder employs various directional spatial prediction modes and the rate-distortion (RD) optimization technique inducing high computational complexity. For further improvement in the coding performance with the low computational complexity, we introduce a sampling-based intra coding method. The proposed method generates two sub-images, which are defined as a sampled sub-image and a prediction error sub-image in this paper, from an original image through horizontal or vertical sampling and prediction processes, and then each sub-image is encoded with different intra prediction modes, quantization parameters, and scanning patterns. Experimental results demonstrate that the proposed method significantly improves the intra coding performance and reduces the encoding complexity with the smaller number of the RD cost calculation process.     

一种基于二维直方图的H.264/AVC快速帧内预测判决算法

最新的视频压缩标准H.264/AVC具有极高的压缩率,但由于其算法极其复杂,编码时间较长,无法达到实时应用的要求。该文针对其帧内预测算法的特点,提出了一种基于二维直方图的快速帧内预测算法。该算法在进行帧内预测之前先对宏块预判,从两种帧内预测模式中选择一种,从而减少了算法的复杂度,提高了压缩速度。实验结果表明,所提的算法在码率只有少许增加的情况下,编码速度提高了16.26%,PSNR值基本不变。     

Fast mode decision algorithm for intra prediction in H.264/AVC with integer transform and adaptive threshold

Compared with other existing video coding standards, H.264/AVC can achieve a significant improvement in compression performances. A robust criterion named the rate distortion optimization (RDO) is employed to select the optimal coding modes and motion vectors for each macroblock (MB), which achieves a high compression ratio while leading to a great increase in the complexity and computational load unfortunately. In this paper, a fast mode decision algorithm for H.264/AVC intra prediction based on integer transform and adaptive threshold is proposed. Before the intra prediction, integer transform operations on the original image are executed to find the directions of local textures. According to this direction, only a small part of the possible intra prediction modes are tested for RDO calculation at the first step. If the minimum mean absolute error (MMAE) of the reconstructed block corresponding to the best mode is smaller than an adaptive threshold which depends on the quantization parameter (QP), the RDO calculation is terminated. Otherwise, more possible modes need to be tested. The adaptive threshold aims to balance the compression performance and the computational load. Simulation results with various video sequences show that the fast mode decision algorithm proposed in this paper can accelerate the encoding speed significantly only with negligible PSNR loss or bit rate increment. This work is supported in part by China National Natural Science Foundation (CNSF) under Project No.60572045, the Ministry of Education of China Ph.D. Program Foundation under Project No.20050698033, and by a Cooperation Project (2005.7– 2007.7) with Microsoft Research Asia.