基于边信息的分布式视频压缩感知的残差重构

压缩感知(Compressed Sensing,CS)结合了视频信号的变换和信息压缩过程,为简化编码算法提供了一种新的解决思路.把分布式视频编码(DVC)和CS结合在一起,构建简单的视频编码框架,并利用原始视频帧与边信息之间的相关性进行残差重构,提出了一种基于边信息的分布式视频压缩感知编解码方案.此方法对关键帧采用传统的帧内编、解码;对非关键帧CS进行随机观测提取观测向量,解码端利用优化的边信息和传输的CS观测向量进行联合重构.实验结果表明,该方法在运动较平滑的序列中比参考方案的恢复质量提高了4 ～6 dB.     

基于残差重构的分布式视频压缩感知

为了改进分布式视频压缩感知方案的性能,提出了一种基于残差重构的分布式视频压缩感知方案。该方案在编码端逐帧独立进行测量,在解码端依靠视频信号的时域相关性提升重构信号质量。首先,对关键帧独立进行重构;其次,利用已重构关键帧做运动估计/运动补偿以生成非关键帧的边信息;接下来,对边信息采用与编码端相同的测量矩阵进行测量并计算测量残差值;最后,采用全变分最小化重构残差信号值并将其与边信息相加生成最终的重构图像。实验结果表明,在相同采样率下,与已有的分布式视频压缩感知方案相比,提出的方案可获得2.8 dB以上的峰值信噪比增益。     

基于层修复技术的DVC鲁棒传输框架

针对分布式视频编码(DVC)系统鲁棒传输问题,设计了一种基于层修复的DVC系统传输框架。该传输框架首先对关键帧(K帧)同时采用高效视频编码(HEVC)帧内编码和Wyner-Ziv编码,并将校验信息(Wyner-Ziv码流)作为修复层码流存入缓存中。若当前关键帧有丢失,则向编码端请求该帧对应的层修复码流,在解码端对错误块进行修复,获得关键帧解码质量的提升。同时,研究了层修复码率估计算法,利用已成功解码的位平面辅助完成算法重建。实验结果表明,该传输框架利用关键帧的层修复码流对关键帧失真部分进行了修复,提高了关键帧质量,改善了边信息质量,实现了DVC的鲁棒传输。     

分布式压缩感知视频编码中CS帧的二次修正准则研究

分布式视频编码是新的视频编码体系,与传统的视频编码体系相比,具有编码端相对简单、解码端相对复杂的特点。此外,压缩感知突破了奈奎斯特采样定理,降低了信号的采样率。将压缩感知理论应与分布式视频编码相结合,使编码端复杂度降低。在一些分布式压缩视频编码研究中,CS帧是由边信息和发送端传送的信息联合重建的,由于不同CS帧的边信息的预测准确度不同,导致不同CS帧恢复质量相差较大。为了解决这个问题,本文对CS帧的二次修正准则的进行研究,首先从理论上推导出方差作为修正准则的可行性,并在实验中加以验证。实验可知,本文提出的方法在一定程度上改善了这些帧的重建质量。      

运动补偿预测残差稀疏重构的分布式压缩视频传感

针对低复杂度视频编码需求,基于压缩传感(CS：Compressive Sensing)理论,提出了一种分布式压缩视频传感算法。低复杂度的编码器独立随机投影关键帧和CS帧,采集压缩视频数据;在解码端进行运动补偿预测以利用帧间相关性,对预测残差稀疏重构实现CS帧重建。仿真测试表明,与现有的三种压缩视频传感算法相比,所提算法重建的视频质量更好,适合无线视频监控及无线视频传感网络等应用。     

运动补偿预测残差稀疏重构的压缩视频传感

针对低复杂度视频编码需求,基于压缩传感(Compressive Sensing,CS)理论,提出了一种分布式压缩视频传感算法。低复杂度的编码器独立随机投影关键帧和CS帧,采集压缩视频数据;在解码端进行运动补偿预测以利用帧间相关性,对预测残差稀疏重构实现CS帧重建。仿真测试表明,与现有的3种压缩视频传感算法相比,所提算法重建的视频质量更好,适合无线视频监控及无线视频传感网络等应用。     

分布视频编码中基于帧间相关性的自适应关键帧选取算法

针对分布式视频编码(DVC)系统中固定周期关键帧选取(PKFS)方法忽视了帧间相关性的缺陷,提出了一种自适应关键帧选取(AKFS)算法。利用图像特征点检测与匹配的方法,将相邻图像的非匹配点作为帧间相关性的近似,把累积或平均非匹配点数超过阈值的帧判定为关键帧。在此基础上,提出改进的帧内插方案,以适应不同长度序列组的边信息生成;将零运动强度的关联帧合并为一帧图像参与编解码,进一步提高了系统的压缩效率。实验结果表明,对于不同运动特性的序列,本文提出的算法可以明显提升边信息帧的重建质量,使系统的率失真性能提高0.9～2.0 dB,并有效降低了编码传输码率。     

