# Fast CU Size Decision Method Based on Just Noticeable Distortion and Deep Learning

Authors: Jinchao Zhao; Yihan Wang; Qiuwen Zhang
Journal: Scientific Programming
 (2021)

---

## Abstract

With the development of broadband networks and high-definition displays, people have higher expectations for the quality of video images, which also brings new requirements and challenges to video coding technology. Compared with H.265/High Efficiency Video Coding (HEVC), the latest video coding standard, Versatile Video Coding (VVC), can save 50%-bit rate while maintaining the same subjective quality, but it leads to extremely high encoding complexity. To decrease the complexity, a fast coding unit (CU) size decision method based on Just Noticeable Distortion (JND) and deep learning is proposed in this paper. Specifically, the hybrid JND threshold model is first designed to distinguish smooth, normal, or complex region. Then, if CU belongs to complex area, the Ultra-Spherical SVM (US-SVM) classifiers are trained for forecasting the best splitting mode. Experimental results illustrate that the proposed method can save about 52.35% coding runtime, which can realize a trade-off between the reduction of computational burden and coding efficiency compared with the latest methods.


---

## Body

## 1. Introduction

With the increasing requirements for high quality videos, the Joint Video Experts Team (JVET) developed a new generation of video coding standards based on H.265/High Efficiency Video Coding (HEVC), namely Versatile Video Coding (VVC). How to reduce the coding complexity and save coding time on the basis of ensuring the quality of video coding has become a hot issue in the current video coding field.Since the highly dense data brings huge challenges to bandwidth and storage, and the previous generation video coding standards are insufficient to fulfill the compression capacity of the future market, therefore, the VVC has appeared. The VVC that has good network adaptability, parallel processing capability, and compression efficiency is the latest video coding standard after HEVC. In addition, the VVC is formulated for 4K/8K video, and a bit-depth is 10-bit. The VVC extends the original partition structure, intra/interprediction, filtering, transformation, quantization/scaling, and entropy coding of the HEVC. Moreover, considering the characteristics of VVC, new prediction techniques are added, such as the quad-tree with nested multitype tree (QTMT) structure and other coding tools [1]. The usage of many advanced coding techniques greatly improves the compression efficiency of VVC but leads to a significant increase in the coding computational complexity [2, 3]. For example, the computational complexity of VTM is 19 times that of HM in “all-intra” configuration [4]. Therefore, how to reduce the complexity and efficiently compress large amounts of data has become an important issue in the practical application of VVC.The partition structure for VVC and HEVC is a significant distinction. Since quad-tree (QT) partition structure is only allowed in HEVC, the width and height of coding unit (CUs) are equal (width and height = 64, 32, 16, or 8); it means that CUs shape can only be square [5]. Furthermore, one of the linchpin characteristics in HEVC is the concept of multiple partitions, including CU, prediction unit (PU), and transform unit (TU). The multitype tree (MTT) architecture allows the asymmetric partition in VVC, which contains binary tree (BT) and ternary tree (TT) splitting. Theoretically, CU size can be any combination of 128, 64, 32, 16, 8, or 4. Additionally, due to the introduction of intra-subpartition (ISP) technique, even smaller length (2 or 1) exists in VVC. Thus, the MTT partition structure supports more CU sizes than the QT partition structure, thereby obtaining more efficient coding performance. It is worth noting that the allowed CU sizes may be inconsistent with the theory in practical applications. The CU shape has square or rectangular shape in the coding tree structure of VVC. The coding tree units (CTUs) are first used in the QT partition structure to generate four QT leaf nodes. Then, the leaf nodes of QT are further divided by the MTT partition structure. Figure 1 shows four types of splitting in the MTT structure including horizontal BT (BT_H), vertical BT (BT_V), horizontal TT (TT_H), and vertical TT (TT_V). In most cases, the CU, PU, and TU have the same size in the QTMT partition structure. The exception occurs when the maximum supported transform size is smaller than the width or height of the color component of the CU.Figure 1
The partition modes of MTT structure.The remainder of the paper is organized as follows: the related works are introduced in Section2. Section 3 describes the proposed method. Section 4 provides the experimental results and analysis. Finally, Section 5 concludes this paper.


## 2. Related Works

