scholarly journals H.265 Intra-Picture Prediction Acceleration using Low Complexity Model

2019 ◽  
Vol 8 (11) ◽  
pp. 2939-2944
Keyword(s):  
Video Coding ◽  
High Efficiency ◽  
Low Complexity ◽  
Video Encoding ◽  
High Efficiency Video Coding ◽  
Tree Model ◽  
Time Saving ◽  
Applied Machine Learning ◽  
Additional Burden ◽  
Increasing Demand

H.265 also called High Efficiency Video Coding is the new futuristic international standard proposed by Joint collaboration Team on Video Coding and released in 2013 in the view of constantly increasing demand of video applications. This new standard reduces the bitrate to half as compared to its predecessor H.264 at the expense of huge amount of computational burden on the encoder. In the proposed work we focus on intraprediction phase of video encoding where 33 new angular modes are introduced in addition to DC and Planar mode in order to achieve high quality videos at higher resolutions. We have proposed the use of applied machine learning to HEVC intra prediction to accelerate angular mode decision process. The features used are also low complexity features with minimal computation so as to avoid any additional burden on the encoder. The Decision tree model built is simple yet efficient which is the requirement of the complexity reduction scenario. The proposed method achieves substantial average encoding time saving of 86.59%, with QP values 4,22,27,32 respectively with minimal loss of 0.033 of PSNR and 0.0023 loss in SSIM which makes it suitable for acceptance of High Efficiency Video coding in real time applications

Adaptive low-complexity motion estimation algorithm for high efficiency video coding encoder

2016 ◽  
Vol 10 (6) ◽  
pp. 438-447 ◽  
Author(s):  
Ahmed Medhat ◽  
Maha Elsabrouty ◽  
Ahmed Shalaby ◽  
Farhad Mehdipour ◽  
Mohammed Sharaf Sayed
Keyword(s):  
Motion Estimation ◽  
Video Coding ◽  
High Efficiency ◽  
Estimation Algorithm ◽  
Low Complexity ◽  
High Efficiency Video Coding ◽  
Motion Estimation Algorithm

scholarly journals Low Complexity Quantization in High Efficiency Video Coding

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 145159-145170
Author(s):  
Meng Wang ◽  
Xiaohan Fang ◽  
Songchao Tan ◽  
Xinfeng Zhang ◽  
Li Zhang
Keyword(s):  
Video Coding ◽  
High Efficiency ◽  
Low Complexity ◽  
High Efficiency Video Coding

scholarly journals Novel Intermode Prediction Algorithm for High Efficiency Video Coding Encoder

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Chan-seob Park ◽  
Gwang-Soo Hong ◽  
Byung-Gyu Kim
Keyword(s):  
Video Coding ◽  
High Efficiency ◽  
Rate Distortion ◽  
Experimental Result ◽  
Prediction Algorithm ◽  
Basic Unit ◽  
Test Model ◽  
High Efficiency Video Coding ◽  
Time Saving ◽  
Decision Algorithm

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.

scholarly journals Modern Video Coding: Methods, Challenges and Systems

2021 ◽  
Vol 16 (2) ◽  
pp. 1-12
Author(s):  
Roberta De Carvalho Nobre Palau ◽  
Bianca Santos da Cunha Silveira ◽  
Robson André Domanski ◽  
Marta Breunig Loose ◽  
Arthur Alves Cerveira ◽  
...  
Keyword(s):  
Video Coding ◽  
High Throughput ◽  
High Efficiency ◽  
High Efficiency Video Coding ◽  
Ultrahigh Resolution ◽  
Daily Lives ◽  
Open Research ◽  
Hardware Architectures ◽  
Increasing Demand ◽  
Dedicated Hardware

With the increasing demand for digital video applications in our daily lives, video coding and decoding become critical tasks that must be supported by several types of devices and systems. This paper presents a discussion of the main challenges to design dedicated hardware architectures based on modern hybrid video coding formats, such as the High Efficiency Video Coding (HEVC), the AOMedia Video 1 (AV1) and the Versatile Video Coding (VVC). The paper discusses eachstep of the hybrid video coding process, highlighting the main challenges for each codec and discussing the main hardware solutions published in the literature. The discussions presented in the paper show that there are still many challenges to be overcome and open research opportunities, especially for the AV1 and VVC codecs. Most of these challenges are related to the high throughput required for processing high and ultrahigh resolution videos in real time and to energy constraints of multimedia-capable devices.

scholarly journals Steganography algorithm based on modified EMD coded PU partition modes for HEVC videos

