共查询到17条相似文献,搜索用时 140 毫秒
1.
2.
预测结构是多视点视频编码(Multi-View Video Coding,MVC)研究的主要内容之一。MVC目前采用HHI(Heinrich-Hertz-Institute)提出的分层次B帧预测结构(HBP),比联播预测结构获得了更好的压缩效率。分析了多种预测结构,并针对平行摄像机采集的多视点视频序列,提出了一种新的预测结构AS_EIPP,该结构充分利用相邻视点间的相关性和多参考帧模式,进一步提高了压缩效率。在多视点视频软件测试平台JMVC8.3上进行验证,实验结果表明:新的预测结构在保证重建视频质量基本不变的前提下,压缩效率比HBP预测结构提高了1%~4%。 相似文献
3.
首先分析了JMVC的参考预测结构,利用1个Go P(Group of Picture)中不同时间层上的帧与其参考帧之间的相关度不同和不同时间层上的帧数目也不同的特点,提出了去除奇数视点最高和次高时间层的视点间预测,并增加偶数视点非关键帧的最低和次低时间层的视点间预测的预测结构。实验结果表明,提出的预测结构基本不影响视频质量,且表现出了更加出色的编码效率,编码的复杂度减少幅度高达15%,输出码率也有所减少,较好地改善了编码的实时性能。 相似文献
4.
现有的多视点视频编码使用了分层B帧(Hierarchical B Picture, HBP)的预测结构,其帧内预测、帧间预测以及视点间预测的模式选择给多视点视频编码带来了庞大的计算复杂度。针对这一问题,我们在分析了JMVC模式分布比例的基础上,提出了一个快速帧间模式选择的算法。这种算法利用率失真代价和预测模式特征之间的关系来及时判定最优模式:如果上一尺寸预测模式的率失真代价小于当前尺寸预测模式的率失真代价则认为上一预测模式为最优模式,跳过检查其他更小尺寸的预测模式;反之,如果上一尺寸的预测模式的率失真代价大于当前尺寸的预测模式的率失真代价,则继续检查其他更小的尺寸。这样,通过提前终止一些不必要的模式选择过程,多视点视频编码的计算量得到大幅的降低。实验结果表明:所提算法能在保持JMVC中全搜索算法的编码效率同时,使计算复杂度减少了81.66%。 相似文献
5.
6.
多视点视频带来了更真实生动的画面感,但同时也需要更大的数据量。本文对多视点视频编码模型JMVC中采用的模式选择技术编码计算量大的问题,通过分析和研究当前宏块的模式与相邻的已编码宏块及参考帧相应位置宏块模式间的关系,利用宏块模式间的相关性,对当前编码宏块的模式选择算法进行了优化,减少部分细小块的分割及搜索。实验结果表明,在其重建视频质量及码率开销基本不变的前提下,改进算法对运动较平缓的立体视频序列效果较好,较JMVC模型中的算法对全部测试序列的平均编码时间减少了约67%,而对运动较平缓序列的编码时间减少达73%。 相似文献
7.
多视点视频编码(Muti-view Video Coding,MVC)标准采用预测关系固定的编码结构,不能根据视频序列调整预测关系,导致无法获得更好的编码效率.本文针对这一缺陷提出一种确定预测结构的方法,首先对图像进行下采样获得粗粒度图像,然后利用粗粒度图像间的灰度方差获得灰度相近的视点,最后对所选取的灰度相近的视点运用全局视差确定I-视点.经实验验证,本文的方法可以提高编码效率并减少编码中的缓存容量. 相似文献
8.
9.
10.
应用于多视点视频压缩的多参考B帧快速编码算法 总被引:2,自引:0,他引:2
基于H.264平台就多视点视频压缩中多参考帧技术存在计算复杂度高的现状,根据多视点视频序列特性,提出了一种针对多参考B帧的快速多视点视频编码压缩算法。新算法改进了多参考帧列表策略,并结合多视点视频序列的时空域相关性特性,提出了适用于多视点视频编码的参考帧列表调整策略。此外,还针对多种块模式编码引入了块模式预判策略。新算法在保证率失真性能的基础上,有效地降低了计算复杂度,提高了多视点视频编码速度。虽然本文是基于M-Picture编码结构实现了新算法,但它同样适用于其它应用多参考B帧预测技术的多视点视频编码结构中。 相似文献
11.
新兴的分布式多视点视频编码通过在解码端使用立体边信息可充分挖掘传统单视点的时间相关性和多视点特有的视间相关性.研究了一种多视点运动预测的立体边信息生成算法,提出了近似视差估计和编码端掩模融合算法.实验证明,解码端采用近似的视差矢量,编码端传递某些先验信息,都能有效提高立体边信息精度,降低计算复杂度. 相似文献
12.
Sang Heon Lee Sang Hwa Lee Jeong Hyu Yang Nam Ik Cho 《Journal of Visual Communication and Image Representation》2010,21(7):677-681
This paper proposes a new motion vector (MV) prediction method in multi-view video coding (MVC). In order to exploit the information in adjacent views, inter-view MVs as well as temporal MVs are used in conventional MVC. Since the inter-view MVs are usually uncorrelated with the temporal MVs and most neighboring partitions have temporal MVs only, the conventional DPCM coding gain of inter-view MV is very low and thus the inter-view MVs are seldom selected. In order to increase the probability of inter-view MV selection, we define a virtual inter-view MV which can be generated from temporal MVs. Then, an inter-view MV is predicted using these neighboring virtual inter-view MVs, leading to less prediction error than using the temporal MVs. As a result, bit-rates are decreased by up to 9% for the view-temporal prediction structure. 相似文献
13.
14.
Fengsui Wang Huanqiang Zeng Qinghong Shen Sidan Du 《Signal Processing: Image Communication》2013,28(7):736-744
Multi-view video coding (MVC) uses various prediction modes and exhaustive mode decision to achieve high coding efficiency. However, the introduced heavy computational complexity becomes the bottleneck of the practical application of MVC. For this, an efficient early Direct mode decision for MVC is proposed in this paper. Based on the observation that the Direct mode is highly possible to be the optimal mode, the proposed method first computes the rate distortion (RD) cost of the Direct mode and compares this RD cost value with an adaptive threshold for providing an early termination chance as follows. If this RD cost value is smaller than the adaptive threshold, the Direct mode will be selected as the optimal mode and the checking process of the remaining modes will be skipped; otherwise, all the modes will be checked to select the one with the minimum RD cost as the optimal mode. Note that the above-mentioned adaptive threshold is determined as the median prediction value of a set of thresholds, which are derived by using the spatial, temporal and inter-view correlations between the current macroblock (MB) and its neighboring MBs, respectively. Experimental results have demonstrated that the proposed method is able to significantly reduce the computational complexity of MVC with negligible loss of coding efficiency, compared with the exhaustive mode decision in MVC. 相似文献
15.
Tae-Young Chung Il-Lyong Jung Kwanwoong Song Chang-Su Kim 《Journal of Visual Communication and Image Representation》2010,21(5-6):474-486
An efficient compression algorithm for multi-view video sequences, which are captured by two-dimensional (2D) camera arrays, is proposed in this work. First, we propose a novel prediction structure, called three-dimensional hierarchical B prediction (3DHBP), which can efficiently reduce horizontal inter-view redundancies, vertical inter-view redundancies, and temporal redundancies in multi-view videos. Second, we develop a view interpolation scheme based on the bilateral disparity estimation. The interpolation scheme yields high quality view frames by adapting disparity estimation and compensation procedures using the information in neighboring frames. Simulation results demonstrate that the proposed multi-view video coding algorithm provides significantly better rate–distortion (R–D) performance than the conventional algorithm, by employing the 3DHBP structure and using interpolated view frames as additional reference frames. 相似文献
16.
基于高效视频编码的3D视频编码(3D-HEVC)是目前正在研究的新一代3D视频编码标准。为降低3D-HEVC中模式选择的计算复杂度,根据非独立视点纹理图中合并模式采用率高的特点,该文提出了一种3D-HEVC合并模式快速判决方法。在B帧中,分析了当前编码单元(CU)与视点方向参考帧中参考块间编码模式的相关性;在P帧中,分析了位于相邻划分深度的CU间编码模式的相关性。根据分析的视点间和划分深度间的相关性设计快速判决条件,预判采用合并/合并-跳过模式编码的CU,判别出的CU在模式选择过程中只检查相关的候选预测模式,从而降低计算复杂度。实验结果表明,与3D-HEVC原始算法相比,该文算法能够在率失真性能损失很小的前提下,平均节省11.2%的总编码时间和25.4%的非独立视点纹理图的编码时间。 相似文献
17.
Qiuwen Zhang Yongshuang Yang Huawen Chang Weiwei Zhang Yong Gan 《Multidimensional Systems and Signal Processing》2017,28(4):1203-1226
The emergent 3D High Efficiency Video Coding (3D-HEVC) is an extension of the High Efficiency Video Coding (HEVC) standard for the compression of the multi-view texture videos plus depth maps format. Since depth maps have different statistical properties compared to texture video, various new intra tools have been added to 3D-HEVC depth coding. In current 3D-HEVC, new intra tools are utilized together with the conventional HEVC intra prediction modes for depth coding. This technique achieves the highest possible coding efficiency, but leads to an extremely high computational complexity which limits 3D-HEVC from practical applications. In this paper, we propose a fast intra mode decision algorithm for depth coding in 3D-HEVC. The basic idea of the proposed algorithm is to utilize the depth map characteristics to predict the current depth prediction mode and skip some specific depth intra modes rarely used in 3D-HEVC depth coding. Based on this analysis, two fast intra mode decision strategies are proposed including reduction of the number of conventional intra prediction modes, and simplification of depth modeling modes (DMMs). Experimental results demonstrate that the proposed algorithm can save 30 % coding runtime on average while maintaining almost the same rate-distortion (RD) performance as the original 3D-HEVC encoder. 相似文献