At present, the research on the VVC for coding mainly focuses on the intraprediction, which is manifested in the early termination of the CU division. To solve this problem, many works are proposed for fast CU size decision. An early determination method for VVC is proposed in [6], which can skip redundant MTT pruning and effectively reduce TT complexity, where the TT characteristics are defined in the VVC encoding context. A fast CU splitting approach is developed in [7], which can implement early termination. Chen et al. design a novel fast CU splitting method for the performances, which can balance the performance and complexity [8]. A deep Convolutional Neural Networks (CNN) model-based fast QT partition method is developed in [9] to forecast CU splitting mode, which considerably enhances performance. A fast MTT decision method is designed in [10], which can decrease computational complexity and maintain compression performance. Specifically, the splitting decision mode can be early decided by comparing the pixel difference of subblocks (SBPD) in horizontal and vertical subblocks so as to skip some redundant splitting modes. A fast method is devised based on spatial features in [11], where spatial features are used for early termination. In [12], a novel fast CU partition method is developed based on Bayesian to encounter huge computational burden. Chen et al. present a fast intrapartition method based on variance and gradient for decreasing coding complexity [13]. In [14], an adaptive CU splitting method based on the pooling-variable CNN is presented to decrease the coding time. A lightweight and tunable quad-tree plus binary tree (QTBT) structure method is developed based on Machine Learning (ML) in [15] to decrease the coding complexity. To reduce coding complexity, Dong et al. propose a fast method for VVC including mode selection and prediction terminating, which can decrease coding runtime [16]. Yang et al. introduce a fast intramethod including the low-complexity coding tree units (CTU) structure decision and fast intramode decision with gradient descent search [17]. In our previous works [18, 19], we proposed fast intramethod based on random forest classier and Directed Acyclic Graph Support Vector Machine (DAG-SVM) to reduce the complexity while maintaining the coding efficiency. Although the above methods can reduce the coding time, these methods do not consider the impact of human visual characteristics in the encoding procedure.The purpose of visual perception coding is to use human visual system (HVS) characteristics to eliminate information that the human eye cannot perceive as much as possible and to provide better visual perception quality with fewer bit resources. To this end, researchers have proposed a large number of visual perception coding methods. A novel discrete cosine transform-based energy-reduced JND model (ERJND) is presented in [20] for perceptual video coding. Reference [21] designs a JND-based perceptual rate control method for HEVC, which can achieve significantly improved coding performance. In [22], a JND compensation based perceptual video coding (PVC) method is designed to compress videos with better perceptual quality. A deep-learning-based Picture-Wise Just Noticeable Difference (PW-JND) prediction model is developed in [23] for image compression. A PVC method with visual saliency modulated JND model is introduced in [24]. Recently, Shen et al. have introduced a JND guided perceptually lossless coding framework [25]. Shen et al. devise an effective method to infer the JND profile based on patch-level structural visibility learning [26].Traditional methods mainly use techniques such as intra- and interprediction and entropy coding to eliminate redundant information to improve the rate-distortion (RD) performance [27]. However, traditional video coding methods do not fully consider the characteristics of the HVS. Therefore, how to effectively use the HVS to optimize the existing coding method has important theoretical significance and application value. A fast CU partitioning method based on visual perception characteristics is designed in this paper, which comprehensively considers multiple visual factors, such as visual mode complexity, spatial contrast masking (CM), luminance adaptation, and the disordered concealment effect of the free energy principle, and forms a hybrid JND model based on these visual characteristics. Then, based on the hybrid JND model, the CUs are separated into smooth, ordinary, and complex area. If CU is divided into complex area, the CUs utilize the trained Ultra-Spherical SVM (US-SVM) US-SVM classifier to decide the best splitting mode. Only K−1 US-SVMs need to be trained for VVC, thereby eliminating regions belonging to multiple categories in the decision and reducing the total number of training samples accordingly. Finally, the proposed method can reduce the coding time and complexity.


## 3. The Method Based on JND and Deep Learning

### 3.1. Hybrid JND Model