2021 ◽  
Author(s):  
Zhenzhen Zhang ◽  
Zhaohong Li ◽  
Jindou Liu ◽  
Huanma Yan ◽  
Lifang Yu
Keyword(s):  
Video Coding ◽  
High Efficiency ◽  
State Of The Art ◽  
Visual Quality ◽  
Video Encoding ◽  
Embedding Capacity ◽  
High Efficiency Video Coding ◽  
Exploiting Modification Direction ◽  
The One ◽  
Notational System

Abstract As High Efficiency Video Coding (HEVC) is a worldwide popular video coding standard, the steganography of HEVC videos has gained more and more attention. Prediction Unit (PU) is one of the most important innovative modules of HEVC, thus PU partition mode based steganography is becoming a novel branch of HEVC steganography. However, the embedding capacity of this kind of steganography is limited by the types of PU partition modes. To solve the problem, modified Exploiting Modification Direction (EMD) coded PU partition modes based steganography is proposed in this paper, which can hide a secret digit in a ( [[EQUATION]] )-ary notational system in a pair of PU partition modes and thus enlarging the capacity. Furthermore, two mapping patterns for PU partition modes are analyzed and the one that performs the better is selected as the final mapping pattern. Firstly, 8×8 and 16×16 sized PU partition modes are recorded according to the optimal mapping pattern in the video encoding process. Then PU partition modes are modified by using the proposed method to satisfy the requirement of secret information. Finally, the stego video can be obtained by re-encoding the video with the modified PU partition modes. Experimental results show that the embedding capacity can be significantly enlarged, and compared with the state-of-the-art work, the proposed method has much larger capacity while keeping high visual quality.

scholarly journals Intelligent Coding Unit Partitioning using Predictive Data Mining

2019 ◽  
Vol 8 (12) ◽  
pp. 3061-3065
Keyword(s):  
Data Mining ◽  
Computational Complexity ◽  
Video Coding ◽  
High Efficiency ◽  
High Efficiency Video Coding ◽  
Tree Model ◽  
Control Scheme ◽  
Coding Standards ◽  
Predictive Data Mining ◽  
Coding Unit

Increasing applications of videos in everyday life demands compressing the videos further. International bodies for Video Coding standards are working toward making it more efficient in terms of reducing bitrate so as to efficiently compress the high-resolution videos. With increasing resolution, the size of the Coding Units increases. Latest Video Coding techniques like High Efficiency Video Coding (HEVC) and Versatile Video coding (VVC) proposed Larger coding Units with flexible Quadtree decompositions. In Inter-picture prediction all the sub blocks have to find best partitioning structure during motion estimation. Due to larger coding units finding the best partitioning introduces computational complexity. In the proposed work we present a computational complexity control scheme using predictive data mining. The method helps to predict whether to split or no split the coding unit. The decision tree model trained offline in the proposed work achieves 77.73% saving in encoding time with minimal change of 0.15 in average PSNR and 0.00074 in average SSIM values.

scholarly journals Fast CU Partition Decision Based on Texture for H.266/VVC

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Qiuwen Zhang ◽  
Tengyao Cui ◽  
Rijian Su
Keyword(s):  
Video Coding ◽  
High Efficiency ◽  
Vertical Direction ◽  
High Efficiency Video Coding ◽  
High Quality ◽  
Time Saving ◽  
Cu Partition ◽  
Quality Video ◽  
Partition Structure ◽  
High Quality Video

With the development of multimedia equipment and the increasing demand for high-quality video applications, the traditional video coding standard, H.265/High Efficiency Video Coding (HEVC), can no longer effectively satisfy the requirements. To promote the development of high-quality video, a new generation video coding standard, H.266/Versatile Video Coding (H.266/VVC), is established, and it is the inheritance and development of H.265/HEVC. It not only retains many mature technologies and methods in HEVC but also adds some new coding tools, such as wide-angle prediction and Multitype Tree (MTT) partition structure. The MTT partition structure brings a more flexible partition method of Coding Unit (CU), but the accompanying increase in computational complexity is unacceptable. In order to ensure an effective balance between coding efficiency and coding quality, a fast CU partition algorithm based on texture is proposed in this paper. First, the texture complexity of the neighboring CU is used as a threshold for evaluating the complexity of the current CU, so as to skip the unpromising depth. Then, the gradient features are extracted to determine whether the Quad-Tree (QT) partition is executed. Finally, the improved Canny operator is used to extract edge features, and the partition mode in the horizontal or vertical direction is excluded. The algorithm was embedded in VTM7.0, and the video sequences with different resolutions were tested under general experimental configuration. Simulation experiment results show that the average time saving of this method reached 50.56% compared with the anchor algorithm. At the same time, the average BDBR is increased by 1.31%.

Sign in / Sign up

Export Citation Format

Share Document