一种H.265视频带宽实时预测模型

针对视频直播过程中带宽抖动导致视频帧丢失造成用户体验降低问题,提出了一种H.265视频带宽实时预测（VBRP）模型。模型基于马尔可夫链,专注于H.265编码的直播视频流,研究了在GOP（group of pictures）编码模式下B帧出现的统计特性,发现B帧大小对视频流传输速率的影响较大。应用此特性可预测出直播流中B帧的大小,并根据网络带宽选择性丢弃B帧,同时引入步长调整因子AF和误差阈值FT,均衡模型在预测B帧时的训练频率和预测帧数。最后基于模型实现VBRP预测算法并在直播系统中验证算法的有效性。     

场景切换视频自适应帧间码率控制

针对视频帧中可能出现的大量场景切换,提出一种基于非连接点的场景切换检测算法,提高编码性能,该场景检测算法复杂度低,在运动估计的同时,完成视频场景切换检测。场景切换将导致GOP(group of pictures)长度的变化,并可能出现GOP长度太短的情况。提出改进的自适应GOP时域滤波技术,避免由于GOP太短引起的编码性能下降。针对视频场景切换检测分割出的不同长度的GOP,提出一种基于率失真模型的帧间码率控制算法,利用视频的失真与码率及视频帧复杂度的关系,对帧间码率分配进行优化,提高重构视频帧的总质量。实验结果表明,基于场景检测的自适应帧间码率控制算法能够获得较好的编码性能。     

MPEG-4 FGS流媒体的常质量GOP带宽分配机制

分析MPEG-4FGS的位平面R-D模型，提出一种基于场景的常质量GOP带宽分配机制及GOP带宽分配的静态算法和动态算法，以保证同一场景内连续GOP的质量稳定．实验结果表明：常质量GOP带宽分配机制能够平滑一场景内连续GOP的质量，并且连续帧的质量波动也较小．     

基于多变换的细粒度视频编码算法

针对现有细粒度视频编码算法计算复杂度大或视频恢复质量有各种效应的缺点，提出了一种基于联合小波变换和MP变换的细粒度编码算法。该算法在运动估计与补偿的基础上，用小波变换来消除帧间冗余，然后对变换结果根据不同帧的数据特征分别进行二维小波变换或MP变换。算法还提出了新的运动估计和像素调整策略、基于人眼视觉特性的MP原子分配策略和基于能量查找的原子搜索机制。实验表明，该算法可同时兼顾视频恢复质量、计算复杂度和控制粒度。     

H.264/SVC比特自适应分配的等级B帧码率控制算法

为减少码率控制中实际输出码率与目标码率之间的误差,改善视频序列编码尾部质量下降的缺陷,同时针对可伸缩视频编码中码率控制算法的不足,提出一种自适应比特分配的码率控制算法。算法基于对根据相邻图像帧之间的相关性以及对恒定质量的考虑,在图像组(GOP)之间平均分配目标比特,而在GOP内部则根据编码复杂度自适应分配目标比特,同时适当调整初始量化参数(QP),再根据目标比特分别计算P帧、B帧的QP。对不同的视频序列进行了实验测试,其结果验证了算法的准确性和有效性。     

基于错误传播模型的非均等视频流丢失保护

提出一种适用于丢包网络、面向图像组（GOP）层的非均等视频流丢失保护方案。利用GOP中不同帧之间的非均等显著性,将不同数量前向错误校正包分配到GOP层的不同帧中。采用帧间包交错机制将突发包丢失分散到不同帧上,提高处理突发包丢失时的鲁棒性。仿真结果表明,在不同信道丢失模式下,该方案能提高视频接收质量。     

MPEG压缩域多尺度镜头切变检测算法

如何在压缩域进行镜头的切变检测一直是视频自动索引和检索中的难点。提出了一种MPEG压缩域多尺度镜头切变检测算法,在GOP、slot和B帧三个尺度上对MPEG视频流进行分析。通过对相邻I帧的检测,确定一个GOP中是否存在镜头切变;通过对slot的分析,确定镜头切变在GOP中所处的区域;通过对B帧的检测,确定镜头切变发生的确切位置。     

基于相对排队延时的无线视频传输研究

无线接入和视频应用的日益普及使无线视频传输成为新的研究热点。随着研究的深入,跨层优化和不平等保护的思想逐渐为大多数研究所采纳。基于IEEE 802.11e协议研究无线视频传输质量的改善方法,提出一种综合考虑视频帧优先级和相对排队延时、适用于优先级数目有限的任何编码算法的视频帧调度算法。仿真实验结果表明,提出的算法具有远高于标准EDCA及其已有改进方案的平均峰值信噪比。     

基于综合因子的H.264码率控制算法