The JND model is usually utilized to depict the minimum perceptible distortion threshold of HVS, and it is an effective measure of visual redundancy of video images. Generally, the following three visual factors are mainly considered when modeling the JND threshold, including luminance adaptation, that is, the masking of HVS due to changes in background brightness; CM, that is, the masking of HVS due to spatial inhomogeneity; and contrast sensitivity function, that is, the masking of HVS due to frequency changes. On the basis of related literature, comprehensive consideration of visual factors such as spatial masking effect based on visual pattern complexity and CM, luminance adaptation, and disordered concealment effect based on the principle of free energy, a hybrid JND threshold model is designed to better describe the visual distortion sensitivity of the image area.It has been pointed out in the literature that the HVS tends to extract repeated visual content for analysis and comprehension, and it will also encode corresponding visual patterns for the content forecast as an important feature of image scene content [28]. In the regular pattern, the image scene provides a simple and intuitive element organization and arrangement mode, and its visual interaction with the human eye is relatively direct; the visual masking effect is weak at this time. In the irregular pattern, the corresponding arrangement mode and the visual interaction of the human eye are relatively complicated, and a strong visual masking effect is involved at this time [29]. It can be seen that the effective measure of the visual masking effect is the complexity of the visual pattern. Figure 2 shows an example of pattern complexity.Figure 2
Example of pattern complexity (left: regular pattern, right: irregular pattern). (a) Input image. (b) Pattern complexity map.
(a)(b)In the primary visual cortex, HVS shows obvious direction selectivity and the extracted direction information will be used to represent the image structure. Therefore, the direction information drawn from the image content is utilized to describe the complexity of the image mode. Studies have shown that HVS has obvious directional selectivity in the primary visual cortex. The extracted direction information will be used to represent the image structure and can describe the complexity of the image mode. Generally speaking, the complex mode usually contains a richer directional distribution, while the simple mode only contains a limited single directional distribution. Accordingly, the distribution of the gradient direction in the local image area [30] is used to indicate the corresponding visual pattern complexity (PC):(1)PCx,y=∑k=1NHkx,y0,where N refers to the quantized value range, H is the distribution histogram in the 5×5 neighborhood around x,y, and ⋅0 denotes the L0 norm that is mainly used to measure the number of nonzero elements in a vector.According to the above content, the complexity of the visual pattern of the image area can be used as an effective measure of the visual masking effect. Therefore, the combined CM effect can be used to better describe the degree of visual masking in space. Here, the spatial perception factor based on CM is used as a supplement to the complexity of the abovementioned visual mode:(2)CMx,y=Gradhx,y2+Gradvx,y2,where Gradhx,y is the gradient value of the point x,y in the horizontal direction and Gradvx,y is the gradient value of the point x,y in the vertical directions. Generally speaking, the above two kinds of masking characteristics show different masking effects in different image scenes and have certain complementarity. For example, the contrast masking may play a major role in relatively regular edge areas; the pattern masking may become the main factor in irregular areas. Consequently, the maximum value of the two masking components in different situations is utilized as the final measurement result of the spatial visual masking (VM):(3)VMx,y=maxPCx,y,CMx,y,In addition, HVS usually also shows different visual sensitivity to different background brightness, which is called Luminance Adaptation (LA). The visibility thresholds are different under different brightness backgrounds. Specifically, when the background brightness is lower than 127, the visibility threshold changes as a power function with the increase of the background brightness; when the background brightness exceeds 127, the visibility threshold changes linearly with the increase of the background brightness. The visibility threshold generated by the luminance adaptation is modeled as a piecewise function based on the background brightness:(4)LAx,y=1−Bx,y127×17,Bx,y≤127Bx,y−127×3128+3,Bx,y>127,where Bx,y refers to the brightness of background area of the image; it can be calculated by the average brightness of the pixels in the 5 × 5 neighborhood around the point x,y, as shown in Figure 3.Figure 3
Low-pass filter.After obtaining the VM and LA and other visual characteristic components, the nonlinear additivity model for masking (NAMM) is utilized to combine these visual characteristic components to form a perceptual JND threshold model:(5)JNDpx,y=LAx,y+VMx,y−α⋅minLAx,y,VMx,y,where α represents the gain loss parameter caused by overlap between these visual characteristic components, which is 0.3.HVS can accurately forecast ordered visual stimuli relatively easily based on the free energy principle and will do further analysis and understanding. However, it is difficult to accurately predict disordered information that is complex, chaotic, and uncertain. HVS usually ignores the detailed information and only extracts its main outline structure. For example, straight lines or stripes in a uniform background generally have strong certainty, so HVS can easily detect any changes on the straight line. However, there is greater uncertainty in the changes of image elements in disorderly grass and other similar scenes. At this time, HVS usually automatically ignores the details in the disordered image, so the human eye will not easily perceive the detailed grass. Therefore, another important factor that decides the JND threshold is the disordered concealment effect.It can be seen from the above analysis that the content changes of ordered images are regular and predictable, while it is sudden and unpredictable in disordered images. Thus, the disordered image denotes the uncertainty part of the original image. If sample value of the disordered image is large, it means that the corresponding original information has a high degree of uncertainty and can hide more noise and distortion. The existing pixel domain-based JND threshold estimation model performs well and estimates more accurately in ordered areas, such as flat, edge, and ordered texture areas, but underestimates JND threshold of disordered areas, such as disordered texture area. Therefore, in response to this shortcoming, the JND threshold based on the disordered concealment effect is calculated which is similar to [31](6)JNDdx,y=μ×fx,y−f′x,y=μ⋅Dx,y,f′x,y=∑kck⋅fxk,yk+ε,where fx,y denotes the original image of video, f′x,y represents order information in the input image, ck denotes the k-th normalized autoregressive coefficient in the 11 × 11 neighborhood around the point x,y, and ε is white noise. Dx,y refers to unordered image, and μ represents the disorder adjustment factor, with a value of 1.125.After obtaining the JND threshold component obtained from the disordered concealment effect, the NAMM is used to combineJNDp and JNDd to form the final hybrid JND threshold model:(7)JNDx,y=JNDpx,y+JNDdx,y−α⋅minJNDpx,y,JNDdx,y,where JNDp and JNDd denote JND threshold for unordered image and ordered image. The hybrid JND threshold model further considers the complexity of the visual pattern and the disordered concealment effect on the basis of CA and LA. It makes up for the shortcomings of traditional models that cannot effectively estimate the ordered texture and random texture of the image. Therefore, the JND threshold of the image region is utilized as an effective measure of visual distortion sensitivity.


### 3.2. The Proposed Method

This paper proposes a fast CU decision method based on JND and deep learning to reduce the coding complexity introduced by the MTT splitting structure. First, the hybrid JND threshold models are designed by a perceptual JND threshold model and a JND threshold based on the disordered concealment effect, which can divide the CUs into smooth, normal, and complex area. Then, the US-SVM classifiers are utilized to decide the best splitting mode for CUs in the complex area.Specifically, the CU splitting in VVC is regarded as a six-class classification problem (class 1: nonsplit, class 2: QT, class 3: BT_H, class 4: BT_V, class 5: TT_H, class 6: TT_V), and the number of the training US-SVM classifiers is five. To train first US-SVM classifierSVM1, class 1 is utilized as positive training samples, and classes 2, 3, 4, 5, and 6 of training samples are used as negative training samples. By analogy, the fourth US-SVM takes class 4 as the positive sample, and classes 5 and 6 are used as the negative training samples. In order to train the fifth US-SVM classifier SVM5, class 5 and class 6 are used as the positive samples and the negative samples, respectively. Therefore, only K−1 US-SVMs need to be trained, thereby eliminating regions belonging to multiple categories in the decision and reducing the total number of training samples accordingly. Finally, the proposed method can reduce the coding time. Figure 4 illustrates the overall flowchart of the proposed method.Figure 4
The overall flowchart of the proposed method.


#### 3.2.1. The Region Classification-Based JND

According to the above analysis, the larger JND value is, the richer the regional texture information is; that is, it has higher complexity and stronger spatial masking effect. Consequently, HVS is not sensitive to noise and distortion in these areas. On the contrary, if JND value is smaller, it demonstrates that these areas are relatively flat and regular, and the organization of image elements tends to be orderly. At this time, HVS is more sensitive to noise and distortion in these areas because of the weaker visual masking effect. Thus, the JND threshold of image is used as an effective measure of visual distortion sensitivity.It is noticed from Figure5(b) that the higher grayscale values appear in areas with higher complexity, such as grass and other areas with more complex textures. These areas generally have higher JND threshold, the visual masking effect is more significant, and the encoding distortion will not be easily noticed by the human eye. Therefore, a smaller bitrate is allocated to obtain the same visual quality as the original one in the coding process. On the contrary, these areas with low gray values generally have a lower JND threshold, such as flat and smooth background areas. Since HVS is more sensitive to coding distortions in these areas, more bitrates need to be allocated in the encoding process to ensure that the visual quality will not be significantly affected. Figure 5 shows the original image and corresponding JND threshold distribution map.Figure 5
The original image JND threshold map (left: RaceHorses, right: Johnny). (a) Input image. (b) JND threshold map.
(a)(b)This paper designs fast CU splitting method based on JND and deep learning to reduce the coding time, which can reduce complexity. Specifically, the JND threshold mode is utilized to divide each CU into smooth, ordinary, or complex area,(8)JND≤S,smooth regionS<JND<C,ordinary regionJND>C,complex region,where S and C denote content weight factor, which are set to 0.15 and 0.30 based on extensive experiments, respectively.


