H.264视频编码帧间与帧内预测模式算法的改进

H.264是目前应用最广泛的视频编码标准,相比于以前的标准,H.264在编码效率上得到了很大的提高.但是相应的计算复杂度也是成倍增加.在此提出一种改进的预测算法,通过时域相关性系数和空域相关性系数排除帧内预测或帧外预测的一些模式,初步减少编码复杂度,再针对分析结果利用已有的快速选择算法对帧内帧外预测模式的最优预测模式组进行预测,进一步加快编码速度.实验结果表明,改进的快速算法在不影响编码质量的同时能够有效地减少计算复杂度和提高编码速度.     

新一代视频编码技术HEVC算法分析及比较

新一代视频编码标准HEVC更倾向于处理高清视频,实现在设备复杂度有一定增加的前提下提高视频,尤其是高清视频的编码效率。结合现行的H.264标准,对比了HEVC标准在编码结构、帧内预测、帧间预测以及熵编码技术上的改进和算法上的优化。对HEVC的具体编码技术进行分析,并将HEVC与H.264编码性能进行了比较。实验结果表明,HEVC在编码性能上有了明显提高。     

H．264帧内预测算法的研究与优化

H．264作为最新的视频编码标准,为了获得最佳的帧内和帧间预测,H．264采用了率失真优化（RDO）技术,提高了编码质量,降低了比特率。RDO技术对所有的帧内／帧间预测模式采用全搜索算法,导致了很高的计算复杂度。本文中,引入了一种新颖的快速帧内预测算法,改变模式选择的顺序,利用临块之间预测模式的相关性,通过阈值比较及绝对差值和排序的方式,对H．264帧内预测算法进行了优化。实验结果表明：与全搜索算法相比,快速算法降低了30％左右的编码时间,而信噪比、码流几乎不变。     

H．264视频编码中快速的帧内预测模式选择

H．264作为最新的视频编码标准，因其拥有了新的特征（例如：帧内帧间预测），也就实现了较好的视频压缩。为了获得最佳的帧内和帧间预测，H．264采用了率失真优化（RDO）技术，提高了编码质量，降低了比特率。RDO技术对所有的帧内／帧间预测模式进行全盘搜索，导致了很高的计算复杂性。本文中，引入了一个新颖的快速帧内预测算法，该算法使用了宏块的特性，并基于主边缘增强（dominant edge strength）技术的。实验结果表明：和全搜索算法相比，引入的算法降低了30％左右的编码时间，而信噪比几乎不变。     

利用变换域信息快速实现H.264帧内预测编码的新算法

新的视频编码标准H.264中采用了帧内预测技术,能够极大地减少空间冗余性,从而进一步提高了对帧内宏块编码的效率,但同时也增大了帧内编码的计算时间。为了减少帧内编码时间和编码延迟,该文提出了一种能够快速实现帧内预测编码的新算法。该文算法先利用变换域的信息得到图像纹理的方向,只在最可能的几个模式中进行模式选择,从而降低了运算量。对不同的视频序列测试的结果表明,使用本算法后帧内编码时间可以减少70%左右,同时保持相近的图像压缩质量和码率水平。对于一些实时性要求苛刻的视频压缩应用,采用该文的快速算法会比较有效。     

H．264视频编码技术研究

H．264作为新一代的视频编码标准,在近年来成为首选的视频标准。为了提高视频编码效率,H．264已采用了许多新技术,但仍面临一些瓶颈问题,影响其编码效率。结合JM8．6从视频编码层出发对H．264的帧间预测、帧内预测、变换及熵编码进行了分析和研究。结合实验分析得出帧内及帧间预测模式的概率,结果说明H．264复杂度和实时性能仍有待进一步的改善。     

一种基于参数替换的H.264标准水印嵌入算法研究

随着高清数字影像的发展,H.264视频编码方法逐渐成为下一代的视频标准。H.264由于使用了帧内预测编码、运动精度为1/4像素的估计算法使它可获得MPEG-2的2倍以上的压缩比和视频质量,而获得广泛应用。但是在H.264视频中嵌入水印用传统视频水印的方法无法有效地完成,在对视频编码的帧内预测模型研究的基础上,设计了一种快速的水印嵌入算法,基本实现了在H.264编码过程中水印提取的盲检测,其低算法复杂度可以满足视频实时处理的需要。     

基于H．263编码标准的H．264实时编码器的优化设计

从实时应用角度出发,参考H.263编码标准,对H.264视频编码器进行精简,并对耗时较大的算法进行改进.仿真结果表明,简化后的H.264编码器编码速度达到20f/s(帧/秒),达到实时编码要求,且编码性能优于H.263编码标准的编码器.     

