A 3D-HEVC Fast Mode Decision Algorithm for Real-Time Applications

Shen, Liquan; An, Ping; Zhang, Zhaoyang; Hu, Qianqian; Chen, Zhengchuan

doi:10.1145/2700298

Cited by 33 publications

(14 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [25], a fast texture video coding scheme is presented to cut down the encoding time of 3D-HEVC. A fast algorithm developed in [26] is based on the early SKIP mode detection and the prediction size correlation-based mode decision to reduce 3D-HEVC encoding time for real-time applications, by jointly exploiting correlations among multiview texture video and depth map and the interlevel correlation in quadtree structure of HEVC. An early merge mode decision method is presented in [27], utilizing inter-view correlations to accelerate the dependent texture view coding process.…”

Section: Related Workmentioning

confidence: 99%

Low-Complexity Texture Video Coding Based on Motion Homogeneity for 3D-HEVC

Zhang

Shuaichao

2019

Scientific Programming

View full text Add to dashboard Cite

Three-dimensional extension of the high efficiency video coding (3D-HEVC) is an emerging international video compression standard for multiview video system applications. Similar to HEVC, a computationally expensive mode decision is performed using all depth levels and prediction modes to select the least rate-distortion (RD) cost for each coding unit (CU). In addition, new tools and intercomponent prediction techniques have been introduced to 3D-HEVC for improving the compression efficiency of the multiview texture videos. These techniques, despite achieving the highest texture video coding efficiency, involve extremely high-complex procedures, thus limiting 3D-HEVC encoders in practical applications. In this paper, a fast texture video coding method based on motion homogeneity is proposed to reduce 3D-HEVC computational complexity. Because the multiview texture videos instantly represent the same scene at the same time (considering that the optimal CU depth level and prediction modes are highly multiview content dependent), it is not efficient to use all depth levels and prediction modes in 3D-HEVC. The motion homogeneity model of a CU is first studied according to the motion vectors and prediction modes from the corresponding CUs. Based on this model, we present three efficient texture video coding approaches, such as the fast depth level range determination, early SKIP/Merge mode decision, and adaptive motion search range adjustment. Experimental results demonstrate that the proposed overall method can save 56.6% encoding time with only trivial coding efficiency degradation.

show abstract

Section: Related Workmentioning

confidence: 99%

Low-Complexity Texture Video Coding Based on Motion Homogeneity for 3D-HEVC

Zhang

Shuaichao

2019

Scientific Programming

View full text Add to dashboard Cite

show abstract

“…The above results show that In addition to the original HTM, the result of proposed scheme is also compared with five state-of-the-art fast methods under the "Random Access" and "All-Intra" conditions. These methods include FMDRA [19] (optimized only for depth map inter coding), CRSED [27], EBIMS [29], LBPMS [30], PDIMS [32], and EETDM [33], which are recently developed fast and efficient depth map algorithms for 3D-HEVC. All algorithms were performed on HTM16.1 and tested using the same computer for objective comparison.…”

Section: Sequencesmentioning

confidence: 99%

“…Currently, studies on complexity reduction of depth compression have also been proposed for 3D-HEVC, which is divided to two categories: fast inter prediction and intramode decision. Category 1: fast inter prediction algorithms proposed in literatures [18][19][20][21][22][23][24]. An early termination method is presented in Tohidypour et al [18] to reduce complexity of the encoders based on correlations with dependent and base view.…”

Section: Introductionmentioning

confidence: 99%

“…An early termination method is presented in Tohidypour et al [18] to reduce complexity of the encoders based on correlations with dependent and base view. A fast decision scheme is proposed in Shen et al [19] to save the depth compression time by the intercomponent, interlevel, and interview correlation. However, the property of intramode prediction in depth map coding is not exploited in this method, and the interview coding mode correlation is not suitable for depth map coding; the for this reason is that most depth maps are obtained by depth estimation algorithms, and there is very little connection between depth sequence viewpoints.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Complexity Reduction Scheme for Depth Coding in 3D-HEVC

et al. 2019

View full text Add to dashboard Cite

3D-high efficiency video coding (3D-HEVC) is the next-generation compression standard for multiview system applications, which has recently been approved by MPEG and VCEG as an extension of HEVC. To improve the compression efficiency of depth map, several compression tools have been developed for a better representation depth edges. These supplementary coding tools together with existing prediction modes can achieve high compression efficiency, but require a very high complexity that restricts the encoders from ongoing application. In this paper, we introduce a fast scheme to reduce complexity of depth coding in inter and intramode prediction procedure. A simulation analysis is performed to study intra and intermode distribution correlations in the depth compression information. Based on that correlation, we exploit two complexity reduction strategies, including early SKIP and adaptive intra prediction selection. Experimental results demonstrate that our scheme can achieve a complexity reduction up to 63.0%, without any noticeable loss of compression efficiency.

show abstract

“…Many works have already proposed simplifications specifically for 3D-HEVC such as [21][22][23]. However, as 3D-HEVC is still a new standard demanding much computational complexity, it still needs to obtain simplifications improvement and low-power hardware designs, mainly when requiring real-time processing 3D high definition videos running into embedded systems.…”

Section: Introductionmentioning

confidence: 99%

Real-time scalable hardware architecture for 3D-HEVC bipartition modes

Sanchez

Marcon

Agostini

2016

J Real-Time Image Proc

View full text Add to dashboard Cite

This article presents a real-time scalable hardware architecture for the bipartition modes of 3D highefficiency video coding (3D-HEVC) standard, which includes the depth modeling modes 1 (DMM-1) and 4 (DMM-4). A simplification of the DMM-1 algorithm was done, removing the refinement step. This simplification causes a small BD-rate increase (0.09 %) with the advantage of better using our hardware resources, reducing the necessary memory required for storing all DMM-1 wedgelet patterns by 30 %. The scalable architecture can be configured to support all the different block sizes supported by the 3D-HEVC and also to reach different throughputs, according to the application requirements. Then, the proposed solution can be efficiently used for several encoding scenarios and many different applications. Synthesis results considering a test case show that the designed architecture is capable of processing HD 1080p videos in real time, but with other configurations, higher resolutions are also possible to be processed.

show abstract

A 3D-HEVC Fast Mode Decision Algorithm for Real-Time Applications

Cited by 33 publications

References 32 publications

Low-Complexity Texture Video Coding Based on Motion Homogeneity for 3D-HEVC

Low-Complexity Texture Video Coding Based on Motion Homogeneity for 3D-HEVC

A Complexity Reduction Scheme for Depth Coding in 3D-HEVC

Real-time scalable hardware architecture for 3D-HEVC bipartition modes

Contact Info

Product

Resources

About