#### 3.2.2. The Proposed US-SVM Classifier

Many multiclass related methods have been proposed, which have some shortcomings. Recently, it is noted that the US-SVM classifier shows good characteristics in practical applications.For K-class (K>2) classification problem, the number of the US-SVMs classifiers is K−1. To train the first US-SVM SVM1, class 1 sample is used as the positive training sample, and class 2, 3, … , K training samples are used as negative training samples. To train SVMi, class i samples are used as the positive training samples in the i−th US-SVM, and class i+1, i+2, … , K training samples are used as the negative training sample. Until class K−1 is taken as a positive sample in K−1 US-SVM, and class K sample is used as a negative sample to train SVMK−1. Finally, these US-SVM classifiers are utilized to decide CU partition mode. Specifically, the proposed method for VVC needs five US-SVM classifiers. To train first US-SVM classifier SVM1, class 1 is used as positive training samples, and classes 2, 3, 4, 5, and 6 of training samples are used as negative training samples. By analogy, the fifth US-SVM SVM5 utilizes class 5 as the positive samples, and class 6 is utilized as the negative samples. Therefore, the proposed method can eliminate regions belonging to multiple categories in the decision and reduce the total number of training samples accordingly.Specifically, theSVM1 is used as the root node of the binary tree, and the test samples belonging to the first class are determined. The samples that do not belong to the first class are classified by SVM2, and SVM5 determines the fifth class sample. Figure 6 shows the classification based on the binary tree. Specifically, since the MTT structure is introduced in VVC, the CU splitting problem is considered a six-class classification problem. Therefore, five US-SVM classifiers are trained in this paper.Figure 6
Classification based on binary tree.


#### 3.2.3. The US-SVM Classifier Training

The US-SVM classifier model is tested utilizing the UHD test sequence. Table1 shows the training and testing sequences. To decrease the complexity, the offline mode is utilized in the US-SVM classifier. The F-score features selecting method chooses the features of video sequences, where these features have high correlation with CU splitting. The F-score value is expressed as(9)Fi=x¯i+−x¯i2+x¯i−−x¯i21/n+−1∑l=1n+xl,i+−x¯i+2+1/n−−1∑l=1nxl,i−−x¯i−2,where x¯i is the average value of the i−th feature in the entire sample set, n+ is the quantity of samples in the positive class, n− is the quantity of samples in the negative class, x¯i+ is the average value of the i−th feature in the positive sample set, x¯i− is the average value of the i−th feature in the negative sample set, x¯l,i+ is the eigenvalues of the i−th feature of the l−th positive sample point, and x¯l,i− is the eigenvalues of the i−th feature of the l−th negative sample point. In order to balance the accuracy and the complexity in training US-SVM, three effective features are selected to train US-SVM through the F-score feature selection method in this paper.Table 1
The training and testing video sequences.
SequencesfpsATraffic50TrainingPeopleOnStreet50BBQTerrace50Cactus30CBQMall50BasketballDrill60DBlowingBubbles50RaceHorses304KBosphorus120TestingRushHour30APeopleOnStreet30Nebuta50BBQTerrace60ParkScene60CRaceHorsesC30PartyScene60DBasketballPass60BQSquare50EJohnny60FourPeople60The US-SVM classifiers use offline training mode. Then, the trained US-SVM classifiers are embedded in VTM10.0 to classify CU. And the classification accuracy of the US-SVM classifier is about 95.6%. Therefore, the proposed method can early predict the best CU partition mode to reduce the coding complexity with negligible BD loss.


## 3.1. Hybrid JND Model