基于块参考像素特征的快速帧内预测模式选择新算法

帧内预测是H.264采用的一种编码新技术。与以前的编码标准相比,H.264编码性能有了很大的提高,但同时编码复杂度和计算量也明显增加。该文研究了提高H.264编码速度的途径,着重分析了帧内预测模式快速选择的问题。经过分析发现,4×4亮度块的参考像素亮度值通常具有相似性,对应地,4×4亮度块的9种预测模式所得的预测结果也是相近的。根据4×4亮度块参考像素的这一特征,该文提出了一种基于4×4亮度块参考像素特征的快速帧内预测模式选择算法。实验结果说明了该文算法的有效性,与H.264编码器JM92相比,该算法的计算量减少了46%,而编码质量、PSNR和输出码率保持基本不变。     

基于帧间信息度优化的H.264码率控制算法

基于视频编码标准H.264提出一种改进的码率控制算法.该算法优化了标准中原算法码率分配趋于平均而且不充分利用已编码帧信息的问题.由于引入了帧的信息度因子,使得码率分配更加准确,根据已编码帧的历史信息更准确地调整当前帧要使用的量化参数.实验结果表明:视频输出序列的峰值信噪比有明显提高,对视频传输取得了更好的码率控制效果.     

Mode-Dependent Templates and Scan Order for H.264/AVC-Based Intra Lossless Coding

In H.264/advanced video coding (AVC), lossless coding and lossy coding share the same entropy coding module. However, the entropy coders in the H.264/AVC standard were original designed for lossy video coding and do not yield adequate performance for lossless video coding. In this paper, we analyze the problem with the current lossless coding scheme and propose a mode-dependent template (MD-template) based method for intra lossless coding. By exploring the statistical redundancy of the prediction residual in the H.264/AVC intra prediction modes, more zero coefficients are generated. By designing a new scan order for each MD-template, the scanned coefficients sequence fits the H.264/AVC entropy coders better. A fast implementation algorithm is also designed. With little computation increase, experimental results confirm that the proposed fast algorithm achieves about 7.2% bit saving compared with the current H.264/AVC fidelity range extensions high profile.     

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.     

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.     

Error Concealment Using Intra‐Mode Information Included in H.264/AVC‐Coded Bitstream

The H.264/AVC standard has adopted new coding tools such as intra‐prediction, variable block size, motion estimation with quarter‐pixel‐accuracy, loop filter, and so on. The adoption of these tools enables an H.264/AVC‐coded bitstream to have more information than was possible with previous standards. In this paper, we propose an effective spatial error concealment method with low complexity in H.264/AVC intra‐frame. From information included in an H.264/AVC‐coded bitstream, we use prediction modes of intra‐blocks to recover a damaged block. This is because the prediction direction in each prediction mode is highly correlated to the edge direction. We first estimate the edge direction of a damaged block using the prediction modes of the intra‐blocks adjacent to a damaged block and classify the area inside the damaged block into edge and flat areas. Our method then recovers pixel values in the edge area using edge‐directed interpolation, and recovers pixel values in the flat area using weighted interpolation. Simulation results show that the proposed method yields better video quality than conventional approaches.     

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.     

改进的H.264快速帧内预测选择算法

新一代的视频压缩标准H.264在视频数据压缩技术上取得了重大进展,但其算法复杂度明显提升,编码时间也较长。为降低H.264的计算复杂度和提高压缩效率,本文提出了一种基于变换域特性的变换域立体型（TDST）帧内预测快速选择算法,通过哈德码（Hadamard）变换的变换域特性对预测模式先进行选择,过滤掉大部分的预选模式,利...     

Selective VS-MRF-ME and intra coding in H.264 based on spatiotemporal continuity of motion field

The new video coding standard, H.264 uses variable size motion estimation (VS-ME), multiple reference frame motion estimation (MRF-ME) and spatial-based intra prediction with selectable block size in inter frame coding. These tools have achieved significant coding efficiency compared to coding a macroblock (MB) only based on motion-compensation in regular size with single reference frame. However, these new features also give rise to an exhaustive computation in the coding procedure since there are so many combinations of coding modes and reference frames to be tried. In this paper, a fast motion estimation algorithm based on the selective VS-MRF-ME and intra prediction is proposed to reduce H.264 coding computational complexity. The basic idea of the method is to utilize the spatiotemporal property of motion field in predicting where VS-MRF-ME and intra prediction are needed, and only in these regions VS-MRF-ME and intra coding are enabled. The motion field is generated by motion vectors from 16×16 motion estimation on the nearest reference frame. Simulation results show that the proposed algorithm can save 50% computational complexity on average, with negligible loss of coding efficiency.     

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.