针对H.264的JVT-G012算法在帧层对未编码的P帧采用平均分配比特、忽略了图像复杂度和P帧在图像组(Group of pictures,GOP)中的位置对码率控制影响的问题,提出了一种新的H.264码率控制算法,先利用P帧的图像复杂度和P帧在GOP中位置组成的综合因子来调整P帧的目标比特分配,再利用已编码帧的历史信息来调整当前编码帧的量化参数.通过实验表明,与JVT-G012算法相比,本文算法不仅提高了视频图像的质量,尤其是运动剧烈和纹理复杂的视频序列的图像质量,而且使得输出的实际码率更接近目标码率,提高了码率控制的精准性;与已有算法相比,在保持视频图像质量的情况下,进一步提高了码率控制的精准性.     

基于H．264的立体视频右图像整帧丢失错误隐藏算法

当H．264编码立体视频流在Internet上传输时，由于信道错误所引起的数据丢失常常会造成整帧图像的丢失。为了恢复丢失的整帧立体视频右图像，提出了一种基于H．264的立体视频右图像整帧丢失错误隐藏算法，该算法依据立体视频编码特点进行相关性分析，首先确定丢失帧中每个宏块的预测方式，然后采用运动补偿或视差补偿对其进行恢复，进而重现丢失帧。实验结果表明，该算法能够在较低的计算复杂度下，获得较高质量的立体视频图像。     

一种改进的伪3D-DCT域的视频零水印算法

为进一步提高视频水印算法的鲁棒性,提出了一种改进的伪三维离散余弦变换(3D-DCT)的视频零水印算法。该算法首先采用帧间欧氏距离法选取关键帧,然后,利用三帧差分法得到关键帧的运动目标,并对关键帧的运动目标图像进行分块,同时对运动目标的几何形心坐标所在块进行伪3D-DCT变换。将变换后的AC系数用于构造视频的特征值序列,并将混沌映射加密的水印嵌入特征值序列中构造零水印。最后将零水印在数据库中进行注册。实验表明,该算法对噪声、滤波攻击,帧剪切、旋转、缩放等攻击具有很强的不可见性和鲁棒性。     

A super-resolution method with EWA

This paper introduces a practical algorithm for super-resolution,the process of reconstructing a high-resolution image from low-resolution input ones.The emphasis of the work is to super-resolve frames from real-world image/video sequences which may contain significant object occlusion or scene changes.As the quality of super-resolved images highly relies on the correctness of image alignment between consecutive frames,the robust optical flow method is used to accurately estimate motion between the image pair.An efficient and reliable scheme is devised to detect and discard incorrect matchings which may degrade the output quality.The usage of elliptical weighted average (EWA) filter is also introduced to model the point spread function (PSF) of acquisition system in order to improve accuracy of the model.A number of complex video sequences are tested to demonstrate the applicability and reliability of the proposed algorithm.     

基于参考帧的视频播放超分辨率放大算法*

利用连续视频各帧之间的时域和空域相关性,在视频播放超分辨率插值放大重建时,主要对I帧进行边缘检测插值,而对P帧和B帧图像的插值则参考I帧的插值结果,从而提高整个视频播放的主观质量,计算量也不大.实验结果表明,本算法对提高每帧图像以及整体视频主观质量均有明显效果,大大减少了播放时由于视频的放大而出现的块状和锯齿状等失真.     

Structured Sparse Coding With the Group Log-regularizer for Key Frame Extraction

Key frame extraction based on sparse coding can reduce the redundancy of continuous frames and concisely express the entire video. However, how to develop a key frame extraction algorithm that can automatically extract a few frames with a low reconstruction error remains a challenge. In this paper, we propose a novel model of structured sparse-coding-based key frame extraction, wherein a nonconvex group log-regularizer is used with strong sparsity and a low reconstruction error. To automatically extract key frames, a decomposition scheme is designed to separate the sparse coefficient matrix by rows. The rows enforced by the nonconvex group log-regularizer become zero or nonzero, leading to the learning of the structured sparse coefficient matrix. To solve the nonconvex problems due to the log-regularizer, the difference of convex algorithm (DCA) is employed to decompose the log-regularizer into the difference of two convex functions related to the l₁ norm, which can be directly obtained through the proximal operator. Therefore, an efficient structured sparse coding algorithm with the group log-regularizer for key frame extraction is developed, which can automatically extract a few frames directly from the video to represent the entire video with a low reconstruction error. Experimental results demonstrate that the proposed algorithm can extract more accurate key frames from most SumMe videos compared to the state-of-the-art methods. Furthermore, the proposed algorithm can obtain a higher compression with a nearly 18% increase compared to sparse modeling representation selection (SMRS) and an 8% increase compared to SC-det on the VSUMM dataset.      

A novel H.264 rate control algorithm with consideration of visual attention