The JND model is usually utilized to depict the minimum perceptible distortion threshold of HVS, and it is an effective measure of visual redundancy of video images. Generally, the following three visual factors are mainly considered when modeling the JND threshold, including luminance adaptation, that is, the masking of HVS due to changes in background brightness; CM, that is, the masking of HVS due to spatial inhomogeneity; and contrast sensitivity function, that is, the masking of HVS due to frequency changes. On the basis of related literature, comprehensive consideration of visual factors such as spatial masking effect based on visual pattern complexity and CM, luminance adaptation, and disordered concealment effect based on the principle of free energy, a hybrid JND threshold model is designed to better describe the visual distortion sensitivity of the image area.It has been pointed out in the literature that the HVS tends to extract repeated visual content for analysis and comprehension, and it will also encode corresponding visual patterns for the content forecast as an important feature of image scene content [28]. In the regular pattern, the image scene provides a simple and intuitive element organization and arrangement mode, and its visual interaction with the human eye is relatively direct; the visual masking effect is weak at this time. In the irregular pattern, the corresponding arrangement mode and the visual interaction of the human eye are relatively complicated, and a strong visual masking effect is involved at this time [29]. It can be seen that the effective measure of the visual masking effect is the complexity of the visual pattern. Figure 2 shows an example of pattern complexity.Figure 2
Example of pattern complexity (left: regular pattern, right: irregular pattern). (a) Input image. (b) Pattern complexity map.
(a)(b)In the primary visual cortex, HVS shows obvious direction selectivity and the extracted direction information will be used to represent the image structure. Therefore, the direction information drawn from the image content is utilized to describe the complexity of the image mode. Studies have shown that HVS has obvious directional selectivity in the primary visual cortex. The extracted direction information will be used to represent the image structure and can describe the complexity of the image mode. Generally speaking, the complex mode usually contains a richer directional distribution, while the simple mode only contains a limited single directional distribution. Accordingly, the distribution of the gradient direction in the local image area [30] is used to indicate the corresponding visual pattern complexity (PC):(1)PCx,y=∑k=1NHkx,y0,where N refers to the quantized value range, H is the distribution histogram in the 5×5 neighborhood around x,y, and ⋅0 denotes the L0 norm that is mainly used to measure the number of nonzero elements in a vector.According to the above content, the complexity of the visual pattern of the image area can be used as an effective measure of the visual masking effect. Therefore, the combined CM effect can be used to better describe the degree of visual masking in space. Here, the spatial perception factor based on CM is used as a supplement to the complexity of the abovementioned visual mode:(2)CMx,y=Gradhx,y2+Gradvx,y2,where Gradhx,y is the gradient value of the point x,y in the horizontal direction and Gradvx,y is the gradient value of the point x,y in the vertical directions. Generally speaking, the above two kinds of masking characteristics show different masking effects in different image scenes and have certain complementarity. For example, the contrast masking may play a major role in relatively regular edge areas; the pattern masking may become the main factor in irregular areas. Consequently, the maximum value of the two masking components in different situations is utilized as the final measurement result of the spatial visual masking (VM):(3)VMx,y=maxPCx,y,CMx,y,In addition, HVS usually also shows different visual sensitivity to different background brightness, which is called Luminance Adaptation (LA). The visibility thresholds are different under different brightness backgrounds. Specifically, when the background brightness is lower than 127, the visibility threshold changes as a power function with the increase of the background brightness; when the background brightness exceeds 127, the visibility threshold changes linearly with the increase of the background brightness. The visibility threshold generated by the luminance adaptation is modeled as a piecewise function based on the background brightness:(4)LAx,y=1−Bx,y127×17,Bx,y≤127Bx,y−127×3128+3,Bx,y>127,where Bx,y refers to the brightness of background area of the image; it can be calculated by the average brightness of the pixels in the 5 × 5 neighborhood around the point x,y, as shown in Figure 3.Figure 3
Low-pass filter.After obtaining the VM and LA and other visual characteristic components, the nonlinear additivity model for masking (NAMM) is utilized to combine these visual characteristic components to form a perceptual JND threshold model:(5)JNDpx,y=LAx,y+VMx,y−α⋅minLAx,y,VMx,y,where α represents the gain loss parameter caused by overlap between these visual characteristic components, which is 0.3.HVS can accurately forecast ordered visual stimuli relatively easily based on the free energy principle and will do further analysis and understanding. However, it is difficult to accurately predict disordered information that is complex, chaotic, and uncertain. HVS usually ignores the detailed information and only extracts its main outline structure. For example, straight lines or stripes in a uniform background generally have strong certainty, so HVS can easily detect any changes on the straight line. However, there is greater uncertainty in the changes of image elements in disorderly grass and other similar scenes. At this time, HVS usually automatically ignores the details in the disordered image, so the human eye will not easily perceive the detailed grass. Therefore, another important factor that decides the JND threshold is the disordered concealment effect.It can be seen from the above analysis that the content changes of ordered images are regular and predictable, while it is sudden and unpredictable in disordered images. Thus, the disordered image denotes the uncertainty part of the original image. If sample value of the disordered image is large, it means that the corresponding original information has a high degree of uncertainty and can hide more noise and distortion. The existing pixel domain-based JND threshold estimation model performs well and estimates more accurately in ordered areas, such as flat, edge, and ordered texture areas, but underestimates JND threshold of disordered areas, such as disordered texture area. Therefore, in response to this shortcoming, the JND threshold based on the disordered concealment effect is calculated which is similar to [31](6)JNDdx,y=μ×fx,y−f′x,y=μ⋅Dx,y,f′x,y=∑kck⋅fxk,yk+ε,where fx,y denotes the original image of video, f′x,y represents order information in the input image, ck denotes the k-th normalized autoregressive coefficient in the 11 × 11 neighborhood around the point x,y, and ε is white noise. Dx,y refers to unordered image, and μ represents the disorder adjustment factor, with a value of 1.125.After obtaining the JND threshold component obtained from the disordered concealment effect, the NAMM is used to combineJNDp and JNDd to form the final hybrid JND threshold model:(7)JNDx,y=JNDpx,y+JNDdx,y−α⋅minJNDpx,y,JNDdx,y,where JNDp and JNDd denote JND threshold for unordered image and ordered image. The hybrid JND threshold model further considers the complexity of the visual pattern and the disordered concealment effect on the basis of CA and LA. It makes up for the shortcomings of traditional models that cannot effectively estimate the ordered texture and random texture of the image. Therefore, the JND threshold of the image region is utilized as an effective measure of visual distortion sensitivity.


## 3.2. The Proposed Method

