移动无线互联网接入中视频编码率控制策略

建立了用于移动无线互联网接入的视频编码转换模型,提出了自适应运动矢量估值方法.将编码转换码率控制分为图像层控制和宏块层两级,首先在总体上对每帧图像的编码比特数进行预分配,然后采用小波变换系数来表征图像特征,为帧内不同特征的宏块选用不同的量化因子,提出了一种新的码率控制策略.模拟实验表明:该方法在视频图像质量没有明显失真的前提下,提高了视频编码转换速度;编码转换输出码流和编码转换缓冲区占用量较稳定,重建图像的信噪比得到了明显的改善.     

关键算法：移动无线信道中的精确码率控制算法

本文提出了一种适用于低码率及无线信道的自适应码率控制算法。此算法以宏块为单位进行码率的分析处理,然后将宏块运动及纹理特征提取并抽象为宏块能量,最后根据宏块能量进行码率分配。实验显示,此算法有效提升码率分配精确度,使输出码率波动幅度很小;同时解决低码率视频压缩导致的图像空间质量不均匀的问题,提升图像主观效果。     

MPGE—2视频编码流的码率变换技术的研究

比较了分析两种视频编码流的码率变换器结构的性能,提出了一种在图像内按宏块的复杂度分配目标码字,并直接控制交流ＤＣＴ系统编码比特数的码率控制算法。本文提出的码率控制算法优于ＴＭ５的码率控制算法。     

基于帧内区域的细粒度可扩展视频编码最优码率分配算法

MPEG-4 FGS是MPEG-4中精细可扩展性编码方法,由于采用帧8*8交织的位平面编码结构,无法支持帧内区域级的动态码率分配,不适合基于内容的增强和流化传输,针对MPEG-4 FGS这编码限制,本文根据MPEG-7的内容描述标准,提出了一种基于帧内区域的细粒度可扩展A-FGS编码,实现了实时的帧内区域流化编码,并就该编码提出了一种最优码率分配算法.利用帧内区域8*8宏块高位平面非零系数很少的特点,提出了动态码率分配算法,使在中等码率范围内编码效率提高了0.5dB左右.     

MPEG-2视频编码流的码率变换技术的研究

比较分析了两种视频编码流的码率变换器结构的性能,提出了一种在图像内按宏块的复杂度分配目标码字,并直接控制交流ＤＣＴ系数编码比特数的码率控制算法。计算机模拟实验结果表明：由于ＭＰＥＧ－２标准中半像素精度运动补偿的非线性,单环结构的信噪比性能比起双环结构低大约０．１ｄＢ;本文提出的码率控制算法优于ＴＭ５的码率控制算法。     

一种基于贝叶斯决策的自适应运动估计算法

为了提高视频编码运动估计中运动矢量预测的速度和准确性,提出一种基于贝叶斯决策的视频自适应运动估计算法.该算法充分利用贝叶斯理论、运动矢量的空间一致性和己编码帧对当前帧的影响,根据视频中前一帧和当前帧的已搜索宏块的运动信息,以目标宏块周围3个宏块的运动矢量与目标宏块的运动矢量空间距离最小为原则,利用贝叶斯决策来得到目标宏块运动矢量的预测值.实验表明,该方法在图像重建质量基本不变的情况下,比DS,ARPS和ARPS-3具有更快的搜索速度.     

多视点视频编码中宏块复杂度的研究

多视点视频带来了更真实生动的画面感,但同时也需要更大的数据量。本文对多视点视频编码模型JMVC中采用的模式选择技术编码计算量大的问题,通过分析和研究当前宏块的模式与相邻的已编码宏块及参考帧相应位置宏块模式间的关系,利用宏块模式间的相关性,对当前编码宏块的模式选择算法进行了优化,减少部分细小块的分割及搜索。实验结果表明,在其重建视频质量及码率开销基本不变的前提下,改进算法对运动较平缓的立体视频序列效果较好,较JMVC模型中的算法对全部测试序列的平均编码时间减少了约67%,而对运动较平缓序列的编码时间减少达73%。      

