scholarly journals An Effective Transform Unit Size Decision Method for High Efficiency Video Coding

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Chou-Chen Wang ◽  
Chi-Wei Tung ◽  
Jing-Wein Wang

High efficiency video coding (HEVC) is the latest video coding standard. HEVC can achieve higher compression performance than previous standards, such as MPEG-4, H.263, and H.264/AVC. However, HEVC requires enormous computational complexity in encoding process due to quadtree structure. In order to reduce the computational burden of HEVC encoder, an early transform unit (TU) decision algorithm (ETDA) is adopted to pruning the residual quadtree (RQT) at early stage based on the number of nonzero DCT coefficients (called NNZ-EDTA) to accelerate the encoding process. However, the NNZ-ETDA cannot effectively reduce the computational load for sequences with active motion or rich texture. Therefore, in order to further improve the performance of NNZ-ETDA, we propose an adaptive RQT-depth decision for NNZ-ETDA (called ARD-NNZ-ETDA) by exploiting the characteristics of high temporal-spatial correlation that exist in nature video sequences. Simulation results show that the proposed method can achieve time improving ratio (TIR) about 61.26%~81.48% when compared to the HEVC test model 8.1 (HM 8.1) with insignificant loss of image quality. Compared with the NNZ-ETDA, the proposed method can further achieve an average TIR about 8.29%~17.92%.

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Chan-seob Park ◽  
Gwang-Soo Hong ◽  
Byung-Gyu Kim

The joint collaborative team on video coding (JCT-VC) is developing the next-generation video coding standard which is called high efficiency video coding (HEVC). In the HEVC, there are three units in block structure: coding unit (CU), prediction unit (PU), and transform unit (TU). The CU is the basic unit of region splitting like macroblock (MB). Each CU performs recursive splitting into four blocks with equal size, starting from the tree block. In this paper, we propose a fast CU depth decision algorithm for HEVC technology to reduce its computational complexity. In2N×2N PU, the proposed method compares the rate-distortion (RD) cost and determines the depth using the compared information. Moreover, in order to speed up the encoding time, the efficient merge SKIP detection method is developed additionally based on the contextual mode information of neighboring CUs. Experimental result shows that the proposed algorithm achieves the average time-saving factor of 44.84% in the random access (RA) at Main profile configuration with the HEVC test model (HM) 10.0 reference software. Compared to HM 10.0 encoder, a small BD-bitrate loss of 0.17% is also observed without significant loss of image quality.


Author(s):  
Mohammad Barr

Background: High-Efficiency Video Coding (HEVC) is a recent video compression standard. It provides better compression performance compared to its predecessor, H.264/AVC. However, the computational complexity of the HEVC encoder is much higher than that of H.264/AVC encoder. This makes HEVC less attractive to be used in real-time applications and in devices with limited resources (e.g., low memory, low processing power, etc.). The increased computational complexity of HEVC is partly due to its use of a variable size Transform Unit (TU) selection algorithm which successively performs transform operations using transform units of different sizes before selecting the optimal transform unit size. In this paper, a fast transform unit size selection method is proposed to reduce the computational complexity of an HEVC encoder. Methods: Bayesian decision theory is used to predict the size of the TU during encoding. This is done by exploiting the TU size decisions at a previous temporal level and by modeling the relationship between the TU size and the Rate-Distortion (RD) cost values. Results: Simulation results show that the proposed method achieves a reduction of the encoding time of the latest HEVC encoder by 16.21% on average without incurring any noticeable compromise on its compression efficiency. The algorithm also reduces the number of transform operations by 44.98% on average. Conclusion: In this paper, a novel fast TU size selection scheme for HEVC is proposed. The proposed technique outperforms both the latest HEVC reference software, HM 16.0, as well as other state-of-the-art techniques in terms of time-complexity. The compression performance of the proposed technique is comparable to that of HM 16.0.


2020 ◽  
Vol 10 (2) ◽  
pp. 496-501
Author(s):  
Wen Si ◽  
Qian Zhang ◽  
Zhengcheng Shi ◽  
Bin Wang ◽  
Tao Yan ◽  
...  

High Efficiency Video Coding (HEVC) is the next generation video coding standard. In HEVC, 35 intra prediction modes are defined to improve coding efficiency, which result in huge computational complexity, as a large number of prediction modes and a flexible coding unit (CU) structure is adopted in CU coding. To reduce this computational burden, this paper presents a gradient-based candidate list clipping algorithm for Intra mode prediction. Experimental results show that the proposed algorithm can reduce 29.16% total encoding time with just 1.34% BD-rate increase and –0.07 dB decrease of BD-PSNR.


2020 ◽  
pp. 599-609
Author(s):  
Hajar Touzani ◽  
Ibtissem Wali ◽  
Fatima Errahimi ◽  
Anass Mansouri ◽  
Nouri Masmoudi ◽  
...  

New and stronger video compression standard was developed during the last years, called H.265/HEVC (High Efficiency Video Coding). This standard has undergone several improvements compared to H.264/AVC (Advanced Video Coding). In intra prediction block, 33 directional intra prediction modes were included in H.265 to have an efficient coding instead of 8 modes that were used in H.264 in addition to planar and DC modes, which has generated computational complexities in the new standard. Therefore one of the most issues for embedded implementation of HEVC is time reduction of the encoding process. In this paper, an embedded implementation of a fast intra prediction algorithm is performed on ARM processors under the embedded Linux Operating System. Experimental results included the comparison between the original HM16.7 and the proposed algorithm show that the encoding time was reduced by an average of 61.5% with an increase of 1.19 in the bit rate and a small degradation in the PSNR of 0.05%.


Sign in / Sign up

Export Citation Format

Share Document