This paper proposes a fast CU decision method based on JND and deep learning to reduce the coding complexity introduced by the MTT splitting structure. First, the hybrid JND threshold models are designed by a perceptual JND threshold model and a JND threshold based on the disordered concealment effect, which can divide the CUs into smooth, normal, and complex area. Then, the US-SVM classifiers are utilized to decide the best splitting mode for CUs in the complex area.Specifically, the CU splitting in VVC is regarded as a six-class classification problem (class 1: nonsplit, class 2: QT, class 3: BT_H, class 4: BT_V, class 5: TT_H, class 6: TT_V), and the number of the training US-SVM classifiers is five. To train first US-SVM classifierSVM1, class 1 is utilized as positive training samples, and classes 2, 3, 4, 5, and 6 of training samples are used as negative training samples. By analogy, the fourth US-SVM takes class 4 as the positive sample, and classes 5 and 6 are used as the negative training samples. In order to train the fifth US-SVM classifier SVM5, class 5 and class 6 are used as the positive samples and the negative samples, respectively. Therefore, only K−1 US-SVMs need to be trained, thereby eliminating regions belonging to multiple categories in the decision and reducing the total number of training samples accordingly. Finally, the proposed method can reduce the coding time. Figure 4 illustrates the overall flowchart of the proposed method.Figure 4
The overall flowchart of the proposed method.


### 3.2.1. The Region Classification-Based JND

According to the above analysis, the larger JND value is, the richer the regional texture information is; that is, it has higher complexity and stronger spatial masking effect. Consequently, HVS is not sensitive to noise and distortion in these areas. On the contrary, if JND value is smaller, it demonstrates that these areas are relatively flat and regular, and the organization of image elements tends to be orderly. At this time, HVS is more sensitive to noise and distortion in these areas because of the weaker visual masking effect. Thus, the JND threshold of image is used as an effective measure of visual distortion sensitivity.It is noticed from Figure5(b) that the higher grayscale values appear in areas with higher complexity, such as grass and other areas with more complex textures. These areas generally have higher JND threshold, the visual masking effect is more significant, and the encoding distortion will not be easily noticed by the human eye. Therefore, a smaller bitrate is allocated to obtain the same visual quality as the original one in the coding process. On the contrary, these areas with low gray values generally have a lower JND threshold, such as flat and smooth background areas. Since HVS is more sensitive to coding distortions in these areas, more bitrates need to be allocated in the encoding process to ensure that the visual quality will not be significantly affected. Figure 5 shows the original image and corresponding JND threshold distribution map.Figure 5
The original image JND threshold map (left: RaceHorses, right: Johnny). (a) Input image. (b) JND threshold map.
(a)(b)This paper designs fast CU splitting method based on JND and deep learning to reduce the coding time, which can reduce complexity. Specifically, the JND threshold mode is utilized to divide each CU into smooth, ordinary, or complex area,(8)JND≤S,smooth regionS<JND<C,ordinary regionJND>C,complex region,where S and C denote content weight factor, which are set to 0.15 and 0.30 based on extensive experiments, respectively.


### 3.2.2. The Proposed US-SVM Classifier

Many multiclass related methods have been proposed, which have some shortcomings. Recently, it is noted that the US-SVM classifier shows good characteristics in practical applications.For K-class (K>2) classification problem, the number of the US-SVMs classifiers is K−1. To train the first US-SVM SVM1, class 1 sample is used as the positive training sample, and class 2, 3, … , K training samples are used as negative training samples. To train SVMi, class i samples are used as the positive training samples in the i−th US-SVM, and class i+1, i+2, … , K training samples are used as the negative training sample. Until class K−1 is taken as a positive sample in K−1 US-SVM, and class K sample is used as a negative sample to train SVMK−1. Finally, these US-SVM classifiers are utilized to decide CU partition mode. Specifically, the proposed method for VVC needs five US-SVM classifiers. To train first US-SVM classifier SVM1, class 1 is used as positive training samples, and classes 2, 3, 4, 5, and 6 of training samples are used as negative training samples. By analogy, the fifth US-SVM SVM5 utilizes class 5 as the positive samples, and class 6 is utilized as the negative samples. Therefore, the proposed method can eliminate regions belonging to multiple categories in the decision and reduce the total number of training samples accordingly.Specifically, theSVM1 is used as the root node of the binary tree, and the test samples belonging to the first class are determined. The samples that do not belong to the first class are classified by SVM2, and SVM5 determines the fifth class sample. Figure 6 shows the classification based on the binary tree. Specifically, since the MTT structure is introduced in VVC, the CU splitting problem is considered a six-class classification problem. Therefore, five US-SVM classifiers are trained in this paper.Figure 6
Classification based on binary tree.


### 3.2.3. The US-SVM Classifier Training

The US-SVM classifier model is tested utilizing the UHD test sequence. Table1 shows the training and testing sequences. To decrease the complexity, the offline mode is utilized in the US-SVM classifier. The F-score features selecting method chooses the features of video sequences, where these features have high correlation with CU splitting. The F-score value is expressed as(9)Fi=x¯i+−x¯i2+x¯i−−x¯i21/n+−1∑l=1n+xl,i+−x¯i+2+1/n−−1∑l=1nxl,i−−x¯i−2,where x¯i is the average value of the i−th feature in the entire sample set, n+ is the quantity of samples in the positive class, n− is the quantity of samples in the negative class, x¯i+ is the average value of the i−th feature in the positive sample set, x¯i− is the average value of the i−th feature in the negative sample set, x¯l,i+ is the eigenvalues of the i−th feature of the l−th positive sample point, and x¯l,i− is the eigenvalues of the i−th feature of the l−th negative sample point. In order to balance the accuracy and the complexity in training US-SVM, three effective features are selected to train US-SVM through the F-score feature selection method in this paper.Table 1
The training and testing video sequences.
SequencesfpsATraffic50TrainingPeopleOnStreet50BBQTerrace50Cactus30CBQMall50BasketballDrill60DBlowingBubbles50RaceHorses304KBosphorus120TestingRushHour30APeopleOnStreet30Nebuta50BBQTerrace60ParkScene60CRaceHorsesC30PartyScene60DBasketballPass60BQSquare50EJohnny60FourPeople60The US-SVM classifiers use offline training mode. Then, the trained US-SVM classifiers are embedded in VTM10.0 to classify CU. And the classification accuracy of the US-SVM classifier is about 95.6%. Therefore, the proposed method can early predict the best CU partition mode to reduce the coding complexity with negligible BD loss.