基于递归预测的分布式双视角图像无损压缩

针对星载双视角图像压缩中存在数据量大和卫星编码端计算能力受限、内存资源不足的问题，提出了一种基于递归预测的分布式双视角图像无损压缩方法。该方法中2个视角的图像采用不同的编码方法，视角1作为关键视角采用JPEG2000无损模式进行独立压缩；视角2经图像分块预处理之后，其中一个局部图像块作为关键图像块仍用JPEG2000无损模式独立压缩，其余部分采用分布式编码方法。编码端进行二维整数小波变换去除各视角内的空间冗余，解码端利用利用视角间的相关性采用递归预测的结构，通过配准和多元线性回归的方法生成视角2其余图像的边信息辅助其余图像块解码。实验结果表明，与未考虑双视角图像间冗余的JPEG2000无损压缩编码相比，平均编码比特率大约节约了0.296～0.6 bpp,时间复杂度降低到其5.97%～14.3%;与使用初始边信息的分布式编码方案相比时间复杂度相同，但平均编码比特率大约节约了0.45～0.51 bpp;与考虑了图像间冗余的相关文献图像算法相比，所提方法的编码比特率损失0.2 bpp,但编码复杂度降低到其4.3%,说明所提方法更具优势，满足星载图像压缩需求。     

分布式多视点视频编码中的立体边信息生成

新兴的分布式多视点视频编码通过在解码端使用立体边信息可充分挖掘传统单视点的时间相关性和多视点特有的视间相关性.研究了一种多视点运动预测的立体边信息生成算法,提出了近似视差估计和编码端掩模融合算法.实验证明,解码端采用近似的视差矢量,编码端传递某些先验信息,都能有效提高立体边信息精度,降低计算复杂度.     

分布式视频编码边信息改进技术

高质量的边信息生成技术是分布式视频编码系统实现高压缩效率的关键所在.提出一种边信息的改进方法,对部分译码的Wyner-Ziv(WZ)帧中运动剧烈的区域进行空域修正,使用相邻关键帧对应块的空间预测值与实际值之间的差值来补偿当前部分译码WZ帧中空间预测的误差.仿真结果表明该方法提升了边信息的质量,进而提高了DVC系统的率失真性能.     

一种空间域Wyner-Ziv视频编码系统的性能改进算法

分布式视频编码是建立在Slepian-Wolf和Wyner-Ziv信息编码理论基础上的全新视频编码框架,具有编码复杂度低,编码效率较高,抗误码性能好的特点.本文首先简单介绍了一种典型的分布式视频编码实现方案——空间域Wyner-Ziv视频编码,随后提出一种空间域Wyner-Ziv视频编码系统的性能改进算法,该算法在不增加编码复杂度的基础上,在解码端利用双向运动估计预测获取更高质量的边信息,同时采用基于Huber-Markov随机场约束的联合迭代解码算法重建图像.实验结果表明,在相同的输出码流情况下,本文改进算法在解码端重建图像的峰值信噪比与空间域Wyner-Ziv视频编码算法相比平均提高2dB,并且主观效果有所改善.     

Perceptual-based distributed video coding

In this paper, we propose a perceptual-based distributed video coding (DVC) technique. Unlike traditional video codecs, DVC applies video prediction process at the decoder side using previously received frames. The predicted video frames (i.e., side information) contain prediction errors. The encoder then transmits error-correcting parity bits to the decoder to reconstruct the video frames from side information. However, channel codes based on i.i.d. noise models are not always efficient in correcting video prediction errors. In addition, some of the prediction errors do not cause perceptible visual distortions. From perceptual coding point of view, there is no need to correct such errors. This paper proposes a scheme for the decoder to perform perceptual quality analysis on the predicted side information. The decoder only requests parity bits to correct visually sensitive errors. More importantly, with the proposed technique, key frames can be encoded at higher rates while still maintaining consistent visual quality across the video sequence. As a result, even the objective PSNR measure of the decoded video sequence will increase too. Experimental results show that the proposed technique improves the R-D performance of a transform domain DVC codec both subjectively and objectively. Comparisons with a well-known DVC codec show that the proposed perceptual-based DVC coding scheme is very promising for distributed video coding framework.     

Dictionary learning based reconstruction for distributed compressed video sensing