In video coding, a well-designed rate control scheme should be concerned with both the objective and subjective quality. However, the existing H.264 rate control algorithms mainly aim at improving the objective quality without considering the human visual system. In this paper, we propose a novel rate control algorithm that takes into account visual attention. In a group of pictures, bits allocated to each frame are related to the local motion attention in it, and more bits are allocated to the frames with strong local motion attention. Similarly, in each frame, more bits are assigned to visually significant macroblocks (MBs), and fewer to visually insignificant MBs. Experiment results show that the proposed algorithm improves the coding quality in frames with strong local motion, and reduces PSNR fluctuation across frames by up to 22.15%. In addition, PSNR in visually important regions is increased by up to 1.45 dB as compared to the standard H.264 rate control scheme that improves the subjective quality. Increased computation complexity of the proposed algorithm is less than 4%, which is negligible.     

G.729编码流说话人识别研究

研究了G.729编码流说话人识别算法,提出了一种使用固定码书增益作为判决参数的G.729静音帧判决方法。将这一方法应用于低复杂度的G.729编码流说话人识别,去除压缩语音数据中的静音帧从而提高识别率。     

An Integrated Framework for Efficient Transport of Real-Time MPEG Video over ATM Best Effort Service

This paper describes a framework for the transport of real-time multimedia traffic generated by MPEG-2 applications over ATM networks using an enhanced UBR best effort service (UBR+). Based on the factors affecting the picture quality during transmission, we propose an efficient and cost-effective ATM best effort delivery service. The proposed framework integrates three major components: 1) a dynamic frame-level priority assignment mechanism based on MPEG data structure and feedback from the network (DexPAS), 2) a novel audio-visual AAL5 SSCS with FEC (AV-SSCS), and 3) an intelligent packet video discard scheme named FEC-PSD, which adaptively and selectively adjusts cell drop levels to switch buffer occupancy, video cell payload type and forward error correction capability of the destination. The overall best-effort video delivery framework is evaluated using ATM network simulation and MPEG2 video traces. The ultimate goal of this framework is twofold: First, minimizing loss of critical video data with bounded end-to-end delay for arriving cells and second, reducing the bad throughput crossing the network during congestion. Compared to previous approaches, performance evaluation shows a good protection of Predictive coded (P-) and Bi-directional Predictive coded (B-) frames at the MPEG video slice layer.     

PLUS: a probe-loss utilization streaming mechanism for distributed multimedia presentation systems

We present a new flow and congestion control scheme, PLUS (Probe-Loss Utilization Streaming protocol), for distributed multimedia presentation systems. This scheme utilizes probing of the network situation and an effective adjustment mechanism to data loss to support multimedia presentations. The proposed scheme is also designed to scale with increasing number of PLUS-based streaming traffic and to live in harmony with TCP-based traffic. The novelty of the PLUS protocol is that it utilizes the knowledge of its future bottleneck bandwidth in probing the current network situation. This can be achieved by a priori knowledge of the multimedia data before a presentation is requested by a client. Compression schemes like MPEG introduce dependencies on media units. I frames are needed to successfully decode P and B frames, and P frames are needed to decode B frames. A loss of an I or P frame automatically eliminates dependent media units. Our probing scheme increases the successful transmission of critical I and P packets without the overhead of error-correction-schemes. Probing is done using B-frame packets. The advantage is that we use data packets as probe packets. With the PLUS protocol we address the need to avoid congestion rather than react to it. Experiments demonstrate the effectiveness of the approach in utilizing network resources and decreasing loss ratios.     

一种层次视频摘要生成方法

视频摘要是视频内容的一种压缩表示方式。为了能够更好地浏览视频，提出了一种根据浏览或检索的粒度不同来建立两种层次视频摘要(镜头级和场景级)的思想，并给出了一种视频摘要生成方法：首先用一种根据内容变化自动提取镜头内关键帧的方法来实现关键帧的提取；继而用一种改进的时间自适应算法通过镜头的组合来得到场景；最后在场景级用最小生成树方法提取代表帧。由于关键帧和代表帧分别代表了它们所在镜头和场景的主要内容，因此它们的序列就构成了视频总结。一些电影视频片段检验的实验结果表明，这种生成方法能够较好地提供粗细两种粒度的视频内容总结。     

A novel forwarding and routing mechanism design in SDN-based NDN architecture

Combining named data networking (NDN) and software-defined networking (SDN) has been considered as an important trend and attracted a lot of attention in recent years. Although much work has been carried out on the integration of NDN and SDN, the forwarding mechanism to solve the inherent problems caused by the flooding scheme and discard of interest packets in traditional NDN is not well considered. To fill this gap, by taking advantage of SDN, we design a novel forwarding mechanism in NDN architecture with distributed controllers, where routing decisions are made globally. Then we show how the forwarding mechanism is operated for interest and data packets. In addition, we propose a novel routing algorithm considering quality of service (QoS) applied in the proposed forwarding mechanism and carried out in controllers. We take both resource consumption and network load balancing into consideration and introduce a genetic algorithm (GA) to solve the QoS constrained routing problem using global network information. Simulation results are presented to demonstrate the performance of the proposed routing scheme.