H.263活动图像编码器码率控制研究

本文分别在图像层和宏块层进行 Ｈ２６３ 的码率控制。在图像层采用后向自适应控制的方法,通过引入量化步长因子—编码输出比特数映射表,确定每帧图像量化步长因子的基准值。在宏块层采用前向控制的方法,根据视觉掩蔽特性设计模糊分类器,确定人眼对每个宏块的敏感程度和相应的量化步长因子。能在视频输出码率恒定的条件下,保持图像质量的稳定,取得较好的视觉效果。     

降低头肩视频序列编码码率的一种新方法

在头肩视频低码率编码的情况下,需要准确判定不编码宏块,从而节省码字。本文描述了一个基于运动矢量扫描的新算法,能够预测运动区域和静态背景区域,并在保证感兴趣区域质量的情况下,对静态区域的大部分宏块不编码。实验结果显示在低码率下,该算法能够大大节约编码的码字,而且在小运动序列时,可以显著减少编码的时间。     

R-Q模型宏块级精准度分析

R-Q模型对于率失真优化、码率分配、量化参数的选择产生重要影响,而宏块级码率分配、量化参数的选择有利于提高实时视频编码效率。简要介绍4种R-Q模型推导过程,详细比较、分析4种模型宏块级精准度,并对复杂度进行说明。实验证明:基于广义高斯分布的R-Q模型精准度最高,但其运算过于复杂,应用于编码比特数预测;而其他3种模型虽然精准度虽不高,但运算简单,应用于码率控制算法。为提出码率预测模型、改进码率控制算法及针对不同应用选择合适的码率控制算法提供了基础性分析。     

一种基于运动对象的形状编码新算法

本文提出一种基于运动对象的形状编码新方法,称之为基于曲率尺度空间CSS(Curvature Scale Space)的自适应算术形状编码算法(CSSAS).本算法主要分为两种编码模式:帧内模式和帧间模式.在帧内模式中,我们在对CSS算法进行改进的基础上,对任意形状对象的形状信息进行特征点的分层提取;并用自适应算术编码算法对提取的特征点进行编码.在帧间模式中,提出了一种基于曲率尺度空间图(CSSI)的任意形状对象的运动估计算法.上述运动估计/补偿后所获得的形状曲线的匹配部分使用基于弧长索引的压缩编码算法,而对于不匹配部分,采用与帧内CSSAS算法相同的方法进行压缩编码.实验结果表明,本文提出的CSSAS算法与MPEG-4校验模型中基于上下文的算术形状编码算法(CAE)相比,在帧内模式时,CSSAS比CAE压缩比提高约25%,在帧间模式Dn较大时,CSSAS比CAE压缩比明显提高,而在重构形状的主观质量上,CSSAS这两种模式均优于CAE.     

Adaptive shape and texture intra refreshment schemes for improved error resilience in object-based video coding

Video encoders may use several techniques to improve error resilience. In particular, for video encoders that rely on predictive (inter) coding to remove temporal redundancy, intra coding refreshment is especially useful to stop temporal error propagation when errors occur in the transmission or storage of the coded streams, since these errors may cause the decoded quality to decay very rapidly. In the context of object-based video coding, intra coding refreshment can be applied to both the shape and texture data. In this paper, novel shape and texture intra refreshment schemes are proposed which can be used by object-based video encoders, such as MPEG-4 video encoders, independently or combined. These schemes allow to adaptively determine when the shape and texture of the various video objects in a scene should be refreshed in order to maximize the decoded video quality for a certain total bit rate.     

Refreshment need metrics for improved shape and texture object-based resilient video coding

