Pixel-Wise Unified Rate-Quantization Model for Multi-Level Rate Control

Although high efficiency video coding (HEVC) has achieved high coding performance, it has been shown that dependent rate-distortion optimization (RDO) can still further improve the coding performance at the encoder side. Inspired by our previous work on temporal-dependent RDO, this paper proposes a rate control method at coding tree unit (CTU) level to obtain both higher rate-distortion (R-D) performance and lower bitrate errors. We first formulate the global optimization problem in hybrid video coding and present a general solution framework based on a weighted Lagrange multiplier, where the weighted coefficient is related to the strength of temporal dependency among coding units, and a propagation factor is introduced for quantitative measurement of the temporal dependency. Second, an estimation method of CTU level R-D model is proposed to characterize R-D relationship more accurately. Finally, under the constraint of frame level bit budget, a formulation combining inter-block dependency and R-D characteristic is developed for optimal bit allocation at the CTU level. In the process of encoding a frame, a relaxed constraint algorithm (RCA) and a strict constraint algorithm (SCA) are employed to reduce the difference between numbers of actual and target bits for the current frame, respectively. Experimental results demonstrate that, on the HEVC test model (HM-16.7), our methods including RCA and SCA achieve considerable R-D performance improvement with lower bitrate errors, outperforming the state-of-the-art schemes. It is worth mentioning that even compared with HEVC without rate control, the RCA can still achieve bitrate savings of 5.4% and 5.1% on average under configurations of low delay P and B frames, respectively.

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.

High Efficiency Video Coding (HEVC), the latest video coding standard, aims to provide coding performance that is much superior to that of its predecessor, H.264, especially for high definition video. To fulfill this goal, the inter-prediction unit (PU) partitions of HEVC are more complex, and the search range of motion estimation (ME) is much larger. As a result, ME becomes a bottleneck in the design of the HEVC inter predictor. In response to this challenge, we developed a hardware-oriented integer ME algorithm and the related hardware implementation. Our proposed algorithm led to a decrease in terms of the Bjontegaard Delta rate when compared with the HEVC test model 15.0. The corresponding hardware solution benefitted from 2-D data reuse supported by horizontal and vertical reference SRAMs, on-chip memory reduction supported by $4\times4$ block compression, and a low-power sum of absolute difference (SAD) tree supported by PU-level chip selection. When adopting a $32\times32$ SAD tree, the minimum and maximum required working frequency for 4K $\times2\text{K}$ at 30 frames/s videos was [375, 500] MHz. These results demonstrated that our proposed solution offered desirable improvement in both coding speed and coding performance.

High-Efficiency Video Coding (HEVC) is the latest video coding standard developed by the Joint Collaborative Team on Video Coding (JCT-VC). An effective rate control mechanism plays a critical role in making the best possible use of the network resources. The coding performance can be maximised through the appropriate allocation of bits under the constraints of a total bit rate budget and the buffer size. Existing rate control strategies generally determine the rate control parameters according to previous encoding results. However, there is no priori-knowledge available when the first frame of a video sequence is encoded or scene changes occur. Consequently, it is challenging to choose appropriate rate control parameters in such cases. In order to address this issue, we investigated deep learning oriented methods and proposed a Convolutional Neural Network (CNN)-based rate control scheme for HEVC intra-coding. As the CNN has the advantage of local perception and the Coding Tree Unit's (CTU's) Quantisation Parameter (QP) value is determined during the CTU level rate control process, we applied the CNN at the CTU level as well to achieve an accurate QP prediction. An improved QP determination model (R-QP model) involving only two model coefficients (µ and v) was suggested to simplify the QP calculation process. A CNN was used to predict the model coefficients, namely µ and v. Our CNN has four convolution layers, two pooling layers and three fully connected layers. Each of the convolution layers contains a Rectified Linear Unit (ReLU). The last fully connected layer outputs the predicted values of µ and v. The images from the UCID dataset and the RAISE dataset were used to train the CNN. In order to obtain a universal model, none of the frames in the HEVC common test sequences were employed as training images. In order to achieve a reasonable bit budget allocation, a CNN-based framework was used to predict the bit consumption for each CTU according to the entire picture content that it contains. At the training stage, the network took the original images and the QP values as inputs, and the corresponding actual bit consumptions were used as the labels. Once the CNN coefficients have been obtained through training, the bit consumption for each CTU under different QP values can be directly predicted from the original images. The predicted bit consumption was subsequently used to readjust the bit budget for each CTU to achieve a more reasonable bit allocation. We implemented the proposed CNN-based rate control scheme in the HEVC reference software HM 16.9. As the priori-knowledge of the previous encoding results had not been considered in the proposed algorithm, only the first frame of each video sequence was encoded. The experimental results showed that our proposed scheme performs better than the default rate control implementation in the HEVC reference software, namely the BDBR is reduced by 1.33% on average while maintaining the same reconstructed picture quality. Compared with the state-of-the-art CNN-based rate control algorithm proposed by Li, our schemes achieved better coding efficiency. It can be concluded that the proposed R-QP model is effective in describing the rate-distortion relationship in HEVC, and the CNN-based bit allocation scheme is appropriate for ensuring that the best use of each bit is made.