## 3.2.1. The Region Classification-Based JND

According to the above analysis, the larger JND value is, the richer the regional texture information is; that is, it has higher complexity and stronger spatial masking effect. Consequently, HVS is not sensitive to noise and distortion in these areas. On the contrary, if JND value is smaller, it demonstrates that these areas are relatively flat and regular, and the organization of image elements tends to be orderly. At this time, HVS is more sensitive to noise and distortion in these areas because of the weaker visual masking effect. Thus, the JND threshold of image is used as an effective measure of visual distortion sensitivity.It is noticed from Figure5(b) that the higher grayscale values appear in areas with higher complexity, such as grass and other areas with more complex textures. These areas generally have higher JND threshold, the visual masking effect is more significant, and the encoding distortion will not be easily noticed by the human eye. Therefore, a smaller bitrate is allocated to obtain the same visual quality as the original one in the coding process. On the contrary, these areas with low gray values generally have a lower JND threshold, such as flat and smooth background areas. Since HVS is more sensitive to coding distortions in these areas, more bitrates need to be allocated in the encoding process to ensure that the visual quality will not be significantly affected. Figure 5 shows the original image and corresponding JND threshold distribution map.Figure 5
The original image JND threshold map (left: RaceHorses, right: Johnny). (a) Input image. (b) JND threshold map.
(a)(b)This paper designs fast CU splitting method based on JND and deep learning to reduce the coding time, which can reduce complexity. Specifically, the JND threshold mode is utilized to divide each CU into smooth, ordinary, or complex area,(8)JND≤S,smooth regionS<JND<C,ordinary regionJND>C,complex region,where S and C denote content weight factor, which are set to 0.15 and 0.30 based on extensive experiments, respectively.


## 3.2.2. The Proposed US-SVM Classifier

Many multiclass related methods have been proposed, which have some shortcomings. Recently, it is noted that the US-SVM classifier shows good characteristics in practical applications.For K-class (K>2) classification problem, the number of the US-SVMs classifiers is K−1. To train the first US-SVM SVM1, class 1 sample is used as the positive training sample, and class 2, 3, … , K training samples are used as negative training samples. To train SVMi, class i samples are used as the positive training samples in the i−th US-SVM, and class i+1, i+2, … , K training samples are used as the negative training sample. Until class K−1 is taken as a positive sample in K−1 US-SVM, and class K sample is used as a negative sample to train SVMK−1. Finally, these US-SVM classifiers are utilized to decide CU partition mode. Specifically, the proposed method for VVC needs five US-SVM classifiers. To train first US-SVM classifier SVM1, class 1 is used as positive training samples, and classes 2, 3, 4, 5, and 6 of training samples are used as negative training samples. By analogy, the fifth US-SVM SVM5 utilizes class 5 as the positive samples, and class 6 is utilized as the negative samples. Therefore, the proposed method can eliminate regions belonging to multiple categories in the decision and reduce the total number of training samples accordingly.Specifically, theSVM1 is used as the root node of the binary tree, and the test samples belonging to the first class are determined. The samples that do not belong to the first class are classified by SVM2, and SVM5 determines the fifth class sample. Figure 6 shows the classification based on the binary tree. Specifically, since the MTT structure is introduced in VVC, the CU splitting problem is considered a six-class classification problem. Therefore, five US-SVM classifiers are trained in this paper.Figure 6
Classification based on binary tree.


## 3.2.3. The US-SVM Classifier Training

The US-SVM classifier model is tested utilizing the UHD test sequence. Table1 shows the training and testing sequences. To decrease the complexity, the offline mode is utilized in the US-SVM classifier. The F-score features selecting method chooses the features of video sequences, where these features have high correlation with CU splitting. The F-score value is expressed as(9)Fi=x¯i+−x¯i2+x¯i−−x¯i21/n+−1∑l=1n+xl,i+−x¯i+2+1/n−−1∑l=1nxl,i−−x¯i−2,where x¯i is the average value of the i−th feature in the entire sample set, n+ is the quantity of samples in the positive class, n− is the quantity of samples in the negative class, x¯i+ is the average value of the i−th feature in the positive sample set, x¯i− is the average value of the i−th feature in the negative sample set, x¯l,i+ is the eigenvalues of the i−th feature of the l−th positive sample point, and x¯l,i− is the eigenvalues of the i−th feature of the l−th negative sample point. In order to balance the accuracy and the complexity in training US-SVM, three effective features are selected to train US-SVM through the F-score feature selection method in this paper.Table 1
The training and testing video sequences.
SequencesfpsATraffic50TrainingPeopleOnStreet50BBQTerrace50Cactus30CBQMall50BasketballDrill60DBlowingBubbles50RaceHorses304KBosphorus120TestingRushHour30APeopleOnStreet30Nebuta50BBQTerrace60ParkScene60CRaceHorsesC30PartyScene60DBasketballPass60BQSquare50EJohnny60FourPeople60The US-SVM classifiers use offline training mode. Then, the trained US-SVM classifiers are embedded in VTM10.0 to classify CU. And the classification accuracy of the US-SVM classifier is about 95.6%. Therefore, the proposed method can early predict the best CU partition mode to reduce the coding complexity with negligible BD loss.


## 4. Experimental Results and Analysis