Distributed compressed video sensing (DCVS) is a framework that integrates both compressed sensing and distributed video coding characteristics to achieve a low-complexity video coding. However, how to design an efficient reconstruction by leveraging more realistic signal models that go beyond simple sparsity is still an open challenge. In this paper, we propose a novel “undersampled” correlation noise model to describe compressively sampled video signals, and present a maximum-likelihood dictionary learning based reconstruction algorithm for DCVS, in which both the correlation and sparsity constraints are included in a new probabilistic model. Moreover, the signal recovery in our algorithm is performed during the process of dictionary learning, instead of being employed as an independent task. Experimental results show that our proposal compares favorably with other existing methods, with 0.1–3.5 dB improvements in the average PSNR, and a 2–9 dB gain for non-key frames when key frames are subsampled at an increased rate.     

Independent key frame coding using correlated pixels in distributed video coding

A novel intra-coding technique is proposed that eliminates the requirement of a secondary coding scheme for coding the key frames in distributed video coding (DVC). The proposed technique uses the Slepian-Wolf theorem and Wyner-Ziv (WZ) coding with spatially predicted information to transmit the key-frames to the DVC decoder. Simulation results show that the proposed WZ-intra coding technique (WZ-I) can achieve up to 5 dB PSNR gain compared to MPEG-2 intra coding (MPEG-I) at the same bit rate with negligible computational cost to the encoder     

Advanced side information creation techniques and framework for Wyner–Ziv video coding

Recently, several distributed video coding (DVC) solutions based on the distributed source coding (DSC) paradigm have appeared in the literature. Wyner–Ziv (WZ) video coding, a particular case of DVC where side information is made available at the decoder, enable to achieve a flexible distribution of the computational complexity between the encoder and decoder, promising to fulfill novel requirements from applications such as video surveillance, sensor networks and mobile camera phones. The quality of the side information at the decoder has a critical role in determining the WZ video coding rate-distortion (RD) performance, notably to raise it to a level as close as possible to the RD performance of standard predictive video coding schemes. Towards this target, efficient motion search algorithms for powerful frame interpolation are much needed at the decoder. In this paper, the RD performance of a Wyner–Ziv video codec is improved by using novel, advanced motion compensated frame interpolation techniques to generate the side information. The development of these type of side information estimators is a difficult problem in WZ video coding, especially because the decoder only has available some reference, decoded frames. Based on the regularization of the motion field, novel side information creation techniques are proposed in this paper along with a new frame interpolation framework able to generate higher quality side information at the decoder. To illustrate the RD performance improvements, this novel side information creation framework has been integrated in a transform domain turbo coding based Wyner–Ziv video codec. Experimental results show that the novel side information creation solution leads to better RD performance than available state-of-the-art side information estimators, with improvements up to 2 dB; moreover, it allows outperforming H.264/AVC Intra by up to 3 dB with a lower encoding complexity.     

Sequential motion estimation using luminance and chrominance information for distributed video coding of Wyner-Ziv frames

Proposed is a novel side information refinement technique for Wyner-Ziv video frames in distributed video coding using sequential motion compensation with luminance and chrominance information for a given bit plane to update the side information for the next bit plane. Simulation results show that over 3 dB PSNR gain can be obtained with the proposed algorithm over the best available pixel domain Wyner Ziv codec from the literature [Natario et al.] at the same bit rate.     

An improved side information generation for distributed video coding

This paper presents a side information (SI) scheme for distributed video coding based on multilayer perceptron. The suggested scheme predicts a Wyner–Ziv (WZ) frame from two decoded key frames. The network is trained offline using patterns from different standard video sequences with varied motion characteristics to achieve generalization. The proposed scheme is simulated along with other standard video coding schemes. Performance comparisons have been made with respect to training convergence, rate distortion (RD), peak signal to noise ratio (PSNR), number of requests per SI frame, decoding time requirement, etc. In general, it is observed that the proposed scheme has a superior SI frame generation capability as compared to its competent schemes.     

Semi-automatic 2D-to-3D video conversion based on background sprite generation

This paper presents a technique for semi-automatic 2D-to-3D stereo video conversion, which is known to provide user intervention in assigning foreground/background depths for key frames and then get depth maps for non-key frames via automatic depth propagation. Our algorithm treats foreground and background separately. For foregrounds, kernel pixels are identified and then used as the seeds for graph-cut segmentation for each non-key frame independently, resulting in results not limited by objects’ motion activity. For backgrounds, all video frames, after foregrounds being removed, are integrated into a common background sprite model (BSM) based on a relay-frame-based image registration algorithm. Users can then draw background depths for BSM in an integrated manner, thus reducing human efforts significantly. Experimental results show that our method is capable of retaining more faithful foreground depth boundaries (by 1.6–2.7 dB) and smoother background depths than prior works. This advantage is helpful for 3D display and 3D perception.