本文提出了一种HEVC视频编码的运动估计快速算法，该算法可以显著加速搜索过程，编码效率与HEVC参考软件(Test Model)中的Test Zone Search (TZSearch)平分秋色。较之H.264/AVC视频标准，HEVC引入了更为复杂的混合编码框架和更大尺寸的搜索窗口，从而带来了更高的计算复杂度。为了降低复杂度，我们提出了一种新的运动估计算法，该算法仅利用搜索窗中所选取的少量几个点建立二次曲面模型，通过对像素的绝对差值和(SAD)分布的迭代分析，逐步缩小搜索范围，直到得出最优的运动矢量。该算法可被用于不同的编码环境中，实验结果表明，与HM相比，该算法可以节约大约40%的运动估计算法时间，仅引起轻微的性能损失。 This paper presents a motion estimation (ME) algorithm for High Efficiency Video Coding (HEVC), which provides a strategy to speed up the search process significantly, while yielding the same quality performance as the Test Zone Search (TZSearch) scheme in HEVC Test Model (HM). Compared with the H.264/AVC, HEVC employs a more complex hybrid coding architecture and a larger size search window, leading to great computational complexity. In order to reduce the complexity, a novel motion estimation algorithm is proposed, in which some limited pixels of certain position in the current search window are utilized to build a quadratic model, and then shrink the search range repeatedly by analyzing the sum of absolute difference (SAD) distribution until the best motion vector (MV) is obtained. The proposed algorithm can be applied to various encoding conditions. Experimental results show that our method can save 40% of computations compared with the HM, with negligible decrease of coding quality.