Video encoders may use several techniques to improve error resilience. In particular, for video encoders that rely on predictive (inter) coding to remove temporal redundancy, intra coding refreshment is especially useful to stop error propagation when errors occur in the transmission or storage of the coded streams, which can cause the decoded quality to decay very rapidly. In the context of object-based video coding, the video encoder can apply intra coding refreshment to both the shape and the texture data. In this paper, shape refreshment need and texture refreshment need metrics are proposed which can be used by object-based video encoders, notably MPEG-4 video encoders, to determine when the shape and the texture of the various video objects in the scene should be refreshed in order to improve the decoded video quality, e.g., for a given bit rate.     

A dual quad-tree based variable block-size coding method

Recent video coding standards with hybrid structure adopt variable block-size processing techniques including variable block-size motion estimation and compensation, variable block-size intra prediction, and variable block-size transform. This paper gives analysis on the variable block-size techniques based on software simulations, and variable block-size transform is specially studied. As a result of the analysis, a generalized dual quad-tree based variable block-size coding (DQTC) structure is proposed. This structure also shows good flexibility and expansibility, in which the prediction block-size set and the transform block-size set can be configured according to requirements and the implementation complexity constraints. Simulation results show a considerable performance improvement for the proposed structure with low implementation complexity while the coding block-size sets and parameters are optimized.     

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.     

Variable block-based deblocking filter for H.264/AVC on low-end and low-bit rates terminals

H.264/AVC supports variable block motion compensation, multiple reference frames, 1/4-pixel motion vector accuracy, and in-loop deblocking filter, compared with previous video coding standards. While these coding techniques are major functions for video compression improvement, they lead to high computational complexity at the same time. For the H.264 video coding techniques to be actually applied on low-end/low-bit rates terminals more extensively, it is essential to improve the coding efficiency. Currently the H.264 deblocking filter, which can improve the subjective quality of video, is hardly used on low-end terminals due to computational complexity.In this paper, we propose an enhanced method of deblocking filter that efficiently reduces the blocking artifacts occurring during the low-bit rates video coding. In the ‘variable block-based deblocking filter (VBDF)’ proposed in this paper, the temporal and spatial characteristics of moving pictures are extracted using the variable block-size information of motion compensation, the filter mode is classified into four different modes according to the moving-picture characteristics, and the adaptive filtering is executed in the separate modes. The proposed VBDF can reduce the blocking artifacts, prevent excessive blurring effects, and achieve about 30–40% computational speedup at about the same PSNR compared with the existing methods.     

Efficient fine granularity scalability using adaptive leaky factor

Fine Granularity Scalability (FGS) video coding has been adopted by the MPEG-4 standard for video streaming applications. In this paper, we propose a novel FGS coding scheme, which applied adaptive leaky factors for the enhancement layer prediction to further improve the coding efficiency of FGS. A flexible method that can dynamically determine the leaky factors according to the network conditions is also presented. With the proposed method, a better trade-off between the coding efficiency and drifting reduction can be achieved, and the coding performance is further improved compared with using a fixed leaky factor. Experimental results show that the proposed method can further improve the coding efficiency over a wide range of bitrate and packet loss ratio, and still keep the original characteristics, such as fine granularity, and bandwidth adaptation.     

基于低码率传输的红外视频编码方法研究

为了满足低速数据链下目标识别的需求,把感兴趣区域(Region of Interest,ROI)编码策略引入红外视频编码。在H.264视频编/解码框架的基础上,通过增加ROI编码的处理,构建基于ROI的视频编/解码框架,并在码率控制过程中调整ROI宏块与非ROI宏块的量化参数,优化了ROI量化模型。实验结果表明,该方法能够节省有限码率,增加ROI目标的细节,提高ROI对象的清晰度,可从整体上提高主观视觉的质量。     

基于基准线的形状编码

形状编码是MPEG-4不同于其它标准(如MPEG-1和MPEG-2等)的新特点。本文提出基于基准线的形状编码的方法,文中详细探讨了VOP形状基于基准线的帧内和帧间编码。该方法解决了基于块的形状编码产生的阶梯效应问题,同时取得较高的压缩比和较好的重构效果。处理结果表明该法具有较好的前景。