The experimental test is implemented on VTM 10.0 under “all-intra” configuration to evaluate the performance of the proposed method. The test set consists of the common test conditions (CTC) [32] sequence specified by JVET, which contains a wide range of resolutions, textures, bit depths, and motion. The Bjontegaard Delta Bitrate (BDBR) is utilized to measure the results of the proposed method [33] and average coding time saving (ACTS), where BDBR reflects the overall encoding quality and TS is used to measure the coding time saving, which is defined as (10)ACTS=TVTM10.0−TproposedTVTM10.0×100%,where TVTM10.0 represents the coding runtime saving of anchor method that is VTM 10.0 in the proposed method and Tproposed is the ACTS of the proposed method. Since the different platforms are different in performance, this time does not count the time spent by the neural network.Table2 shows the results of the proposed method, where the sequences in Table 1 can be used since the training and testing video sequences are different for the training model. We can see that the coding runtime saving of the proposed method is about 52.35%, and the BDBR is increased by 0.99%.Table 2
The results of the proposed method.
SequencesProposed method(%)BDBRACTSClass A2560 × 1600PeopleOnStreet0.9652.13Traffic0.9750.04Nebuta0.9955.27Class B1920 × 1080Kimono1.3451.34ParkScene0.9554.31BQTerrace1.2251.51Class C832 × 480PartyScene0.9552.43RaceHorsesC0.9650.25BasketballDrill0.8952.42Class D416 × 240BlowingBubbles0.9551.31RaceHorses0.8647.25BQSquare0.8753.15Class E1280 × 720Johnny0.8855.33FourPeople0.7858.45KristenAndSara1.2150.12Average0.9952.35Figure7 illustrates the RD of VTM10.0 and the proposed method for two typical test videos including “FourPeople” and “Kimono”. Compared with VTM 10.0, the proposed method has almost consistent RD performance with VTM 10.0.Figure 7
The RD for the proposed method and VTM 10.0. (a) The RD of “FourPeople”. (b) The RD of “Kimono”.
(a)(b)To evaluate the performance of the proposed method, the proposed method is compared with the existing fast methods, comprising CTDM [6], FBDA [7], FIVG [13], and ACSD [14]. Tables 3 and 4 show the results of the proposed method and the existing fast methods in VVC. Table 3 demonstrates that the average BDBR of CTMD, FBDA, FIVG, and ACSD method increased to 1.06%, 1.38%, 1.38%, and 0.99%, respectively, while the average BDBR of the proposed method is only 0.99%. From Table 4, we can see that the proposed method can save more encoding time compared with CTMD, FBDA, FIVG, and ACSD methods. From Table 4, the encoding runtime savings of the CTMD, FBDA, FIVG, and ACSD are 34.32%, 29.49%, 52.16%, and 33.21%, which are less than that of the proposed method.Table 3
The BDBR of the proposed method and the latest methods.
SequencesProposedCTDM [6]FBDA [7]FIVG [13]ACSD [14]BDBR (%)BDBR (%)BDBR (%)BDBR (%)BDBR (%)Class B1920 × 1080Kimono1.341.051.981.720.87ParkScene0.951.111.381.280.83BQTerrace1.221.001.191.160.95Class C832 × 480PartyScene0.950.761.050.280.55RaceHorsesC0.960.822.960.840.37BasketballDrill0.891.671.361.911.30Class D416 × 240BlowingBubbles0.950.740.730.490.95RaceHorses0.860.951.590.540.71BQSquare0.870.61−0.110.170.68Class E1280 × 720Johnny0.881.441.513.071.72FourPeople0.781.381.372.551.35KristenAndSara1.211.191.532.561.61Average0.991.061.381.380.99Table 4
The ACTS of the proposed method and the existing methods.
SequencesProposedCTDM [6]FBDA [7]FIVG [13]ACSD [14]ACTS (%)ACTS (%)ACTS (%)ACTS (%)ACTS (%)Class B 1920 × 1080Kimono51.3434.3341.8266.5932.32ParkScene54.3134.5631.6056.2835.41BQTerrace51.5131.0729.4749.4434.50Class C 832 × 480PartyScene52.4335.9335.2341.7131.10RaceHorsesC50.2536.0633.8952.0723.63BasketballDrill52.4233.9428.7353.0533.39Class D 416 × 240BlowingBubbles51.3135.0421.8743.9033.90RaceHorses47.2535.9631.8344.9331.79BQSquare53.1533.9823.0032.3430.73Class E 1280 × 720Johnny55.3333.0224.4462.5538.85FourPeople58.4535.0526.6562.1838.01KristenAndSara50.1232.9525.3260.8234.84Average53.3234.3229.4952.1633.21To see the performance advantages of the proposed method compared with the latest methods more intuitively, Figures8 and 9 show the ACTS and BDBR increase of the proposed method and the existing fast methods in VVC. Figure 8 shows that the encoding runtime of the proposed method can reduce about 0.16–23.83% compared with CTMD, FBDA, FIVG, and ACSD method. Moreover, compared with CTMD, FBDA, and FIVG method, the proposed method can reduce BDBR about 0.07–0.39%. It is noticed that the proposed method increases the coding runtime saving and outperforms the coding performance of the existing fast methods.Figure 8
Coding time saving.Figure 9
BDBR increase.


## 5. Conclusion

A fast CU decision method is introduced based on JND and the US-SVM classifiers in this paper to settle the huge complexity caused by the asymmetric splitting problem. The hybrid JND model is used to determine which region the CUs belong to. Then, the US-SVM classifiers are utilized to split CU in advance to reduce coding time. Experimental results demonstrate that the proposed method can significantly save about 52.35% coding runtime, with only 0.99% BDBR. The results may fluctuate for different videos with different resolutions, because the resolutions of the videos may have a little impact on the experimental results, where the ACTS is particularly high for the sequence such as “FourPeople” (58.45%). Moreover, the proposed method exceeds the existing fast methods and can keep the coding efficiency. We will continue searching for fast methods to reduce encoding time while maintaining encoding quality.



---

*Source: 3813116-2021-12-08.xml*