The emerging standard of High Efficiency Video Coding (HEVC) provides a 50% improved compression performance compared to its predecessor H.264/AVC at the expense of increasing its computational complexity which is due to a large number of modes involved in the decision process where it would increase encoding time and provide hardware limitations. In this paper, the reduction of intra-coding complexity is proposed by utilization of Rate-Distortion Optimization (RDO) in preselecting a mode with the best RD cost, among all 35 intra-modes. Two cost functions – Sum of Absolute Difference (SAD) and Sum of Absolute Transform Difference (SATD, available in the HEVC Test Model (HM) Reference Software, are determined by making encoder decisions. This paper compares the performance and complexity cost of SAD only for intra-mode, with SATD-based intra-mode by modifying the HM reference encoder through forced selection of the mentioned modes. Results show that SAD consistently produces the least encoding time among all modes, along with sensible values of bitrate. Furthermore, error concealment was introduced in decoding the video sequences with the use of IEEE 802.22 Standard which only allowed power gains resulting to packet error rates (PER) ranging from 1% to 30% for the analysis on the behavior of each video sequence in an environment where error is introduced.

The High Efficiency Video Coding (HEVC) utilizes Z-scan order to process coding units (CUs). For intra prediction, this order cannot fully exploit the spatial correlation between adjacent CUs. After transform and quantization, the residue still contains lots of energy along edges which consumes many bits for compression. To effectively reduce the residue energy along edges, a novel intra prediction approach is proposed, where the CU processing order is changed adaptively. Two additional orders are introduced in this paper besides traditional Z-scan order. Up to 1.9% bit saving is achieved in our experiments on HEVC test model. We also propose two fast order selection algorithms and the observed gains are obtained with 27% and 2% encoding time increase compared to HEVC, respectively.

HEVC (high efficiency video coding), as the latest video coding standard, is more efficient than H.264/AVC, nevertheless it also brings in a very high computational complexity. To reduce the time of CU (coding unit) splitting or PU (prediction unit) mode deciding, a fast algorithm based on ANN (artificial neural network) and texture analysis is proposed in this paper. First, we acquire and then label the CUs of the training set with “split” and “unsplit” according to the quad-tree CU depth. Second, the texture features of “split” and “unsplit” CUs are quantified and compiled, based on which we can set the texture thresholds to judge whether or not to split the current CU or which prediction mode should be taken preliminarily. Finally, in terms of the CUs we can't judge from texture, we use ANN or the original algorithm of HM (HEVC test model) software to decide. Compared to HM15.0, the proposed algorithm can save 51.85% encoding time on average with negligible coding efficiency loss.

It has been shown that the quality of multimedia video and the need of real time video transmission become widely increased in these days and high efficiency video coding (HEVC) becomes the newest standard. Based on the theory of ratedistortion coding, the R-X model can describe the rate-distortion relationship more accurately in comparison with the existing traditional R-Q model. With the development of screen content coding, this paper proposes a new adaptive intra frame complexity measure method based on two complexity measure methods with a relative coefficient for intra bit rate control, respectively are the gradient based complexity measure and edge based complexity measure. Then the paper proposes an improved rate control method for the intra-frame rate control, which merges the adaptive intra frame complexity measure with R-X model based on HEVC. Along with this new adaptive rate control approach, it will show improved accuracy in rate control and enhanced performance in video coding which means better video quality. The proposed scheme can reduce the frame bit mismatch ratio by 2.8175% on average and the better B-D Rate which is 0.94% on average. Experimental results verify the effectiveness of the proposed intra frame complexity method based on X-domain rate control algorithm.

The recent video compression standard, HEVC (high efficiency video coding), will most likely be used in various applications in the near future. However, the encoding process is far too slow for real-time applications. At the same time, computing capabilities of GPUs (graphics processing units) have become more powerful in these days. In this paper, we have proposed a GPU-based parallel motion estimation (ME) algorithm to enhance the performance of an HEVC encoder. A frame is partitioned into two subframes for pipelined execution to improve GPU utilization. The flow chart is redetermined to solve data hazards in the pipelined execution. Two new methods are introduced in the proposed ME: decision of a representative search center position (RSCP) and warp-based concurrent parallel reduction (WCPR). A RSCP employs motion vectors of a co-located CTU in a previously encoded frame to solve a dependency problem in parallel computation with negligible coding loss. WCPR concurrently executes several parallel reduction operations, which increases the thread utilization from 20 to 89 % without any thread synchronization. The proposed encoder can make the portion of ME in the encoder negligible with 2.2 % bitrate increase against the HEVC test model (HM) encoder. In terms of ME, the proposed ME is 130.7 times faster than that of the HM encoder.

ITU-T VCEG and ISO/IEC MPEG have undertaken a joint standardization activity on video coding called High Efficiency Video Coding (HEVC). This paper describes the transform coefficient coding in the HEVC Test Model (WD5) and the motivations driving the design. The coefficient coding description encompasses the scan patterns and the coding methods of the last significant coefficient, significance map and coefficient level. Special focus is given to the method for coding the last significant coefficient in the block.

The High Efficiency Video Coding (HEVC) standardization project mainly aims at improving the compression efficiency beyond the state-of-the-art H.264/AVC standard for high and ultra high definition video contents. The HEVC codec reference software, still under development, encodes video content using a fixed quantization step, thus leading to a variable bitrate stream which may not be suitable for the many multimedia applications where a constant bandwidth is required. Therefore, a rate control algorithm must be integrated in the HEVC codec taking into account that the novel coding tools further reduce the bitrate associated to texture data while increase the bitrate associated to the auxiliary information, e.g. motion vectors and coding modes. In this context, this paper studies the integration of a quadratic modeling rate control algorithm in the HEVC codec. Experimental results reveal that the rate control enabled HEVC codec provides a lower rate-distortion performance regarding a fixed quantization step HEVC codec, notably spending up to 20.12% more bitrate for the same objective quality. However, the integrated rate control algorithm offers lower bitrate fluctuations along the video contents than the HEVC codec with fixed quantization step.

S.3693-3696

In order to realize copyright protection and piracy tracking for ever-increasing videos, video information hiding has gained more and more attention. For the latest video coding standard — High Efficiency Video Coding (HEVC), most of the information hiding algorithms are based on the same characteristics as those in MPEG4 and H.264, such as DCT coefficients, intra prediction modules and motion vectors. However, few algorithms are reported to hide information based on the innovation modules introduced by HEVC. This paper has proposed a high capacity and multilevel information hiding algorithm based on PU partition modes in P-frames, which is considered to be one of the most important innovative features of HEVC. The proposed algorithm consists of two stages: first round calculation and modification process. The first round calculation is to record the PU partition modes selected by HEVC. The modification process is to force each of PU mode into one of the encoded groups according to the embedding binary bits, and then use the modified PU partition modes for the left HEVC encoding process. The experimental results show that the proposed algorithm can achieve high capacity and visual quality, and low bit rate increase, which significantly outperforms state-of-the-art works in embedding capacity.

High quality videos became an essential requirement in recent applications. High efficiency video coding (HEVC) standard provides an efficient solution for high quality videos at lower bit rates. On the other hand, HEVC comes with much higher computational cost. In particular, motion estimation (ME) in HEVC, consumes the largest amount of computations. Therefore, fast ME algorithms and hardware accelerators are proposed in order to speed‐up integer ME in HEVC. This study presents a fast centre search algorithm (FCSA) and an adaptive search window algorithm (ASWA) for integer pixel ME in HEVC. In addition, centre adaptive search algorithm, a combination of the two proposed algorithms FCSA and ASWA, is proposed in order to achieve the best performance. Experimental results show notable speed‐up in terms of encoding time and bit rate saving with tolerable peak signal‐to‐noise ratio (PSNR) quality degradation. The proposed fast search algorithms reduce the computational complexity of the HEVC encoder by 57%. This improvement is accompanied with a modest average PSNR loss of 0.014 dB and an increase by 0.6385% in terms of bit rate when compared with related works.