WO2022104498A1

WO2022104498A1 - Intra-frame prediction method, encoder, decoder and computer storage medium

Info

Publication number: WO2022104498A1
Application number: PCT/CN2020/129266
Authority: WO
Inventors: 袁锜超
Original assignee: Oppo广东移动通信有限公司
Priority date: 2020-11-17
Filing date: 2020-11-17
Publication date: 2022-05-27
Also published as: CN114830651A

Abstract

Disclosed are an intra-frame prediction method, an encoder, a decoder and a computer storage medium. The method comprises: determining a prediction mode parameter of a current block; when the prediction mode parameter indicates that an irrectangular block copy (INBC) mode is used, determining first target block vector information of a first partition of the current block and second target block vector information of a second partition of the current block; determining a first prediction value of the first partition according to the first target block vector information, and determining a second prediction value of the second partition according to the second target block vector information; determining a first weight value of the first partition and a second weight value of the second partition; and performing weighted fusion by using the first prediction value, the first weight value, the second prediction value and the second weight value, and determining an intra-frame prediction value of the current block. In this way, when an INBC mode is used to determine an intra-frame prediction value of a current block, the encoding and decoding efficiency of a video sequence can be improved.

Description

Intra prediction method, encoder, decoder, and computer storage medium

technical field

The embodiments of the present application relate to the technical field of encoding and decoding, and in particular, to an intra-frame prediction method, an encoder, a decoder, and a computer storage medium.

Background technique

With the rapid development of science and technology, people have higher and higher requirements for video viewing and processing, especially the increasing demand for screen content video (SCV). Among them, in view of the characteristics of high contrast, limited color data and many repeated areas of screen content, an extended coding standard-Screen Content Coding (SCC) has been proposed.

In the related art, the Intra Block Copy (IBC) technology can be used to predict repeated/cyclic local image features and be applied to screen content coding, but it copies the entire reference block without considering The boundary information of some local image features limits the coding efficiency of IBC technology and its application in ordinary sequences; while for Angular Weighted Prediction (AWP) technology, it is applied to process boundary information in inter-frame images, However, it is not applied to the processing of intra-frame blocks, so that intra-frame images cannot have the same tools for processing edge information as inter-frame images, which reduces the encoding and decoding efficiency of video sequences.

SUMMARY OF THE INVENTION

Embodiments of the present application provide an intra-frame prediction method, an encoder, a decoder, and a computer storage medium, which can improve the encoding and decoding efficiency of video sequences.

The technical solutions of the embodiments of the present application can be implemented as follows:

In a first aspect, an embodiment of the present application provides an intra-frame prediction method, which is applied to an encoder, and the method includes:

determine the prediction mode parameter of the current block;

When the prediction mode parameter indicates that the non-rectangular block copy INBC mode is used, determining the first target block vector information of the first partition of the current block and the second target block vector information of the second partition of the current block;

determining a first predictor of the first partition according to the first target block vector information, and determining a second predictor of the second partition according to the second target block vector information;

determining a first weight value of the first partition and a second weight value of the second partition;

Weighted fusion is performed using the first predicted value, the first weighted value, the second predicted value and the second weighted value to determine the intra-frame predicted value of the current block.

In a second aspect, an embodiment of the present application provides an intra-frame prediction method, which is applied to a decoder, and the method includes:

Parse the code stream to obtain the prediction mode parameters of the current block;

When the prediction mode parameter indicates that the INBC mode is used, the code stream is parsed, and the first block vector index number and the second block vector index number are obtained;

Based on the block vector candidate list, determine the first target block vector information of the first partition of the current block corresponding to the first block vector index number in the block vector candidate list, and the second block vector index number in the block vector candidate list. the second target block vector information of the second partition of the corresponding current block in the block vector candidate list;

In a third aspect, an embodiment of the present application provides an encoder, the encoder includes a first determination unit, a first calculation unit, and a first prediction unit; wherein,

the first determining unit, configured to determine the prediction mode parameter of the current block;

The first determining unit is further configured to, when the prediction mode parameter indicates to use the INBC mode, determine the first target block vector information of the first partition of the current block and the second target block vector information of the second partition of the current block ;

The first calculation unit is configured to determine a first prediction value of the first partition according to the first target block vector information, and determine a second prediction value of the second partition according to the second target block vector information value; and determining a first weight value for the first partition and a second weight value for the second partition;

The first prediction unit is configured to perform weighted fusion by using the first prediction value, the first weight value, the second prediction value and the second weight value to determine the intra prediction of the current block value.

In a fourth aspect, an embodiment of the present application provides an encoder, where the encoder includes a first memory and a first processor; wherein,

a first memory for storing a computer program executable on the first processor;

The first processor is configured to execute the method according to the first aspect when running the computer program.

In a fifth aspect, an embodiment of the present application provides a decoder, the decoder includes a parsing unit, a second determining unit, a second calculating unit, and a second predicting unit; wherein,

The parsing unit is configured to parse the code stream and obtain the prediction mode parameter of the current block; and is also configured to parse the code stream when the prediction mode parameter indicates to use the INBC mode, and obtain the first block vector index number and the second block vector index number;

The second determining unit is configured to determine, based on the block vector candidate list, the first target block vector information of the first partition of the current block corresponding to the first block vector index number in the block vector candidate list, and the the second target block vector information of the second partition of the current block corresponding to the second block vector index number in the block vector candidate list;

The second calculation unit is configured to determine a first prediction value of the first partition according to the first target block vector information, and determine a second prediction value of the second partition according to the second target block vector information value; and determining a first weight value for the first partition and a second weight value for the second partition;

The second prediction unit is configured to perform weighted fusion using the first prediction value, the first weight value, the second prediction value and the second weight value to determine the intra prediction of the current block value.

In a sixth aspect, an embodiment of the present application provides a decoder, the decoder includes a second memory and a second processor; wherein,

a second memory for storing a computer program executable on the second processor;

The second processor is configured to execute the method according to the second aspect when running the computer program.

In a seventh aspect, an embodiment of the present application provides a computer storage medium, where the computer storage medium stores a computer program, and when the computer program is executed by the first processor, the method described in the first aspect is implemented, or the computer program is executed by the second processor. The processor implements the method as described in the second aspect when executed.

The embodiments of the present application provide an intra-frame prediction method, an encoder, a decoder, and a computer storage medium. On the encoder side, a prediction mode parameter of a current block is determined; when the prediction mode parameter indicates to use the INBC mode, determine first target block vector information of the first partition of the current block and second target block vector information of the second partition of the current block; determining a first predicted value of the first partition according to the first target block vector information, and Determine the second prediction value of the second partition according to the second target block vector information; determine the first weight value of the first partition and the second weight value of the second partition; use the first prediction value, the first weight value, the second prediction value and the second weight value are weighted and fused to determine the intra-frame prediction value of the current block. On the decoder side, the prediction mode parameter of the current block is obtained by parsing the code stream; when the prediction mode parameter indicates to use the INBC mode, the code stream is parsed to obtain the vector index number of the first block and the vector index number of the second block; based on A block vector candidate list, determining the first target block vector information of the first partition of the current block corresponding to the first block vector index number in the block vector candidate list, and the second block vector index number in the second target block vector information of the second partition of the corresponding current block in the block vector candidate list; determining the first predicted value of the first partition according to the first target block vector information, and determining the first predicted value of the first partition according to the second target block The vector information determines the second prediction value of the second partition; determines the first weight value of the first partition and the second weight value of the second partition; uses the first prediction value, the first weight The value, the second predicted value and the second weight value are weighted and fused to determine the intra-frame predicted value of the current block. In this way, different angle weights are used in intra prediction to process the boundary information in the image block, which can better handle the edge information of two parts of the same divided block with different texture/color distributions, sharp object edges in the intra image, The junction of the foreground and background and the boundary information of ordinary sequences, etc., make intra-frame images and inter-frame images have a tool for processing edge information, thereby effectively improving the encoding and decoding efficiency of video sequences.

Description of drawings

1 is a schematic diagram of eight angles that can be supported by an angle-weighted prediction mode provided by the related art;

2 is a schematic diagram of a reference weight configuration supported by an angle-weighted prediction mode provided by the related art;

3A is a schematic diagram of angle numbers and corresponding partitions in an angle-weighted prediction mode provided by the related art;

3B is a schematic diagram of angle numbers and corresponding slopes in an angle-weighted prediction mode provided by the related art;

4 is a schematic diagram of a positional relationship between a current block and an adjacent block provided by the related art;

5 is a schematic structural diagram of an applied IBC technology provided by the related art;

6 is a schematic diagram of a local feature with boundary information in a common sequence provided by the related art;

7A is a block diagram of the composition of a video coding system provided by an embodiment of the application;

7B is a block diagram of the composition of a video decoding system provided by an embodiment of the application;

FIG. 8 is a schematic flowchart of an intra-frame prediction method provided by an embodiment of the present application;

9 is a schematic flowchart of another intra prediction method provided by an embodiment of the present application;

10 is a schematic diagram of the composition and structure of an encoder provided by an embodiment of the application;

11 is a schematic diagram of a specific hardware structure of an encoder provided by an embodiment of the application;

12 is a schematic diagram of the composition and structure of a decoder provided by an embodiment of the present application;

FIG. 13 is a schematic diagram of a specific hardware structure of a decoder according to an embodiment of the present application.

Detailed ways

In order to have a more detailed understanding of the features and technical contents of the embodiments of the present application, the implementation of the embodiments of the present application will be described in detail below with reference to the accompanying drawings.

In a video image, a first image component, a second image component, and a third image component are generally used to represent a coding block (Coding Block, CB); wherein, the three image components are a luminance component and a blue chrominance component respectively. and a red chrominance component. Specifically, the luminance component is usually represented by the symbol Y, the blue chrominance component is usually represented by the symbol Cb or U, and the red chrominance component is usually represented by the symbol Cr or V; in this way, the video image can be represented in the YCbCr format or in the YUV format. express.

In this embodiment of the present application, the first image component may be a luminance component, the second image component may be a blue chrominance component, and the third image component may be a red chrominance component, but this is not specifically limited.

At present, with the improvement of people's requirements for video display quality, high-quality video with one or more characteristics of high resolution, high frame rate, high bit depth, high dynamic range, wide color gamut and omnidirectional viewing angle is being processed. When encoding, compared with the H.265/High Efficiency Video Coding (HEVC) standard, the performance of H.266/Versatile Video Coding (VVC) is improved by about 50%. Joint Video Experts Team, JVET) is responsible for this standardization project, and various intra-frame prediction modes and inter-frame prediction modes have been verified to achieve high compression efficiency when encoding high-quality video, so they were adopted in VVC.

In order to capture the finer edge directions presented in the video, the Angular Weighted Prediction (AWP) mode is proposed in the video coding standard. By using the idea of intra-frame angle prediction: the surrounding position of the current block (including the whole pixel) can be set first. position and sub-pixel position), and then use the angle prediction method to obtain the weight value corresponding to each pixel position, and then realize the weighting of two different inter-frame prediction values through the obtained weight value.

Among them, the minimum block size supported by the angle-weighted prediction mode is 8×8, and the maximum block size is 64×64. A total of 8 angles can be supported here. There are five absolute values of the weighted prediction slopes of these 8 angles, which are {horizontal (Horizontal, HOR), Vertical (Vertical, VER), 1, 2, 1/2}, since each angle can support 7 kinds of reference weight configurations, so for each block, the number of modes of the angle-weighted prediction mode is total 56 modes. Referring to FIG. 1, it shows a schematic diagram of eight angles supported by an angle-weighted prediction mode provided by the related art. In Figure 1, the 8 diagonal lines with arrows represent the 8 supported angles.

Referring to FIG. 2, it shows a schematic diagram of a reference weight configuration supported by an angle-weighted prediction mode provided by the related art. In Figure 2, it provides the predicted positions for 7 reference weights. Specifically, the reference weight configuration may be a distribution function of the reference weight value obtained according to the reference weight index value, and the non-strictly monotonically increasing function assignment is performed with the position of the 8-point dividing point of the effective length of the reference weight as the reference point. Here, the effective length of the reference weight is It can be calculated from the prediction angle and the current block size.

It should be understood that the eight angles shown in FIG. 1 can be divided into 4 partitions, as shown in FIG. 3A , which shows a schematic diagram of angle numbers and corresponding partitions in an angle weighted prediction mode provided by the related art. In FIG. 3A , the angle partition 0 is filled with left oblique lines, which includes two angles, angle 0 and angle 1; the angle partition 1 is filled with grid oblique lines, which includes angle 2 and angle 3. Two kinds of angles; the one filled with dots is angle partition 2, which includes two angles of angle 4 and angle 5; the one filled with right slash is angle partition 3, which includes two angles of angle 6 and angle 7. As shown in FIG. 3B , it shows a schematic diagram of angle numbers and corresponding slopes in an angle-weighted prediction mode provided by the related art. In FIG. 3B, angle 0 corresponds to a slope of 1, angle 1 corresponds to a slope of 1/2, angle 2 corresponds to a slope of horizontal, angle 3 corresponds to a slope of -1/2, angle 4 corresponds to a slope of -1, and angle 5 corresponds to a slope of is -2, angle 6 corresponds to a slope of vertical, and angle 7 corresponds to a slope of 2.

It should be noted that the formula derived from the pixel-by-pixel weight is slightly different at this time according to the different partition areas where the angle is located. It is assumed that the block size of the current block is M×N, where M is the width, N is the height, X is log2 (the absolute value of the slope of the weight prediction angle), and Y is the weight prediction position.

The following description takes the angle 0 and the angle 1 located in the angle partition 0 as examples. The derivation process of the weight value is as follows:

(a) For the weight value of the luminance component,

First, calculate the effective length of the reference weight, which can be represented by ValidLength, as shown below,

ValidLength=(N+(M＞＞X))＜＜1 (1)

Secondly, set the reference weight value, which is represented by ReferenceWeights[x], where the value range of x is 0～(ValidLength-1). here,

FirstPos=(ValidLength＞＞1)-6+Y×((ValidLength-1)＞＞3) (2)

ReferenceWeights[x]=Clip3(0,8,x-FirstPos) (3)

Again, the luminance weight derived pixel by pixel is represented by SampleWeight[x][y], as follows,

SampleWeight[x][y]＝ReferenceWeights[(y＜＜1)+((x＜＜1)＞＞X)] (4)

(b) For the weight value of the chrominance component,

The chrominance weight can be derived by directly taking the upper left corner position corresponding to the 2×2 luminance weight. Assume that the block size of the current block is M×N, where M is the width and N is the height, then the value range of x is 0～(M /2-1); the value range of y is 0～(N/2-1). The chroma weight derived pixel by pixel is represented by SampleWeightChroma[x][y], as follows,

SampleWedghtChroma[x][y]=SampleWedght[x>>1][y>>1] (5)

Here, ">>" represents the right shift operator, "<<" represents the left shift operator, and Clip3 represents the clamp operator, which clamps x-FirstPos between 0 and 8.

It should also be noted that the motion vector storage scheme of the angle-weighted prediction mode is related to the angle partition. Here, it is assumed that the block size of the current block is M×N, where M is the width, N is the height, X is log2 (the absolute value of the weighted prediction angle slope), and Y is the weighted prediction position. Still taking angle 0 and angle 1 located in angle partition 0 as an example, the motion vector storage scheme is as follows:

First, calculate the effective length of the reference weight, represented by ValidLenth, as shown below,

ValidLength=(N+(M＞＞X))＜＜1 (6)

Secondly, for each 4×4 block in the current block, mark its center position as (x, y), then

FirstPos=(ValidLength>>1)-6+Y×((ValidLength-1)>>3) (7)

Again, it is judged whether (y<<1)+((x<<1)>>X) is greater than or equal to FirstPos. Wherein, if (y<<1)+((x<<1)>>X) is greater than or equal to FirstPos, the first motion information is stored; otherwise, the second motion information is stored. Here, the current block is divided into two partitions (such as the first partition and the second partition) using the angle prediction weighting mode, where the first motion information refers to the motion information corresponding to the first partition, and the second motion information refers to the first partition. The motion information corresponding to the second partition.

In addition, the angle weighted prediction mode needs to have two unidirectional motion vectors for weighted prediction, and the unidirectional motion vector can be selected from the candidate motion vector list according to the index number (index) in the code stream. Referring to FIG. 4 , it shows a schematic diagram of the positional relationship between the current block and the adjacent blocks provided by the related art. As shown in Figure 4, the current block is filled with white, and the adjacent blocks are filled with gray. Here, for the current block, there may be multiple adjacent blocks, for example, represented by A, B, C, D, F, and G.

Based on Figure 4, the process of constructing the candidate motion vector list is as follows,

In the first step, F, G, C, A, and D are adjacent blocks of the current block, and the "availability" of F, G, C, A, D needs to be determined:

i) If F exists and inter prediction mode is employed, F is "available"; otherwise, F is "unavailable".

j) If G exists and inter prediction mode is employed, G is "available"; otherwise, G is "unavailable".

k) If C exists and the inter prediction mode is used, then C is "available"; otherwise, C is "unavailable".

1) If A exists and the inter prediction mode is adopted, then A is "available"; otherwise, A is "unavailable".

n) If D exists and inter prediction mode is employed, D is "available"; otherwise, D is "unavailable".

In the second step, the motion vectors of these adjacent blocks are put into the candidate motion vector list after duplicate checking in the order of F, G, C, A and D. Among them, the weight checking scheme is: G and F weight checking, C and G weight checking, A and F weight checking, D and G and A weight checking. If the number of motion vectors placed in the candidate motion vector list after duplicate checking is greater than 4, only the first four are placed.

The third step is to put the derived temporal bidirectional motion vector into the candidate motion vector list.

In the fourth step, if the number of motion vectors in the candidate motion vector list is less than 5, the first motion vector is scaled in different directions, and then the scaled motion vector is filled into the candidate motion vector list until the candidate motion vector list is reached. The number of motion vectors in is 5.

It can be understood that, according to the characteristics of screen content, for screen content sequences such as text and graphics, there are many repeated textures in the same frame, that is, there is a strong spatial correlation. At this time, if the encoded block in the current frame can be referred to when encoding the current block, the encoding efficiency can be greatly improved. Specifically, in view of the strong spatial correlation of screen images, this technique of referring to the coded block in the current frame and using it for the prediction value of the current block can be called Intra Block Copy (IBC). )technology. Here, IBC is similar to inter-frame prediction, except that the prediction block of IBC is generated by the reconstructed block in the current image frame.

Referring to FIG. 5, it shows a schematic structural diagram of applying the IBC technology provided by the related art. As shown in Figure 5, for the current image frame, that is, a coding tree unit (Coding Tree Unit, CTU), the area filled with dots in the CTU is the search area (that is, the coded area of the current image frame), and the black shaded blocks are respectively The distance between the current coding block (Coding Unit, CU) and the matching prediction block (Block Predictor, also known as the reference block), from the current coding block to the matching reference block, is called Block Vector (BV). Since the current block in the lower right is very similar to the reference block already encoded in the upper left, if the position of the reference block in the upper left is found by searching on the encoder side, only the position between the two blocks needs to be transmitted in the code stream Vector (BV), which is then used by the decoder to obtain accurate predictions. Compared with the common intra-frame prediction mode, the IBC technology can make better use of the redundant information in the frame and improve the coding performance.

However, in the related art, the IBC technology can be used to predict repetitive/cyclic local image features and be applied to screen content coding, but it copies the entire reference block without considering the boundary information of some local image features. As shown in the rectangular box in Figure 6. In addition, currently the IBC technology is only used in screen content coding (Screen Content Coding, SCC), which limits the coding efficiency of the IBC technology and its application in common sequences. However, for AWP technology, it can process boundary information when applied to inter-frame images, but it is not applied to the processing of intra-frame blocks, which makes it impossible to make intra-frame images and inter-frame images have the same tools for processing edge information. Codec efficiency of video sequences.

Based on this, an embodiment of the present application provides an intra-frame prediction method. The basic idea of the method is to: determine the prediction mode parameter of the current block; when the prediction mode parameter indicates to use the INBC mode, determine the first partition of the current block The first target block vector information of the current block and the second target block vector information of the second partition of the current block; determine the first predicted value of the first partition according to the first target block vector information, and according to the second target The block vector information determines the second predicted value of the second partition; determines the first weight value of the first partition and the second weight value of the second partition; uses the first predicted value, the first The weight value, the second prediction value and the second weight value are weighted and fused to determine the intra-frame prediction value of the current block. In this way, different angle weights are used in intra prediction to process the boundary information in the image block, which can better handle the edge information of two parts of the same divided block with different texture/color distributions, sharp object edges in the intra image, The junction of the foreground and background and the boundary information of ordinary sequences, etc., make intra-frame images and inter-frame images have a tool for processing edge information, thereby effectively improving the encoding and decoding efficiency of video sequences.

The embodiments of the present application will be described in detail below with reference to the accompanying drawings.

Referring to FIG. 7A , it shows an example of a composition block diagram of a video coding system provided by an embodiment of the present application. As shown in FIG. 7A , the video coding system 10 includes a transform and quantization unit 101, an intra-frame estimation unit 102, an intra-frame prediction unit 103, a motion compensation unit 104, a motion estimation unit 105, an inverse transform and inverse quantization unit 106, and a filter control unit The analysis unit 107, the filtering unit 108, the encoding unit 109, the decoded image buffering unit 110, etc., wherein the filtering unit 108 can implement deblocking filtering and sample adaptive offset (Sample Adaptive Offset, SAO) filtering, and the encoding unit 109 can implement the header Information coding and context-based adaptive binary arithmetic coding (Context-based Adaptive Binary Arithmatic Coding, CABAC). For the input original video signal, a video coding block can be obtained by dividing the coding tree block (Coding Tree Unit, CTU), and then the residual pixel information obtained after intra-frame or inter-frame prediction is converted and quantized by the quantization unit 101. The video coding block is transformed, including transforming residual information from the pixel domain to the transform domain, and quantizing the resulting transform coefficients to further reduce the bit rate; the intra-frame estimation unit 102 and the intra-frame prediction unit 103 are used for Intra prediction is performed on the video coding block; specifically, the intra prediction unit 102 and the intra prediction unit 103 are used to determine the intra prediction mode to be used to encode the video coding block; the motion compensation unit 104 and the motion estimation unit 105 is used to perform inter-predictive encoding of the received video encoding block relative to one or more blocks in one or more reference frames to provide temporal prediction information; the motion estimation performed by the motion estimation unit 105 is to generate a motion vector. process, the motion vector can estimate the motion of the video coding block, and then the motion compensation unit 104 performs motion compensation based on the motion vector determined by the motion estimation unit 105; after determining the intra prediction mode, the intra prediction unit 103 also uses In order to provide the selected intra prediction data to the encoding unit 109, and the motion estimation unit 105 also sends the calculated motion vector data to the encoding unit 109; in addition, the inverse transform and inverse quantization unit 106 is used for the video encoding. Reconstruction of blocks, reconstructing a residual block in the pixel domain, the reconstructed residual block removes the blocking artifact by the filter control analysis unit 107 and the filtering unit 108, and then adds the reconstructed residual block to the decoded image A predictive block in the frame of the cache unit 110 is used to generate a reconstructed video coding block; the coding unit 109 is used to encode various coding parameters and quantized transform coefficients. In the CABAC-based coding algorithm, the context The content can be based on adjacent coding blocks, and can be used to encode information indicating the determined intra prediction mode, and output the code stream of the video signal; the decoded image buffer unit 110 is used to store the reconstructed video coding blocks for prediction reference. . As the video image coding proceeds, new reconstructed video coding blocks are continuously generated, and these reconstructed video coding blocks are all stored in the decoded image buffer unit 110 .

Referring to FIG. 7B , it shows an example of a block diagram of a video decoding system provided by an embodiment of the present application. As shown in FIG. 7B , the video decoding system 20 includes a decoding unit 201 , an inverse transform and inverse quantization unit 202 , an intra prediction unit 203 , a motion compensation unit 204 , a filtering unit 205 , a decoded image buffer unit 206 , etc., wherein the decoding unit 201 Header decoding and CABAC decoding can be implemented, and the filtering unit 205 can implement deblocking filtering and SAO filtering. After the input video signal is subjected to the encoding process of FIG. 7A, the code stream of the video signal is output; the code stream is input into the video decoding system 20, and firstly passes through the decoding unit 201 to obtain the decoded transform coefficient; Inverse transform and inverse quantization unit 202 processes to generate residual blocks in the pixel domain; intra prediction unit 203 may be used to generate based on the determined intra prediction mode and data from previously decoded blocks of the current frame or picture Prediction data for the current video decoding block; motion compensation unit 204 determines prediction information for the video decoding block by parsing the motion vector and other associated syntax elements, and uses the prediction information to generate predictive information for the video decoding block being decoded block; a decoded video block is formed by summing the residual block from inverse transform and inverse quantization unit 202 and the corresponding predictive block produced by intra prediction unit 203 or motion compensation unit 204; the decoded video signal Video quality may be improved by filtering unit 205 in order to remove blocking artifacts; decoded video blocks are then stored in decoded image buffer unit 206, which stores reference images for subsequent intra prediction or motion compensation , and is also used for the output of the video signal, that is, the restored original video signal is obtained.

It should be noted that the intra-frame prediction method in the embodiment of the present application is mainly applied to the intra-frame prediction unit 103 shown in FIG. 7A and the intra-frame prediction unit 203 shown in FIG. 7B . That is to say, the intra-frame prediction method in the embodiment of the present application can be applied to both a video encoding system and a video decoding system, and can even be applied to a video encoding system and a video decoding system at the same time. There is no specific limitation. It should also be noted that when the intra-frame prediction method is applied to the intra-frame prediction unit 103 shown in FIG. 7A , the “current block” specifically refers to the current coding block in the intra-frame prediction; when the intra-frame prediction method is applied In the intra-frame prediction unit 203 shown in FIG. 7B , the “current block” specifically refers to the current decoding block in the intra-frame prediction.

It should also be noted that, before going into detail, the “first”, “second”, “third”, etc. mentioned throughout the specification are only for distinguishing different features, and do not have a limited priority or sequence. order, size relationship, etc.

In an embodiment of the present application, the intra-frame prediction method provided by the embodiment of the present application is applied to a video encoding device, that is, an encoder. The functions implemented by the method can be implemented by the first processor in the encoder calling a computer program, and of course the computer program can be stored in the first memory. It can be seen that the encoder includes at least a first processor and a first memory.

Based on the application scenario example of FIG. 7A above, see FIG. 8 , which shows a schematic flowchart of an intra-frame prediction method provided by an embodiment of the present application. As shown in Figure 8, the method may include:

S801: Determine the prediction mode parameter of the current block.

It should be noted that a video image may be divided into multiple image blocks, and each image block to be encoded currently may be called a coding block (Coding Block, CB). Here, each encoding block may include a first image component, a second image component, and a third image component; and the current block is the encoding of the first image component, the second image component, or the third image component to be predicted currently in the video image piece.

Wherein, it is assumed that the current block performs the first image component prediction, and the first image component is a luminance component, that is, the image component to be predicted is a luminance component, then the current block may also be called a luminance block; or, it is assumed that the current block performs the second image component prediction prediction, and the second image component is a chrominance component, that is, the image component to be predicted is a chrominance component, then the current block may also be called a chrominance block.

It should also be noted that the prediction mode parameter is used to indicate the prediction mode used by the current block and parameters related to the prediction mode. Generally, for the determination of the prediction mode parameters, the determination can be performed according to the magnitude of the distortion value. In a specific embodiment, the determination may be made according to the cost result of Rate Distortion Optimization (RDO), or the cost result of the sum of absolute error (Sum of Absolute Difference, SAD), or even It is determined according to the cost result of the sum of absolute transformed difference (Sum of Absolute Transformed Difference, SATD); however, the embodiment of the present application does not make any limitation.

In some embodiments, the determining the prediction mode parameter of the current block may include:

Perform precoding on the current block based on multiple candidate prediction modes, and determine precoding results corresponding to the multiple candidate prediction modes;

According to the precoding result, a prediction mode parameter of the current block is determined from the plurality of candidate prediction modes.

In a specific embodiment, the determining the prediction mode parameter of the current block from the multiple candidate prediction modes according to the precoding result may include:

obtaining rate-distortion cost results corresponding to the multiple candidate prediction modes based on the precoding results;

An optimal rate-distortion cost result is selected from the rate-distortion cost results, and a candidate prediction mode corresponding to the optimal rate-distortion cost result is determined as a prediction mode parameter of the current block.

It should be noted that the multiple candidate prediction modes here may refer to intra-frame prediction modes, and by precoding the current block according to the multiple candidate prediction modes, precoding results corresponding to the multiple candidate prediction modes may be determined. The precoding result may be the distortion value corresponding to the candidate prediction mode (or called the encoding mode), the rate-distortion cost result corresponding to the candidate prediction mode, or even other cost results corresponding to the candidate prediction mode, such as SAD Cost result, SATD cost result, etc. Exemplarily, after obtaining the rate-distortion cost results corresponding to the multiple candidate prediction modes according to the precoding results, the optimal rate-distortion cost result may be selected from the rate-distortion cost results, and The candidate prediction mode is determined as the prediction mode parameter of the current block.

It should also be noted that the embodiment of the present application proposes an Intra Non-rectangle Block Copy (INBC) mode, which is a combination of Intra Block Copy (IBC) technology and angle-weighted prediction. (Angular Weighted Prediction, AWP) technology. Among them, the IBC technology can be used to predict repeated/cyclic local image features, and is applied to screen content coding; the AWP technology is applied to process boundary information in inter-frame images. In this way, the purpose of proposing the INBC mode in this embodiment of the present application is to expect that INBC can better handle the edge information of two parts of different texture/color distributions in the same block, the edges of sharp objects in the intra-frame image, the junction between the foreground and the background, and Boundary information, etc., make intra-frame images also have a tool for processing edge information like inter-frame images, thereby effectively improving the encoding and decoding efficiency of video sequences.

That is to say, the various candidate prediction modes here may include the INBC mode and the normal intra mode. Wherein, the common intra-frame mode may include an angle prediction mode, a position-based intra-frame prediction combination (Position Dependent intra Prediction Combination, PDPC) mode, a matrix-based intra-frame prediction (Matrix weighted Intra Prediction, MIP) mode and the like. In this way, the multiple candidate prediction modes may include the INBC mode and the normal intra mode. At this time, the INBC mode will compete with the normal intra mode to determine the prediction mode parameters of the current block.

If the prediction mode parameter indicates that the INBC mode is used, the INBC mode flag is set to the first value;

If the prediction mode parameter indicates that the normal intra mode is used, the INBC mode flag is set to a second value.

It should be noted that when the INBC mode flag is set to the first value, it is determined that the current block uses the INBC mode for intra-frame prediction; when the INBC mode flag is set to the second value, it is determined that the current block uses the normal intra-frame mode for frame prediction intraprediction.

It should also be noted that, in a specific implementation manner, the first value may be 1, and the second value may be 0; or, the first value may be true, and the second value may be false. In another specific implementation manner, the first value may be 0, and the second value may be 1; or, the first value may be false, and the second value may be true.

In this way, taking the first value as 1 and the second value as 0 as an example, in the encoder, if the prediction mode parameter indicates to use the INBC mode, then the INBC mode flag bit can be set to 1, and the INBC mode is used to determine the current block. If the prediction mode parameter indicates that the INBC mode is not used, the INBC mode flag can be set to 0, and the normal intra mode is used to determine the intra prediction value of the current block.

Further, in some embodiments, after determining the INBC mode flag bit, the method may further include:

Write the INBC mode flag into the code stream.

That is to say, the encoder can also write the INBC mode flag into the code stream. In this way, on the decoder side, the prediction mode parameter of the current block, that is, the prediction mode used by the current block, can be determined by parsing the code stream.

It can be understood that, for the INBC mode provided by this embodiment of the present application, it belongs to one of multiple candidate angle division modes. In some embodiments, the method may also include:

From the multiple candidate angle division modes, determine three target candidate angle division modes;

Intra-frame prediction is performed on the current block using the three target candidate angle division modes, and prediction cost results corresponding to the three target candidate angle division modes are determined;

Based on the prediction cost result, the INBC mode used by the current block is determined from the three target candidate angular partition modes.

Generally speaking, the candidate angle division modes can have 56 modes, which are currently extended to 65 modes in VVC. Among the multiple candidate angle division modes, three target candidate angle division modes can be determined. Taking these three target candidate angle division modes as alternatives, use these three target candidate angle division modes to perform intra-frame prediction on the current block, and determine the prediction cost results corresponding to the three target candidate angle division modes, so as to obtain the results from the three target candidate angle division modes. The INBC mode used by the current block is determined in the target candidate angle division mode.

In a specific embodiment, the determining the INBC mode used by the current block from the three target candidate angle division modes based on the prediction cost result may include:

Based on the prediction cost results, obtain rate-distortion cost results corresponding to the three target candidate angle division modes;

The optimal rate-distortion cost result is selected from the rate-distortion cost results, and the target candidate angle division mode corresponding to the optimal rate-distortion cost result is determined as the INBC mode used by the current block.

It should be noted that the preset rate-distortion model can be regarded as a relational function between the distortion value, the code rate and the Lagrangian multiplier. Assuming that the distortion value is denoted by D, the code rate is denoted by R, and the Lagrange multiplier is denoted by λ, then the preset rate-distortion model can be shown in Equation (8),

J=D+λ·R (8)

where J represents the rate-distortion cost result. Here, for the calculation of the rate-distortion cost result, regardless of the prediction mode, the calculation process is the same. The embodiment of the present application uses the first rate-distortion cost result of the current block in one of the target candidate angle division modes as an example for description. Specifically, intra-frame prediction is performed on the current block by using the target candidate angle division mode to obtain the first predicted value of the current block; then according to the first predicted value of the current block and the real value of the current block, the mean square The error (Mean Square Error, MSE) is calculated to obtain the first distortion value of the current block (represented by D1); at this time, assuming that the code rate R is 1, then the preset rate distortion model shown in equation (8) can be calculated to obtain the The first rate-distortion cost result (represented by RDC1) in the target candidate angle division mode is denoted as RDC1=D1+λ. Similarly, the second rate-distortion cost result (represented by RDC2) and the third rate-distortion cost result (represented by RDC3) under the other two target candidate angle division modes can also be calculated. For the optimal rate-distortion cost result, the target candidate angle division mode corresponding to the optimal rate-distortion cost result is determined as the INBC mode used by the current block.

Further, for the determination of three target candidate angle division modes, in some embodiments, the determining of three target candidate angle division modes from among multiple candidate angle division modes may include:

Perform precoding on the current block based on the multiple candidate angle division modes, and determine precoding results corresponding to the multiple candidate angle division modes;

Based on the precoding result, the three target candidate angle division modes are determined from the plurality of candidate angle division modes.

In a specific embodiment, the determining the three target candidate angle division modes from the multiple candidate angle division modes based on the precoding result may include:

obtaining SATD cost results corresponding to the multiple candidate angle division modes based on the precoding result;

Three relatively superior SATD cost results are selected from the SATD cost results, and the candidate angle division modes corresponding to the three SATD cost results are determined as the three target candidate angle division modes.

It should be noted that, for these various candidate angle division modes, three target candidate angle division modes can be selected according to the sum of absolute transformed difference (Sum of Absolute Transformed Difference, SATD) cost result for rate-distortion cost calculation.

That is to say, after precoding the current block by using multiple candidate angle division modes, and determining the precoding results corresponding to these multiple candidate angle division modes, the corresponding precoding results can be obtained according to the precoding results. SATD cost result; then three relatively superior SATD cost results are selected from the SATD cost results, and the candidate angle division modes corresponding to the selected three SATD cost results are determined as the three target candidate angle division modes.

Specifically, in some embodiments, the performing precoding on the current block based on the multiple candidate angle division modes, and determining the precoding results corresponding to the multiple candidate angle division modes, may include:

determining a first partition and a second partition of the current block in each candidate angular partition mode based on multiple candidate angular partition modes;

determining the first target block vector information of the first partition and the second target block vector information of the second partition under each candidate angle division mode;

Precoding the current block according to the first target block vector information of the first partition and the second target block vector information of the second partition in each candidate angle division mode, to obtain the multiple candidate angle divisions The precoding result corresponding to the mode.

It should be noted that the current block is divided based on each candidate angle division mode, and the first partition and the second partition of the current block in the candidate angle division mode can be determined. Then, after determining the first target block vector information of the first partition and the second target block vector information of the second partition in the candidate angle division mode, the first target block of the first partition in each candidate angle division mode can be The vector information and the vector information of the second target block of the second partition perform precoding on the current block, so as to obtain precoding results corresponding to various candidate angle division modes.

It should also be noted that, for the determination of the first target block vector information of the first partition and the second target block vector information of the second partition in the candidate angle division mode, in some embodiments, the prediction mode parameter indicates that the INBC mode is used. , the method may also include:

building a block vector candidate list, the block vector candidate list including at least one block vector;

For the candidate angle division mode, traverse at least one block vector in the block vector candidate list, and calculate the SAD cost result corresponding to the at least one block vector for the first partition and the SAD cost result for the second partition for the at least one block vector. The SAD cost result corresponding to a block vector;

Select the optimal SAD cost result from the first SAD cost result, determine the block vector corresponding to the optimal SAD cost result as the first target block vector information of the first partition; and select the optimal SAD cost result from the second SAD cost result The optimal SAD cost result is selected from the cost results, and the block vector corresponding to the optimal SAD cost result is determined as the second target block vector information of the second partition.

In this way, based on multiple candidate angle division modes (such as 56 candidate angle division modes), according to the SAD cost, the optimal block vector (ie, the first target block vector information) of the first partition under each candidate angle division mode is determined and the After the optimal block vector of the second partition (that is, the second target block vector information), the precoding results corresponding to the various candidate angle division modes are determined by precoding the current block; and then the precoding results can be obtained according to the precoding results. The SATD cost results corresponding to these various candidate angle division modes, and three relatively superior SATD cost results are selected from the SATD cost results, and the candidate angle division modes corresponding to the selected three SATD cost results are determined as these three Target candidate angle division mode. Further, after using the three target candidate angle division modes to perform intra-frame prediction on the current block, the rate-distortion cost results corresponding to the three target candidate angle division modes can be obtained; For the optimal rate-distortion cost result, the target candidate angle division mode corresponding to the optimal rate-distortion cost result is determined as the INBC mode used by the current block.

In this way, after the prediction mode parameter of the current block is determined, the determined prediction mode can be used to encode the current block finally, so that the prediction residual is small and the encoding efficiency can be improved.

S802: When the prediction mode parameter indicates to use the INBC mode, determine the first target block vector information of the first partition of the current block and the second target block vector information of the second partition of the current block.

It should be noted that, when the prediction mode parameter indicates to use the INBC mode, at this time, the current block is divided based on the INBC mode, and at least two partitions can be obtained. Wherein, the at least two partitions may be the first partition and the second partition.

It should also be noted that when the prediction mode parameter indicates to use the INBC mode, a block vector candidate list (Block Vector Prediction, BVP) needs to be constructed at this time, so as to determine the first target block vector information of the first partition and the second partition. The second target block block vector information. In some embodiments, the method may also include:

A block vector candidate list is constructed, the block vector candidate list including at least one block vector.

Here, for the block vector candidate list, in a specific embodiment, the building block vector candidate list may include:

Obtain historical block vector prediction information;

The block vector candidate list is determined based on the historical block vector prediction information.

That is, the block vector candidate list may be determined based on historical block vector prediction information (History based Block Vector Prediction, HBVP). Among them, the HBVP technology specifically copies 8 motion information candidate buffers from previously encoded blocks into a first-in, first-out queue (First Input First Output, FIFO), and the FIFO is continuously updated in a first-in, first-out manner. If the motion information candidate in the FIFO is the same as the motion information just coded, the duplicate motion information candidate will be removed first, and then the motion information of the current coding unit will be added at the end of the FIFO. If the motion information of the current coding unit is different from the motion information of any candidate in the FIFO, then the first candidate in the FIFO will be removed, and then the latest motion information will be added to the end of the FIFO to ensure that 8 are always reserved in the FIFO. The latest motion information candidate. The motion information candidates in HBVP are identified together with the existing motion information candidates in the second-generation AVS standard (referred to as AVS2) proposed by the Audio Video coding Standard Workgroup of China (AVS). , which is binarized using the unary method. AVS2 contains five motion information candidates, but in the third-generation AVS standard (referred to as AVS3 for short), the symmetric mode is removed, leaving only 4 motion information candidates, plus 8 candidates in HBVP, a total of up to 12 motion information candidates. In short, HBVP will store the block vector of the encoded IBC coded block in a historical block vector information cache with a maximum storage capacity of 12, so that the block vector prediction information based on history can be obtained.

In a more specific embodiment, the determining the block vector candidate list based on the historical block vector prediction information may include:

If the size parameter of the coded block is greater than or greater than the preset size parameter, storing the block vector of the coded block in the zeroth bit of the block vector candidate list; and

If the number of occurrences of the coded block in the historical block vector prediction information is greater than or equal to a preset number of times, storing the block vector of the coded block in the first position of the block vector candidate list; and

Store the block vectors of the coded adjacent blocks on the left side of the current block, the coded adjacent blocks on the upper side, the coded adjacent blocks on the upper left, the coded adjacent blocks on the upper right, and the coded adjacent blocks on the lower left, respectively, in the block vector. The second, third, fourth, fifth and sixth positions of the candidate list;

The block vector candidate list is obtained based on the block vectors stored in the zeroth bit, the first bit, the second bit, the third bit, the fourth bit, the fifth bit and the sixth bit in the block vector candidate list.

It should be noted that the block vector candidate list (BVP) stores up to 7 block vectors; wherein, the i-th block vector candidate list can be represented by cbvp_cands[i], i=0, 1, 2, . . . , 6.

That is, a BV can be allocated from the acquired historical block vector prediction information as one of the candidate BVPs (cbvp_cands[i], a maximum of 7 BVs are stored). details as follows,

The BV with the size parameter W×H≥64 of the encoded block is buffered to cbvp_cands[0];

BVs whose coded blocks appear more than or equal to 2 times in the historical block vector prediction information are cached in cbvp_cands[1];

The BVs of the adjacent blocks on the left, top, top left, top right, and bottom left of the encoded block are cached in cbvp_cands[2], cbvp_cands[3], cbvp_cands[4], cbvp_cands[5], cbvp_cands[6] respectively;

So far, the block vector candidate list (cbvp_cands) is filled.

In this way, after the block vector candidate list is obtained, the first target block vector information of the first partition of the current block and the second target block vector information of the second partition of the current block can be determined according to the block vector candidate list. In this embodiment of the present application, if Adaptive Block Vector Resolution (ABVR) is enabled, BV with integer pixel precision or quadruple pixel precision is tried; otherwise, only BV with integer pixel precision is used. The following first takes BV with integer pixel precision as an example for detailed description.

In a specific embodiment, the determining the first target block vector information of the first partition of the current block and the second target block vector information of the second partition of the current block may include:

determining the first partition and the second partition after the current block is divided based on the INBC mode;

Traverse at least one block vector in the block vector candidate list, and calculate the first SAD cost result corresponding to the at least one block vector of the first partition and the first SAD cost result corresponding to the at least one block vector of the second partition 2. SAD consideration results;

It should be noted that when the current block uses the INBC mode, the optimal block vector can be selected for the first partition and the second partition of the current block by comparing the absolute error and (Sum of Absolute Difference, SAD) cost results. (ie, the first target block vector information and the second target block vector information).

In another specific embodiment, the determining the first target block vector information of the first partition of the current block and the second target block vector information of the second partition of the current block may include:

Establishing a preset hash table, performing an intra-frame block copy search on the first partition and the second partition, and selecting the first partition matching the hash key value of the first partition from the block vector candidate list a piece of vector information and a second piece of vector information that matches the hash key value of the second partition;

Traverse at least one block vector in the block vector candidate list, and calculate a first cost result corresponding to the at least one block vector of the first partition and a second cost result of the second partition corresponding to the at least one block vector result of consideration;

Select the optimal cost result from the first cost result, determine the block vector corresponding to the optimal cost result as the first and second block vector information of the first partition; and select from the second cost result the optimal cost result, determining the block vector corresponding to the optimal cost result as the second two-block vector information of the second partition;

From the first block of vector information and the first two blocks of vector information, determining the block vector information with the best cost result as the first target block vector information of the first partition; and

From the second block vector information and the second two-block vector information, the block vector information with the best cost result is determined as the second target block vector information of the second partition.

It should be noted that, firstly, two preset hash (Hash) tables are established, namely m_hash2Pos and m_pos2Hash, and then the hit prediction reference block and BV are searched. Here, the settings for the preset search range can include:

Determine the proportional value where the same Hash value appears more than twice;

Determine whether the determined ratio value is greater than the preset ratio value;

If the judgment result is yes, set the preset search range to 64×64;

If the judgment result is no, the preset search range is set to 32×32.

In this embodiment of the present application, the preset ratio value may be set to 5%, but is not specifically limited. In this way, the size range of the IBC search can be set according to whether the proportion of the same Hash value appearing more than twice is greater than 5%. If the judgment result is yes, it is set to 64×64; otherwise, it is set to 32×32. After searching for the hit prediction reference block and BV, the BV (including the first block of vector information of the first partition and the second block of vector information of the second partition) searched by Hash can be obtained. Then try all BVs in the block vector candidate list, and select the first and second blocks of vector information of the first partition and the second and second blocks of vector information of the second partition according to the optimal cost result by calculating the cost result; The BVs searched by Hash are compared, and a better BV is selected according to the cost result, so as to obtain the final vector information of the first target block of the first partition and the vector information of the second target block of the second partition. Here, for the block vector candidate list, if multiple block vector candidate lists are constructed, then the block vector candidate list corresponding to the optimal cost result can be determined as the block vector candidate list described in this embodiment of the present application by calculating the cost result, And the index number corresponding to the block vector candidate list is stored in bvp_idx.

It should be noted that, if the first target block vector information (which can be represented by BV[0]) and the second target block vector information (which can be represented by BV[1]) obtained above belong to legal block vector information, that is, BV[0 ]≠0&&BV[1]≠0, then motion estimation ends; if at least one of the first target block vector information and the second target block vector information obtained above belongs to legal block vector information, that is, BV[0]=0||BV [1]=0, then the first target block vector information and the second target block vector information need to be re-determined. In another specific embodiment, the determining the first target block vector information of the first partition of the current block and the second target block vector information of the second partition of the current block may include:

If at least one of the first target block vector information and the second target block vector information belongs to illegal block vector information, a preset search range is determined; in the block vector candidate list, according to the preset The search range respectively performs pixel-by-pixel block vector search on the first partition and the second partition in order to obtain the first block vector information and the second block vector information;

The obtained first block vector information and second block vector information are determined as the first target block vector information and the second target block vector information.

It should be noted that the search start point BV with SAD<1000 is selected in the block vector candidate list (cbvp_cands), otherwise, the start point BV may be set to (0, 0). Record the optimal BVP (bvpasbv_idx), and then perform the BV full search process, as follows,

First set the preset search range. Then, according to the bvpasbv_idx obtained above, calculate the SAD with its corresponding BV, and put it in sad_best_cand and mv_cand. Then, according to the preset search range set, BV search and update are performed on the top (bvx=0, bvy pixel-by-pixel transformation) and right left (bvy=0, bvx pixel-by-pixel transformation) in order; it should be noted that bvx =0, bvy=0 refers to the BV relative to the search start point. For coding blocks with W<16 && H<16, another round of search is performed to improve the prediction accuracy. At this time, in the preset search range, except directly above and directly left, try other BVs at the interval of whole pixels or twice pixels to select the optimal BV (that is, the first target block vector information and the second target block vector information. information).

It should also be noted that after obtaining a legal block vector according to a hash search or a full search, the flag bit skip_me can be set to 1, and then the cost result is calculated, and the currently obtained optimal BV (that is, the first target block vector) can be stored. information and the second target block vector information).

In addition, in the embodiment of the present application, for BV with quadruple pixel precision, BV prediction is first performed to determine the candidate list of block generation vectors; then because the flag bit skip_me=1, the original motion estimation process can be skipped, The BV obtained with integer pixel precision is still used as the optimal BV, and then the BV is adjusted to an integer multiple of four according to the requirement of quadruple precision; finally, the cost result (such as the rate-distortion cost result) can be calculated, and the optimal BV can be updated according to the cost result. BV (ie, first target block vector information and second target block vector information).

In some embodiments, after determining the first target block vector information and the second target block vector information, the method may further include:

determining a first block vector index number, where the first block vector index number is used to indicate an index number corresponding to the first target block vector information in the block vector candidate list;

determining a second block vector index number, where the second block vector index number is used to indicate the index number corresponding to the second target block vector information in the block vector candidate list;

Write the first block vector index number and the second block vector index number into the code stream.

That is to say, after obtaining the first target block vector information and the second target block vector information, the first block vector index number and the second block vector index number can be determined, and the first block vector index number and the second block vector index number can be determined. The index number is written into the code stream. In this way, the first block vector index number and the second block vector index number are obtained by parsing the code stream on the decoder side, and the first target block vector information and the second target block vector information can be determined in combination with the constructed block vector candidate list. information.

S803: Determine a first predicted value of the first partition according to the first target block vector information, and determine a second predicted value of the second partition according to the second target block vector information.

It should be noted that the determining the first predicted value of the first partition according to the first target block vector information may include: performing motion compensation on the first partition according to the first target block vector information, The predicted value of the first partition is obtained.

It should also be noted that the determining the second predicted value of the second partition according to the second target block vector information may include: performing motion compensation on the second partition according to the second target block vector information , to obtain the predicted value of the second partition.

That is to say, after obtaining the first target block vector information, motion compensation can be performed on the first partition according to the first target block vector information, and the predicted value (or referred to as the motion compensation predicted value) of the first partition can be obtained; After obtaining the second target block vector information, motion compensation can be performed on the second partition according to the second target block vector information, and a predicted value (or referred to as a motion compensation predicted value) of the second partition can be obtained.

S804: Determine a first weight value of the first partition and a second weight value of the second partition.

It should be noted that, the first weight value of the first partition and the second weight value of the second partition are mainly related to the index number (represented by AwpIdx) of the angle division mode. In some embodiments, the determining the first weight value of the first partition and the second weight value of the second partition may include:

Based on the INBC mode, determine the index number of the angle division mode;

According to the angle division mode index sequence number, the first calculation model is used to obtain the mapping angle value;

According to the mapping angle value, using the second calculation model to obtain the slope classification index value;

According to the mapping angle value, the third calculation model is used to obtain the partition value to which the angle belongs;

Based on the slope classification index value and the partition value to which the angle belongs, a preset weight calculation model is used to obtain a first weight value of the first partition and a second weight value of the second partition.

It should be noted that after AwpIdx is determined, the mapping angle value (represented by ModAngNum) can be obtained; according to ModAngNum, the slope classification index value (represented by angleIdx) and the partition value to which the angle belongs (represented by subAngleIdx) can be determined. In addition, both the first weight value and the second weight value may include luminance weight (represented by AwpWeightArrayY[x][y]) and chrominance weight (represented by AwpWeightArrayUV[x][y]).

In this embodiment of the present application, after AwpIdx is determined, an intermediate value (using stepIdx), angleIdx and subAngleIdx can be obtained. The specific calculation model is as follows:

stepIdx=(AwpIdx＞＞3)-3 (9)

modAngNum=AwpIdx%8 (10)

Here, ">>" represents the right shift operator, and "%" represents the remainder operator. In addition, the value of stepIdx may be -3, -2, -1, 0, 1, 2, 3; the value of modAngNum may be 0-7.

Further, if modAngNum is equal to 2, then angleIdx=7; if modAngNum is equal to 6, then angleIdx=8; otherwise, angleIdx=modAngNum%2. Specifically, it is expressed by the following formula,

The value comparison table between AwpIdx, stepIdx, and modAngNum is shown in Table 1.

Table 1

AwpIdxAwpIdx	AwpIdx>>3AwpIdx>>3	stepIdx＝(AwpIdx>>3)-3stepIdx=(AwpIdx>>3)-3	ModAngNum ModAngNum
0～70～7	00	-3-3	对应0～7Corresponding to 0 to 7
8～158～15	11	-2-2	对应0～7Corresponding to 0 to 7
16～2316～23	22	-1-1	对应0～7Corresponding to 0 to 7
24～3124～31	33	00	对应0～7Corresponding to 0 to 7
32～3932～39	44	11	对应0～7Corresponding to 0 to 7

40～4740～47	55	22	对应0～7Corresponding to 0 to 7
48～5548～55	66	33	对应0～7Corresponding to 0 to 7

In addition, after obtaining ModAngNum, for subAngleIdx, the calculation model is as follows,

subAngleIdx=modAngNum>>1 (12)

Here, the value of subAngleIdx can be 0, 1, 2, or 3.

That is, stepIdx and modAngNum can be obtained from AwpIdx, and the value of modAngNum determines angleIdx and subAngleIdx.

3A and 3B, the comparison table of values between modAngNum, AwpIdx, and subAngleIdx is shown in Table 2.

Table 2

ModAngNum ModAngNum	angleIdxangleIdx		subAngleIdxsubAngleIdx
00	00	00
11	11	00
22	77	11
33	11	11
44	00	22
55	11	22
66	88	33
77	11	33

In this way, an accurate mapping angle value (ModAngNum) can be obtained according to the subAngleIdx to which the angle belongs and the slope classification index value (angleIdx).

Further, a reference weight list is configured according to relevant parameters, and the reference weight list can be represented by ReferenceWeight[x]. Here, the width of the current block is represented by M, and the height is represented by N.

ValidLength_W=(M+(N>>angleIdx))<<1

ValidLength_H=(N+(M>>angleIdx))<<1

DeltaPos_W=stepIdx*((ValidLength_W>>3)-1)

DeltaPos_H=stepIdx*((ValidLength_H>>3)-1)

FirstPos=(ValidLength_H>>1)-6+DeltaPos_H

ReferenceWeights[x]=Clip3(0,8,x-FirstPos);

Among them, ">>" means right shift operator, "<<" means left shift operator, Clip3 means clamp operator, Clip3(0,8,x-FirstPos) means (x-FirstPos) is clamped at 0 and Between 8, the value range of x is 0 to ValidLength_H-1.

The following takes 8×8, angIdx=0, stepIdx=0 as an example, assuming that the index number of the angle division mode is 24, modAngNum is 0, angleIdx is 0, and subAngleIdx is 0, the following calculation is performed:

ValidLength_W=(8+8)<<1=16*2=32

ValidLength_H=(8+8)<<1=16*2=32

DeltaPos_W=0

DeltaPos_H=0

FirstPos=16-6+0=10

ReferenceWeights[x]=Clip3(0,8,x-10); wherein, for the current block of 8×8, the value range of x is 0˜31.

In this way, the brightness weight of the (x, y) pixel position in the current block is represented by AwpWeightArrayY[x][y], and the calculation formula of AwpWeightArrayY[x][y] is as follows,

AwpWeightArrayY[x][y]＝ReferenceWeights[(y＜＜1)+((x＜＜1)＞＞angleIdx)] (13)

The value range of x is 0 to M-1; the value range of y is 0 to N-1.

Taking subAngleIdx=0 and angleIdx=0 as an example, then AwpWeightArrayY[x][y]=ReferenceWeights[(2y)+(2x)].

The chrominance weight of the (x, y) pixel position in the current block is represented by AwpWeightArrayUV[x][y], and the calculation formula of AwpWeightArrayUV[x][y] is as follows,

AwpWeightArrayUV[x][y]=AwpWeightArrayY[x＜＜1][y＜＜1] (14)

The value range of x is 0～M/2-1; the value range of y is 0～N/2-1.

In this way, according to the luminance weight (AwpWeightArrayY[x][y]) of each pixel position in the current block and the corresponding chrominance weight AwpWeightArrayUV[x][y], the first weight value of the first partition and the second partition can be determined The second weight value of .

In addition, it should also be noted that, after determining the index number of the angle division mode, the method may further include: writing the index number of the angle division mode into the code stream.

That is, after obtaining the index number of the angle division mode, the index number of the angle division mode can be written into the code stream. In this way, the index number of the angle division mode can be obtained by parsing the code stream on the decoder side, so as to determine the first weight value of the first partition and the second weight value of the second partition.

S805: Use the first predicted value, the first weight value, the second predicted value, and the second weight value to perform weighted fusion to determine the intra-frame predicted value of the current block.

It should be noted that, after obtaining the first predicted value, the first weighted value, the second predicted value and the second weighted value, the first predicted value, the first weighted value, the second predicted value and the second weighted value may be By weighted fusion, the intra prediction value of the current block in the INBC mode can be determined.

This embodiment provides an intra-frame prediction method, which is applied to an encoder. By determining the prediction mode parameter of the current block; when the prediction mode parameter indicates to use the INBC mode, determining the first target block vector information of the first partition of the current block and the second target block vector information of the second partition of the current block; The first predicted value of the first partition is determined according to the first target block vector information, and the second predicted value of the second partition is determined according to the second target block vector information; the first weight value and the second weight value of the second partition; use the first predicted value, the first weight value, the second predicted value and the second weight value to perform weighted fusion to determine the Intra prediction value of the current block. In this way, different angle weights are used in intra prediction to process the boundary information in the image block, which can better handle the edge information of two parts of the same divided block with different texture/color distributions, sharp object edges in the intra image, The boundary between the foreground and the background and the boundary information of the common sequence, etc., make the intra-frame image and the inter-frame image have a tool for processing edge information, thereby effectively improving the coding efficiency of the video sequence.

In another embodiment of the present application, the embodiment of the present application proposes an INBC intra-frame prediction technology, which combines the IBC technology and the AWP technology. Among them, the IBC technology can be used to predict repeated/cyclic local image features, and is applied to screen content coding; the AWP technology is applied to process boundary information in inter-frame images. In this way, the purpose of INBC's research is to expect that INBC can better handle the edge information of two parts of different texture/color distributions in the same block, the edge of sharp objects in the intra image, the junction of foreground and background, and boundary information, etc., so that Intra-frame images, like inter-frame images, have a tool for processing edge information, thereby effectively improving the coding efficiency of video sequences.

In this way, in the encoder, the implementation process of the INBC mode is as follows:

The mode, motion information, and flag of the CU are identified in units of a 4×4 current block. Here, the prediction mode is encoded. In a specific implementation, when the String Prediction (SP) mode is enabled, it is necessary to first encode whether it is in INBC mode, then encode whether it is in SP mode, and finally encode whether it is in IBC mode. .

The intra prediction steps of the encoder are as follows:

(1) Derive the block vector candidate list (ie, the BVP list).

(2) Traverse 56 division modes, traverse the BVP list for each mode, and select the optimal BV for the two partitions of each mode by comparing the SAD.

(3) Among the 56 division modes, 3 modes are selected by comparing SATD and enter the process of rate-distortion optimization.

(4) The three modes perform motion compensation for the two partitions respectively according to the optimal BV combination determined in step (1), and determine the respective target block vector information of the two partitions.

(5) According to the respective target block vector information of the two partitions, the respective motion compensation prediction values of the two partitions are respectively determined.

(6) For these three modes, the weighting weight is calculated according to different mode information.

(7) For these three modes, obtain the final intra-frame prediction value of the current block through weighted fusion.

(8) For these three modes, the optimal INBC mode among the three modes is determined through the rate-distortion optimization process.

(9) The optimal INBC mode competes with other modes such as normal intra mode.

(10) Coding the relevant information of the optimal mode (flag, BV index number, etc.).

It should be noted that, in the encoder, the rate-distortion optimization process is as follows: following the historical BV candidate list of IBC, first, in the 56 division modes of AWP, determine the optimal BV for each of the two divisions. Candidate; then select the best three division modes among the 56 division modes, these three division modes perform motion compensation according to the BV of the two partitions determined in the previous step to obtain the predicted value, and then the predicted value of the two partitions A weighted fusion is performed to implement a rate-distortion optimization process, selecting the optimal INBC mode, which is then competed with other modes (such as normal intra mode).

It should also be noted that, in the encoder, flag bit (Flag) setting is also required: that is, flags are respectively set at the sequence (Sequence) level, the frame level, and the CU level to control the use of INBC. Here, the limit range of the CU size to which the INBC mode is applied is: 4×4 to 16×16.

For the derivation of the BVP list in step (1), in this embodiment of the present application, if ABVR is enabled, a block vector (BV) with integer pixel precision or quadruple pixel precision will be tried, otherwise, only the BV with integer pixel precision will be used. . The specific process is as follows:

(a) First try BV with integer pixel precision.

(1.1) BV prediction using HBVP technology

(1.1.1) HBVP technology copies 8 motion information candidates from the previous coding block into the FIFO, and the FIFO keeps updating continuously in a first-in, first-out manner. If the motion information candidate in the FIFO is the same as the motion information just coded, the duplicate motion information candidate will be removed first, and the motion information of the current coding unit will be added at the end of the FIFO. If the motion information of the current coding unit is different from the motion information of any candidate in the FIFO, the first candidate in the FIFO will be removed, and the latest motion information will be added to the end of the FIFO to ensure that the 8 latest motions are always retained in the FIFO. Information candidates. The motion information candidates in HBVP are identified together with the existing motion information candidates in AVS2, and are binarized using the Unary method. AVS2 contains five motion information candidates, but in AVS3, the symmetric mode is removed, leaving only 4 motion information candidates, plus the 8 candidates of HBVP, a total of 12 candidates at most. In short, HBVP will store the BVs of the encoded IBC coded blocks in a historical BV information cache with a maximum storage capacity of 12, so that the block vector prediction information based on history can be obtained.

(1.1.2) Then according to the following attributes, allocate BV from the above-mentioned historical BV information cache as one of the candidate BVPs (represented by cbvp_cands[i], i=0, 1, 2, ..., 6, that is, in the BVP Store up to 7 BVs):

BV buffers with the number of occurrences of coded blocks ≥ 2 times in the historical BV information buffer are stored in cbvp_cands[1];

At this point, the candidate BVP (cbvp_cands) filling is completed.

(1.1.3) Record the number of BVPs filled in cbvp_cands in cnt_class_cands.

(1.2) Perform motion estimation and select an appropriate BV.

(1.2.1) First establish two Hash tables, namely m_hash2Pos and m_pos2Hash, search for the hit prediction reference block and BV, and set the size of the IBC search according to whether the proportion of the same Hash value appearing more than twice is greater than 5% range, set to 64x64 if yes, 32x32 otherwise. Then select the BVP with the smallest cost result (cost) in cbvp_cands, and store the corresponding index value in bvp_idx. Then try all BVPs as BV in cbvp_cands, calculate the cost, compare it with the BV searched by the previous Hash, select a better BV, and record the block vector (BV), the index number of the block vector (bv_idx) and cost result (cost).

(1.2.2) If the search in step (1.2.1) obtains a legal and reasonable BV (ie, BV[0]≠0&&BV[1]≠0). Then the motion estimation ends, and step (1.3) is performed; otherwise, step (1.2.3) is performed.

(1.2.3) Select the search start point BV with SAD<1000 in cbvp_cands, otherwise the start point BV is set to (0, 0). Record the optimal BVP (bvpasbv_idx), and then perform a BV local search. The process is as follows:

First, set the preset search range;

Secondly, according to the bvpasbv_idx just obtained, calculate the SAD with its corresponding BV, and store it in sad_best_cand and mv_cand;

Thirdly, according to the preset search range set, the BV search and update are performed in the order right above (bvx=0, pixel-by-pixel transformation of bvy) and right left (bvy=0, pixel-by-pixel transformation of bvx). (Note: bvx=0, bvy=0 refers to the BV relative to the search starting point);

Again, for the coding blocks with W<16 && H<16, another round of search is performed to improve the prediction accuracy. In the search range, except directly above and directly left, try other BVs at an interval of whole pixels or twice pixels to select the optimal BV.

(1.3) After obtaining a legal and reasonable BV according to Hash search or full search in steps (1.1) and (1.2), set skip_me=1, calculate the rate-distortion cost result (RDcost), and store the current optimal BV.

(b) Try BV with quadruple pixel precision again.

(2.1) Perform BV prediction, which is the same as step (1.1) above, and will not be repeated here.

(2.2) Because skip_me=1, the original motion estimation process can be skipped, and the BV obtained with integer pixel precision is still used as the optimal BV; and then the BV is adjusted to be an integer multiple of four according to the quadruple precision requirement.

(2.3) Calculate the rate-distortion cost result (RDcost) and update the optimal BV.

So far, the first target block vector information of the first partition and the second target block vector information of the second partition in the current block can be obtained.

In this way, after determining the first target block vector information of the first partition and the second target block vector information of the second partition in the current block, motion compensation is performed according to the first target block vector information to determine the first prediction of the first partition value, and perform motion compensation according to the second target block vector information to determine the second predicted value of the second partition; according to the angle division mode index number (AwpIdx), the first weight value of the first partition and the second prediction value of the second partition can be determined. The second weight value of the partition; finally, the first prediction value, the first weight value, the second prediction value and the second weight value are used for weighted fusion, so that the intra frame prediction value of the current block can be obtained.

This embodiment provides an intra-frame prediction method, which is applied to an encoder. The specific implementation of the foregoing embodiments is described in detail through this embodiment, from which it can be seen that, based on the technical solution of this embodiment, using different angle weights to process boundary information in image blocks in intra-frame prediction can better The edge information of two parts of different texture/color distributions in the same partition block, the sharp object edges in the intra-frame image, the junction between the foreground and the background, and the boundary information of the common sequence, etc. are processed, so that the intra-frame image has the same as the inter-frame image. A tool for processing edge information, thereby effectively improving the coding efficiency of video sequences.

In another embodiment of the present application, the intra-frame prediction method provided by the embodiment of the present application is applied to a video decoding device, that is, a decoder. The functions implemented by the method can be implemented by calling a computer program by the second processor in the decoder. Of course, the computer program can be stored in the second memory. It can be seen that the decoder includes at least a second processor and a second memory.

Based on the application scenario example of FIG. 7B above, see FIG. 9 , which shows a schematic flowchart of another intra prediction method provided by an embodiment of the present application. As shown in Figure 9, the method may include:

S901: Parse the code stream to obtain prediction mode parameters of the current block.

It should be noted that a video image may be divided into multiple image blocks, and each image block to be decoded currently may be called a decoding block. Here, each decoding block may also include a first image component, a second image component, and a third image component; and the current block is the current block in the video image that is to be predicted for the first image component, the second image component, or the third image component. Decode block.

In some embodiments, the parsing the code stream to obtain the prediction mode parameters of the current block may include:

Parse the stream to get the INBC mode flag;

If the INBC mode flag bit is the first value, then determine that the current block uses the INBC mode;

If the INBC mode flag bit is the second value, it is determined that the current block uses the normal intra mode.

It should be noted that, in a specific implementation manner, the first value may be 1, and the second value may be 0; or, the first value may be true, and the second value may be false. In another specific implementation manner, the first value may be 0, and the second value may be 1; or, the first value may be false, and the second value may be true.

It should also be noted that after the encoder determines the prediction mode parameter, the encoder can write the INBC mode flag bit into the code stream. In this way, the decoder can obtain the INBC mode flag bit of the current block by parsing the code stream, and then can determine whether the current block uses the INBC mode according to the INBC mode flag bit.

S902: When the prediction mode parameter indicates to use the INBC mode, parse the code stream to obtain the first block vector index number and the second block vector index number.

S903: Determine, based on the block vector candidate list, the first target block vector information of the first partition of the current block corresponding to the first block vector index number in the block vector candidate list, and the second block vector index number The second target block vector information of the second partition of the corresponding current block in the block vector candidate list.

It should also be noted that the first block vector index number is used to indicate the index number corresponding to the first target block vector information in the block vector candidate list, and the second block vector index number is used to indicate that the second target block vector information is in the block vector The corresponding index number in the candidate list. Therefore, in some embodiments, the method may further include:

Obtain historical block vector prediction information;

That is, the block vector candidate list may be determined based on historical block vector prediction information (History based Block Vector Prediction, HBVP). In a more specific embodiment, the determining the block vector candidate list based on the historical block vector prediction information may include:

If the size parameter of the decoded block is greater than or greater than a preset size parameter, storing the block vector of the decoded block in the zeroth bit of the block vector candidate list; and

If the number of times the decoded block appears in the historical block vector prediction information is greater than or equal to a preset number of times, storing the block vector of the decoded block in the first position of the block vector candidate list; and

Store the block vectors of the decoded adjacent blocks on the left side of the current block, the decoded adjacent blocks on the upper side, the decoded adjacent blocks on the upper left, the decoded adjacent blocks on the upper right, and the decoded adjacent blocks on the lower left in the the second, third, fourth, fifth and sixth bits of the block vector candidate list;

It should also be noted that the construction of the block vector candidate list in the decoder is the same as the construction process of the block vector candidate list in the encoder, which will not be described in detail here.

Since the encoder determines the vector information of the first target block and the vector information of the second target block, the encoder sets the index number of the first block vector corresponding to the vector information of the first target block and the vector index of the second target block corresponding to the vector information of the second target block. The sequence number is written into the code stream and transmitted to the decoder. In this way, the decoder does not need to determine the vector information of the first target block and the vector information of the second target block in the same way as the encoder. At this time, the decoder can obtain the index number of the first block vector and the second target block vector by parsing the code stream. The block vector index number, and then based on the constructed block vector candidate list, the first target block vector information and the second target block vector information can be obtained. The first target block vector information represents the optimal block vector of the first partition of the current block, and the second target block vector information represents the optimal block vector of the second partition of the current block.

S904: Determine a first predicted value of the first partition according to the first target block vector information, and determine a second predicted value of the second partition according to the second target block vector information.

S905: Determine a first weight value of the first partition and a second weight value of the second partition.

Parse the code stream and obtain the index number of the angle division mode;

It should be noted that since the encoder writes the AwpIdx into the code stream, for the decoder, the AwpIdx can be obtained by parsing the code stream. Then, according to AwpIdx, the mapping angle value (represented by ModAngNum) can be further obtained; according to ModAngNum, the slope classification index value (represented by angleIdx) and the partition value to which the angle belongs (represented by subAngleIdx) can be further obtained. In addition, both the first weight value and the second weight value may include luminance weight (represented by AwpWeightArrayY[x][y]) and chrominance weight (represented by AwpWeightArrayUV[x][y]).

It should also be noted that, after obtaining AwpIdx, the determination of the first weight value and the second weight value in the decoder is the same as the determination process of the first weight value and the second weight value in the encoder, which will not be described in detail here.

S906: Use the first predicted value, the first weight value, the second predicted value, and the second weight value to perform weighted fusion to determine the intra-frame predicted value of the current block.

It should be noted that after obtaining the first predicted value, the first weighted value, the second predicted value and the second weighted value, the first predicted value, the first weighted value, the second predicted value and the second weighted value are weighted After fusion, the intra prediction value of the current block in the INBC mode can be determined.

In short, in the decoder, by constructing the same block vector candidate list as that on the encoder side, the mode index (i.e. the angle division mode index number) and BV index (i.e. the first block vector index number and the BV index) transmitted by the encoder side are divided into The second block vector index number) determines the relevant coefficients for determining the weighting weight and the corresponding target block vector information of the two partitions (the first partition and the second partition), and then weights the motion compensation prediction values of the two partitions to obtain the final The intra-frame prediction value of .

The decoder's intra prediction steps are as follows:

(1) Parse the code stream to obtain the flag information, the index number of the angle division mode of the INBC mode, and the BV indexes of the two partitions.

(2) Derive the block vector candidate list (ie, the BVP list).

(3) According to the BV index and the BVP list, the BV information of the two partitions (that is, the respective target block vector information of the two partitions, including the first target block vector information and the second target block vector information) can be determined.

(4) According to the respective target block vector information of the two partitions, the respective motion compensation prediction values of the two partitions are determined respectively.

(5) Parse the code stream to obtain mode information; calculate the weighted weight according to the mode information.

(6) Obtain the final intra-frame prediction value of the current block through weighted fusion.

This embodiment provides an intra-frame prediction method, which is applied to a decoder. By parsing the code stream, the prediction mode parameter of the current block is obtained; when the prediction mode parameter indicates to use the INBC mode, the code stream is parsed to obtain the first block vector index number and the second block vector index number; based on the block vector candidate list, determining the first target block vector information of the first partition of the current block corresponding to the first block vector index number in the block vector candidate list, and the second block vector index number in the block vector candidate list corresponding second target block vector information of the second partition of the current block; determining the first predicted value of the first partition according to the first target block vector information, and determining the first predicted value of the first partition according to the second target block vector information the second predicted value of the second partition; determine the first weight value of the first partition and the second weight value of the second partition; use the first predicted value, the first weight value, the first The second prediction value and the second weight value are weighted and fused to determine the intra-frame prediction value of the current block. In this way, different angle weights are used in intra prediction to process the boundary information in the image block, which can better handle the edge information of two parts of the same divided block with different texture/color distributions, sharp object edges in the intra image, The junction of foreground and background and the boundary information of common sequences, etc., make intra-frame images have a tool for processing edge information like inter-frame images, thereby effectively improving the decoding efficiency of video sequences.

In yet another embodiment of the present application, based on the same inventive concept as the foregoing embodiments, see FIG. 10 , which shows a schematic structural diagram of an encoder 100 provided by an embodiment of the present application. As shown in FIG. 10, the encoder 100 may include: a first determination unit 1001, a first calculation unit 1002, and a first prediction unit 1003; wherein,

a first determining unit 1001, configured to determine a prediction mode parameter of the current block;

The first determining unit 1001 is further configured to, when the prediction mode parameter indicates to use the INBC mode, determine the first target block vector information of the first partition of the current block and the second target block vector information of the second partition of the current block;

A first calculation unit 1002, configured to determine a first predicted value of the first partition according to the first target block vector information, and determine a second predicted value of the second partition according to the second target block vector information and determining a first weight value for the first partition and a second weight value for the second partition;

The first prediction unit 1003 is configured to perform weighted fusion by using the first prediction value, the first weight value, the second prediction value and the second weight value to determine the intra-frame prediction value of the current block .

In some embodiments, referring to FIG. 10 , the encoder 100 may further include a precoding unit 1004 configured to perform precoding on the current block based on multiple candidate prediction modes, and determine the precoding corresponding to the multiple candidate prediction modes result;

The first determining unit 1001 is further configured to determine a prediction mode parameter of the current block from the multiple candidate prediction modes according to the precoding result.

Further, the first determining unit 1001 is specifically configured to obtain rate-distortion cost results corresponding to the multiple candidate prediction modes based on the precoding results; and select an optimal rate-distortion cost result from the rate-distortion cost results , and the candidate prediction mode corresponding to the optimal rate-distortion cost result is determined as the prediction mode parameter of the current block.

In some embodiments, referring to FIG. 10 , the encoder 100 may further include a setting unit 1005; wherein, the multiple candidate prediction modes include an INBC mode and a normal intra mode;

The setting unit 1005 is configured to set the INBC mode flag bit to a first value if the prediction mode parameter indicates to use the INBC mode; if the prediction mode parameter indicates to use the normal intra mode, then set the INBC mode flag bit to the first value Set to the second value.

In some embodiments, the first value is 1 and the second value is 0; or, the first value is true and the second value is flase.

In some embodiments, referring to FIG. 10 , the encoder 100 may further include a writing unit 1006 configured to write the INBC mode flag bit into the code stream.

In some embodiments, the first determining unit 1001 is further configured to determine three target candidate angle division modes from among multiple candidate angle division modes; and use the three target candidate angle division modes to frame the current block. intra-prediction, determining prediction cost results corresponding to the three target candidate angle division modes; and determining an INBC mode used by the current block from the three target candidate angle division modes based on the prediction cost results.

Further, the first determining unit 1001 is specifically configured to obtain rate-distortion cost results corresponding to the three target candidate angle division modes based on the prediction cost results; and select an optimal rate-distortion cost result from the rate-distortion cost results For the cost result, the target candidate angle division mode corresponding to the optimal rate-distortion cost result is determined as the INBC mode used by the current block.

In some embodiments, the precoding unit 1004 is further configured to perform precoding on the current block based on the multiple candidate angle division modes, and determine precoding results corresponding to the multiple candidate angle division modes;

The first determining unit 1001 is further configured to determine the three target candidate angle division modes from the multiple candidate angle division modes based on the precoding result.

Further, the first determining unit 1001 is specifically configured to obtain SATD cost results corresponding to the multiple candidate angle division modes based on the precoding results; and select three relatively better SATDs from the SATD cost results For the cost result, the candidate angle division modes corresponding to the three SATD cost results are determined as the three target candidate angle division modes.

In some embodiments, the first determining unit 1001 is further configured to, based on multiple candidate angle division modes, determine the first partition and the second partition of the current block in each candidate angle division mode; and determine each candidate angle The first target block vector information of the first partition and the second target block vector information of the second partition in the division mode;

The precoding unit 1004 is specifically configured to perform precoding on the current block according to the first target block vector information of the first partition and the second target block vector information of the second partition in each candidate angle division mode, Precoding results corresponding to the multiple candidate angle division modes are obtained.

In some embodiments, referring to FIG. 10 , the encoder 100 may further include a first construction unit 1007 configured to construct a block vector candidate list, the block vector candidate list including at least one block vector.

In some embodiments, the first construction unit 1007 is specifically configured to obtain historical block vector prediction information; and determine the block vector candidate list based on the historical block vector prediction information.

Further, the first construction unit 1007 is specifically configured to store the block vector of the encoded block in the zeroth position of the block vector candidate list if the size parameter of the encoded block is greater than or greater than the preset size parameter; and if the number of occurrences of the encoded block in the historical block vector prediction information is greater than or equal to a preset number of times, storing the block vector of the encoded block in the first position of the block vector candidate list; and The block vectors of the coded adjacent blocks on the left side, the coded adjacent blocks on the upper side, the coded adjacent blocks on the upper left, the coded adjacent blocks on the upper right, and the coded adjacent blocks on the lower left of the current block are respectively stored in the block. The second, third, fourth, fifth and sixth bits of the vector candidate list; and the zeroth, first, second, third, The block vector stored in the fourth bit, the fifth bit and the sixth bit obtains the block vector candidate list.

In some embodiments, the first determining unit 1001 is specifically configured to, based on the INBC mode, determine the first partition and the second partition after the current block is divided; The first partition and the second partition perform an intra-block copy search, and select from the block vector candidate list the first block vector information that matches the hash key value of the first partition and the first block vector information that matches the hash key value of the first partition. The second block vector information matching the hash key value of the second partition; and traversing at least one block vector in the block vector candidate list, and calculating the first cost of the first partition corresponding to the at least one block vector result and a second cost result corresponding to the second partition with respect to the at least one block vector; and selecting an optimal cost result from the first cost result, and determining the block vector corresponding to the optimal cost result as the The first and second blocks of vector information of the first partition; and the optimal cost result is selected from the second cost result, and the block vector corresponding to the optimal cost result is determined as the second and second blocks of the second partition vector information; and from the first block of vector information and the first two blocks of vector information, determining the block vector information with the best cost result as the first target block vector information of the first partition; and from Among the second block vector information and the second two-block vector information, the block vector information with the best cost result is determined as the second target block vector information of the second partition.

In some embodiments, the first determining unit 1001 is further configured to determine a preset search range if at least one of the first target block vector information and the second target block vector information belongs to illegal block vector information In the block vector candidate list, according to the preset search range, the first sub-region and the second sub-region are respectively searched for pixel-by-pixel block vectors in order to obtain the first block vector information and the second block vector information ; and determining the obtained first block vector information and second block vector information as the first target block vector information and the second target block vector information.

In some embodiments, the first determining unit 1001 is further configured to determine a first block vector index number, where the first block vector index number is used to indicate the corresponding first target block vector information in the block vector candidate list an index number; and determining a second block vector index number, where the second block vector index number is used to indicate an index number corresponding to the second target block vector information in the block vector candidate list;

The writing unit 1006 is further configured to write the first block vector index number and the second block vector index number into the code stream.

In some embodiments, the first calculation unit 1002 is specifically configured to perform motion compensation on the first partition according to the first target block vector information to obtain the predicted value of the first partition.

In some embodiments, the first calculation unit 1002 is specifically configured to perform motion compensation on the second partition according to the second target block vector information, to obtain the predicted value of the second partition.

In some embodiments, the first determining unit 1001 is further configured to determine the index number of the angle division mode based on the INBC mode;

The first calculation unit 1002 is further configured to divide the mode index number according to the angle, and use the first calculation model to obtain a mapping angle value; and according to the mapping angle value, use the second calculation model to obtain the slope classification index value; and according to For the mapping angle value, a third calculation model is used to obtain the value of the partition to which the angle belongs; and based on the slope classification index value and the value of the partition to which the angle belongs, a preset weight calculation model is used to obtain the first weight of the first partition value and a second weight value for the second partition.

In some embodiments, the writing unit 1006 is further configured to write the index number of the angle division mode into the code stream.

It can be understood that, in the embodiments of the present application, a "unit" may be a part of a circuit, a part of a processor, a part of a program or software, etc., of course, it may also be a module, and it may also be non-modular. Moreover, each component in this embodiment may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit. The above-mentioned integrated units can be implemented in the form of hardware, or can be implemented in the form of software function modules.

If the integrated unit is implemented in the form of a software functional module and is not sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this embodiment is essentially or The part that contributes to the prior art or the whole or part of the technical solution can be embodied in the form of a software product, the computer software product is stored in a storage medium, and includes several instructions for making a computer device (which can be It is a personal computer, a server, or a network device, etc.) or a processor (processor) that executes all or part of the steps of the method described in this embodiment. The aforementioned storage medium includes: U disk, mobile hard disk, read only memory (Read Only Memory, ROM), random access memory (Random Access Memory, RAM), magnetic disk or optical disk and other media that can store program codes.

Therefore, an embodiment of the present application provides a computer storage medium, which is applied to the encoder 100. The computer storage medium stores an intra-frame prediction program, and when the intra-frame prediction program is executed by the first processor, any of the foregoing embodiments is implemented. one of the methods described.

Based on the composition of the encoder 100 and the computer storage medium described above, see FIG. 11 , which shows a schematic diagram of a specific hardware structure of the encoder 100 provided by the embodiment of the present application. As shown in FIG. 11 , it may include: a first communication interface 1101 , a first memory 1102 and a first processor 1103 ; each component is coupled together through a first bus system 1104 . It can be understood that the first bus system 1104 is used to realize the connection and communication between these components. In addition to the data bus, the first bus system 1104 also includes a power bus, a control bus and a status signal bus. However, for the sake of clarity, the various buses are labeled as the first bus system 1104 in FIG. 11 . in,

The first communication interface 1101 is used for receiving and sending signals in the process of sending and receiving information with other external network elements;

a first memory 1102 for storing computer programs that can run on the first processor 1103;

The first processor 1103 is configured to, when running the computer program, execute:

determine the prediction mode parameter of the current block;

When the prediction mode parameter indicates to use the INBC mode, determining the first target block vector information of the first partition of the current block and the second target block vector information of the second partition of the current block;

It can be understood that the first memory 1102 in this embodiment of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memories. Wherein, the non-volatile memory may be a read-only memory (Read-Only Memory, ROM), a programmable read-only memory (Programmable ROM, PROM), an erasable programmable read-only memory (Erasable PROM, EPROM), an electrically programmable read-only memory (Erasable PROM, EPROM). Erase programmable read-only memory (Electrically EPROM, EEPROM) or flash memory. Volatile memory may be Random Access Memory (RAM), which acts as an external cache. By way of illustration and not limitation, many forms of RAM are available, such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM, SDRAM), double data rate synchronous dynamic random access memory (Double Data Rate SDRAM, DDRSDRAM), enhanced synchronous dynamic random access memory (Enhanced SDRAM, ESDRAM), synchronous link dynamic random access memory (Synchlink DRAM, SLDRAM) And direct memory bus random access memory (Direct Rambus RAM, DRRAM). The first memory 1102 of the systems and methods described herein is intended to include, but not be limited to, these and any other suitable types of memory.

The first processor 1103 may be an integrated circuit chip with signal processing capability. In the implementation process, each step of the above method may be completed by an integrated logic circuit of hardware in the first processor 1103 or an instruction in the form of software. The above-mentioned first processor 1103 can be a general-purpose processor, a digital signal processor (Digital Signal Processor, DSP), an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), a ready-made programmable gate array (Field Programmable Gate Array, FPGA) Or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components. The methods, steps, and logic block diagrams disclosed in the embodiments of this application can be implemented or executed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of the method disclosed in conjunction with the embodiments of the present application may be directly embodied as executed by a hardware decoding processor, or executed by a combination of hardware and software modules in the decoding processor. The software modules may be located in random access memory, flash memory, read-only memory, programmable read-only memory or electrically erasable programmable memory, registers and other storage media mature in the art. The storage medium is located in the first memory 1102, and the first processor 1103 reads the information in the first memory 1102, and completes the steps of the above method in combination with its hardware.

It will be appreciated that the embodiments described herein may be implemented in hardware, software, firmware, middleware, microcode, or a combination thereof. For hardware implementation, the processing unit can be implemented in one or more Application Specific Integrated Circuits (ASIC), Digital Signal Processing (DSP), Digital Signal Processing Device (DSP Device, DSPD), programmable Logic Devices (Programmable Logic Device, PLD), Field-Programmable Gate Array (Field-Programmable Gate Array, FPGA), General Purpose Processors, Controllers, Microcontrollers, Microprocessors, Others for performing the functions described herein electronic unit or a combination thereof. For a software implementation, the techniques described herein may be implemented through modules (eg, procedures, functions, etc.) that perform the functions described herein. Software codes may be stored in memory and executed by a processor. The memory can be implemented in the processor or external to the processor.

Optionally, as another embodiment, the first processor 1103 is further configured to execute the method described in any one of the foregoing embodiments when running the computer program.

This embodiment provides an encoder, and the encoder may include a first determination unit, a first calculation unit, and a first prediction unit. In this way, different angle weights are used in intra prediction to process the boundary information in the image block, which can better handle the edge information of two parts of the same divided block with different texture/color distributions, sharp object edges in the intra image, The boundary between the foreground and the background and the boundary information of the common sequence, etc., make the intra-frame image and the inter-frame image have a tool for processing edge information, thereby effectively improving the coding efficiency of the video sequence.

In yet another embodiment of the present application, based on the same inventive concept as the foregoing embodiments, see FIG. 12 , which shows a schematic structural diagram of a decoder 120 provided by an embodiment of the present application. As shown in FIG. 12, the decoder 120 may include: a parsing unit 1201, a second determining unit 1202, a second calculating unit 1203, and a second predicting unit 1204; wherein,

The parsing unit 1201 is configured to parse the code stream and obtain the prediction mode parameter of the current block; and is also configured to parse the code stream when the prediction mode parameter indicates to use the INBC mode, and obtain the first block vector index number and the second block vector index number;

The second determining unit 1202 is configured to determine, based on the block vector candidate list, the first target block vector information of the first partition of the current block corresponding to the first block vector index number in the block vector candidate list, and the The second target block vector information of the second partition of the current block corresponding to the second block vector index number in the block vector candidate list;

The second calculation unit 1203 is configured to determine a first predicted value of the first partition according to the first target block vector information, and determine a second predicted value of the second partition according to the second target block vector information and determining a first weight value for the first partition and a second weight value for the second partition;

The second prediction unit 1204 is configured to perform weighted fusion by using the first prediction value, the first weight value, the second prediction value and the second weight value to determine the intra frame prediction value of the current block .

In some embodiments, the parsing unit 1201 is further configured to parse the code stream and obtain the INBC mode flag bit;

The second determining unit 1202 is further configured to, if the INBC mode flag is a first value, determine that the current block uses the INBC mode; if the INBC mode flag is a second value, determine that the current block uses the INBC mode Normal intra mode.

In some embodiments, referring to FIG. 12 , the decoder 120 may further include a second construction unit 1205 configured to construct a block vector candidate list, the block vector candidate list including at least one block vector.

In some embodiments, the second construction unit 1205 is specifically configured to obtain historical block vector prediction information; and determine the block vector candidate list based on the historical block vector prediction information.

Further, the second construction unit 1205 is specifically configured to store the block vector of the decoded block in the zeroth position of the block vector candidate list if the size parameter of the decoded block is greater than or greater than the preset size parameter; and if the number of occurrences of the decoded block in the historical block vector prediction information is greater than or equal to a preset number of times, storing the block vector of the decoded block in the first bit of the block vector candidate list; and The block vectors of the decoded adjacent blocks on the left side of the current block, the decoded adjacent blocks on the upper side, the decoded adjacent blocks on the upper left, the decoded adjacent blocks on the upper right, and the decoded adjacent blocks on the lower left are respectively stored in the block. The second, third, fourth, fifth and sixth bits of the vector candidate list; and the zeroth, first, second, third, The block vector stored in the fourth bit, the fifth bit and the sixth bit obtains the block vector candidate list.

In some embodiments, the second calculation unit 1203 is specifically configured to perform motion compensation on the first partition according to the first target block vector information to obtain the predicted value of the first partition.

In some embodiments, the second calculation unit 1203 is specifically configured to perform motion compensation on the second partition according to the second target block vector information to obtain the predicted value of the second partition.

In some embodiments, the parsing unit 1201 is further configured to parse the code stream and obtain the index number of the angle division mode;

The second calculation unit 1203 is further configured to divide the mode index number according to the angle, obtain the mapping angle value by using the first calculation model; and obtain the slope classification index value by using the second calculation model according to the mapping angle value; For the mapping angle value, a third calculation model is used to obtain the value of the partition to which the angle belongs; and based on the slope classification index value and the value of the partition to which the angle belongs, a preset weight calculation model is used to obtain the first weight of the first partition value and a second weight value for the second partition.

It can be understood that, in this embodiment, a "unit" may be a part of a circuit, a part of a processor, a part of a program or software, etc., of course, it may also be a module, and it may also be non-modular. Moreover, each component in this embodiment may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit. The above-mentioned integrated units can be implemented in the form of hardware, or can be implemented in the form of software function modules.

If the integrated unit is implemented in the form of a software functional module and is not sold or used as an independent product, it may be stored in a computer-readable storage medium. Based on such understanding, the present embodiment provides a computer storage medium, which is applied to the decoder 120 , where the computer storage medium stores an intra-frame prediction program, and the intra-frame prediction program implements the foregoing embodiments when executed by the second processor The method of any of the above.

Based on the composition of the above-mentioned decoder 120 and the computer storage medium, see FIG. 13 , which shows a schematic diagram of a specific hardware structure of the decoder 120 provided by the embodiment of the present application. As shown in FIG. 13 , it may include: a second communication interface 1301 , a second memory 1302 and a second processor 1303 ; each component is coupled together through a second bus system 1304 . It can be understood that the second bus system 1304 is used to implement connection communication between these components. In addition to the data bus, the second bus system 1304 also includes a power bus, a control bus, and a status signal bus. However, for the sake of clarity, the various buses are designated as the second bus system 1304 in FIG. 13 . in,

The second communication interface 1301 is used for receiving and sending signals in the process of sending and receiving information with other external network elements;

a second memory 1302 for storing computer programs that can run on the second processor 1303;

The second processor 1303 is configured to, when running the computer program, execute:

Optionally, as another embodiment, the second processor 1303 is further configured to execute the method described in any one of the foregoing embodiments when running the computer program.

It can be understood that the hardware function of the second memory 1302 is similar to that of the first memory 1102, and the hardware function of the second processor 1303 is similar to that of the first processor 1103; details are not described here.

This embodiment provides a decoder, and the decoder may include a parsing unit, a second determination unit, a second calculation unit, and a second prediction unit. In this way, different angle weights are used in intra prediction to process the boundary information in the image block, which can better handle the edge information of two parts of the same divided block with different texture/color distributions, sharp object edges in the intra image, The junction of foreground and background and the boundary information of common sequences, etc., make intra-frame images have a tool for processing edge information like inter-frame images, thereby effectively improving the decoding efficiency of video sequences.

It should be noted that, in this application, the terms "comprising", "comprising" or any other variation thereof are intended to encompass non-exclusive inclusion, such that a process, method, article or device comprising a series of elements includes not only those elements , but also other elements not expressly listed or inherent to such a process, method, article or apparatus. Without further limitation, an element qualified by the phrase "comprising a..." does not preclude the presence of additional identical elements in a process, method, article or apparatus that includes the element.

The above-mentioned serial numbers of the embodiments of the present application are only for description, and do not represent the advantages or disadvantages of the embodiments.

The methods disclosed in the several method embodiments provided in this application can be arbitrarily combined under the condition of no conflict to obtain new method embodiments.

The features disclosed in the several product embodiments provided in this application can be combined arbitrarily without conflict to obtain a new product embodiment.

The features disclosed in several method or device embodiments provided in this application can be combined arbitrarily without conflict to obtain new method embodiments or device embodiments.

The above are only specific embodiments of the present application, but the protection scope of the present application is not limited to this. should be covered within the scope of protection of this application. Therefore, the protection scope of the present application should be subject to the protection scope of the claims.

Industrial Applicability

In the embodiment of the present application, after the prediction mode parameter of the current block is obtained, when the prediction mode parameter indicates to use the INBC mode, the first target block vector information of the first partition of the current block and the second partition of the current block are determined. the second target block vector information; determine the first predicted value of the first partition according to the first target block vector information, and determine the second predicted value of the second partition according to the second target block vector information ; determine the first weight value of the first partition and the second weight value of the second partition; reuse the first predicted value, the first weight value, the second predicted value and the first predicted value The two weight values are weighted and fused to determine the intra-frame prediction value of the current block. In this way, different angle weights are used in intra prediction to process the boundary information in the image block, which can better handle the edge information of two parts of the same divided block with different texture/color distributions, sharp object edges in the intra image, The junction of the foreground and background and the boundary information of ordinary sequences, etc., make intra-frame images and inter-frame images have a tool for processing edge information, thereby effectively improving the encoding and decoding efficiency of video sequences.

Claims

An intra-frame prediction method, applied to an encoder, the method comprising:

determine the prediction mode parameter of the current block;

When the prediction mode parameter indicates that the non-rectangular block copy INBC mode is used, determining the first target block vector information of the first partition of the current block and the second target block vector information of the second partition of the current block;

determining a first predictor of the first partition according to the first target block vector information, and determining a second predictor of the second partition according to the second target block vector information;

determining a first weight value of the first partition and a second weight value of the second partition;

Weighted fusion is performed using the first predicted value, the first weighted value, the second predicted value and the second weighted value to determine the intra-frame predicted value of the current block.
The method according to claim 1, wherein the determining a prediction mode parameter of the current block comprises:

Perform precoding on the current block based on multiple candidate prediction modes, and determine precoding results corresponding to the multiple candidate prediction modes;

According to the precoding result, a prediction mode parameter of the current block is determined from the plurality of candidate prediction modes.
The method according to claim 2, wherein the determining the prediction mode parameter of the current block from the multiple candidate prediction modes according to the precoding result comprises:

obtaining rate-distortion cost results corresponding to the multiple candidate prediction modes based on the precoding results;

An optimal rate-distortion cost result is selected from the rate-distortion cost results, and a candidate prediction mode corresponding to the optimal rate-distortion cost result is determined as a prediction mode parameter of the current block.
The method according to claim 2 or 3, wherein the multiple candidate prediction modes include an INBC mode and a normal intra-frame mode, and the determining a prediction mode parameter of the current block includes:

If the prediction mode parameter indicates that the INBC mode is used, the INBC mode flag is set to the first value;

If the prediction mode parameter indicates that the normal intra mode is used, the INBC mode flag is set to a second value.
The method of claim 4, wherein the first value is 1 and the second value is 0; or, the first value is true and the second value is flase.
The method of claim 4, wherein the method further comprises:

Write the INBC mode flag into the code stream.
The method of claim 1, wherein before said determining the prediction mode parameter of the current block, the method further comprises:

From the multiple candidate angle division modes, determine three target candidate angle division modes;

Intra-frame prediction is performed on the current block using the three target candidate angle division modes, and prediction cost results corresponding to the three target candidate angle division modes are determined;

Based on the prediction cost result, the INBC mode used by the current block is determined from the three target candidate angular partition modes.
The method according to claim 7, wherein the determining the INBC mode used by the current block from the three target candidate angle division modes based on the prediction cost result comprises:

Based on the prediction cost results, obtain rate-distortion cost results corresponding to the three target candidate angle division modes;

The optimal rate-distortion cost result is selected from the rate-distortion cost results, and the target candidate angle division mode corresponding to the optimal rate-distortion cost result is determined as the INBC mode used by the current block.
The method according to claim 7, wherein, among the multiple candidate angle division modes, three target candidate angle division modes are determined, comprising:

Perform precoding on the current block based on the multiple candidate angle division modes, and determine precoding results corresponding to the multiple candidate angle division modes;

Based on the precoding result, the three target candidate angle division modes are determined from the plurality of candidate angle division modes.
The method according to claim 9, wherein the determining the three target candidate angle division modes from the plurality of candidate angle division modes based on the precoding result comprises:

Based on the precoding result, obtain absolute transform difference and SATD cost results corresponding to the multiple candidate angle division modes;

Three relatively superior SATD cost results are selected from the SATD cost results, and the candidate angle division modes corresponding to the three SATD cost results are determined as the three target candidate angle division modes.
The method according to claim 9, wherein the performing precoding on the current block based on the multiple candidate angle division modes, and determining the precoding results corresponding to the multiple candidate angle division modes, comprises:

determining a first partition and a second partition of the current block in each candidate angular partition mode based on multiple candidate angular partition modes;

determining the first target block vector information of the first partition and the second target block vector information of the second partition under each candidate angle division mode;

Precoding the current block according to the first target block vector information of the first partition and the second target block vector information of the second partition in each candidate angle division mode, to obtain the multiple candidate angle divisions The precoding result corresponding to the mode.
The method of claim 1, wherein the method further comprises:

A block vector candidate list is constructed, the block vector candidate list including at least one block vector.
The method of claim 12, wherein the building block vector candidate list comprises:

Obtain historical block vector prediction information;

The block vector candidate list is determined based on the historical block vector prediction information.
The method of claim 13, wherein the determining the block vector candidate list based on the historical block vector prediction information comprises:

If the size parameter of the coded block is greater than or greater than the preset size parameter, storing the block vector of the coded block in the zeroth bit of the block vector candidate list; and

If the number of occurrences of the coded block in the historical block vector prediction information is greater than or equal to a preset number of times, storing the block vector of the coded block in the first position of the block vector candidate list; and

Store the block vectors of the coded adjacent blocks on the left side, the coded adjacent blocks on the upper side, the coded adjacent blocks on the upper left, the coded adjacent blocks on the upper right, and the coded adjacent blocks on the lower left of the current block respectively in the the second, third, fourth, fifth and sixth bits of the block vector candidate list;

The block vector candidate list is obtained based on the block vectors stored in the zeroth bit, the first bit, the second bit, the third bit, the fourth bit, the fifth bit and the sixth bit in the block vector candidate list.
The method according to claim 12, wherein the determining the first target block vector information of the first partition of the current block and the second target block vector information of the second partition of the current block comprises:

determining the first partition and the second partition after the current block is divided based on the INBC mode;

Establishing a preset hash table, performing an intra-frame block copy search on the first partition and the second partition, and selecting the first partition matching the hash key value of the first partition from the block vector candidate list a piece of vector information and a second piece of vector information that matches the hash key value of the second partition;

Traverse at least one block vector in the block vector candidate list, and calculate a first cost result corresponding to the at least one block vector of the first partition and a second cost result of the second partition corresponding to the at least one block vector result of consideration;

Select the optimal cost result from the first cost result, determine the block vector corresponding to the optimal cost result as the first and second block vector information of the first partition; and select from the second cost result the optimal cost result, determining the block vector corresponding to the optimal cost result as the second two-block vector information of the second partition;

From the first block of vector information and the first two blocks of vector information, determining the block vector information with the best cost result as the first target block vector information of the first partition; and

From the second block vector information and the second two-block vector information, the block vector information with the best cost result is determined as the second target block vector information of the second partition.
The method according to claim 15, wherein the determining the first target block vector information of the first partition of the current block and the second target block vector information of the second partition of the current block comprises:

If at least one of the first target block vector information and the second target block vector information belongs to illegal block vector information, a preset search range is determined; in the block vector candidate list, according to the preset The search range respectively performs pixel-by-pixel block vector search on the first partition and the second partition in order to obtain the first block vector information and the second block vector information;

The obtained first block vector information and second block vector information are determined as the first target block vector information and the second target block vector information.
The method according to claim 1, wherein after determining the first target block vector information and the second target block vector information, the method further comprises:

determining a first block vector index number, where the first block vector index number is used to indicate an index number corresponding to the first target block vector information in the block vector candidate list;

determining a second block vector index number, where the second block vector index number is used to indicate the index number corresponding to the second target block vector information in the block vector candidate list;

Write the first block vector index number and the second block vector index number into the code stream.
The method according to any one of claims 1 to 17, wherein the determining the first predicted value of the first partition according to the first target block vector information comprises:

Motion compensation is performed on the first partition according to the first target block vector information to obtain a predicted value of the first partition.
The method according to any one of claims 1 to 17, wherein the determining the second predicted value of the second partition according to the second target block vector information comprises:

Motion compensation is performed on the second partition according to the second target block vector information to obtain a predicted value of the second partition.
The method according to any one of claims 1 to 17, wherein the determining the first weight value of the first partition and the second weight value of the second partition comprises:

Based on the INBC mode, determine the index number of the angle division mode;

According to the angle division mode index sequence number, the first calculation model is used to obtain the mapping angle value;

According to the mapping angle value, using the second calculation model to obtain the slope classification index value;

According to the mapping angle value, the third calculation model is used to obtain the partition value to which the angle belongs;

Based on the slope classification index value and the partition value to which the angle belongs, a preset weight calculation model is used to obtain a first weight value of the first partition and a second weight value of the second partition.
The method according to claim 20, wherein after determining the index number of the angle division mode, the method further comprises:

Write the index number of the angle division mode into the code stream.
An intra-frame prediction method, applied to a decoder, the method comprising:

Parse the code stream to obtain the prediction mode parameters of the current block;

When the prediction mode parameter indicates that the INBC mode is used, the code stream is parsed, and the first block vector index number and the second block vector index number are obtained;

Based on the block vector candidate list, determine the first target block vector information of the first partition of the current block corresponding to the first block vector index number in the block vector candidate list, and the second block vector index number in the block vector candidate list. the second target block vector information of the second partition of the corresponding current block in the block vector candidate list;

determining a first predictor of the first partition according to the first target block vector information, and determining a second predictor of the second partition according to the second target block vector information;

determining a first weight value of the first partition and a second weight value of the second partition;

Weighted fusion is performed using the first predicted value, the first weighted value, the second predicted value and the second weighted value to determine the intra-frame predicted value of the current block.
The method according to claim 22, wherein the parsing the code stream to obtain the prediction mode parameter of the current block comprises:

Parse the stream to get the INBC mode flag;

If the INBC mode flag bit is the first value, then determine that the current block uses the INBC mode;

If the INBC mode flag bit is the second value, it is determined that the current block uses the normal intra mode.
The method of claim 23, wherein the first value is 1 and the second value is 0; or, the first value is true and the second value is flase.
The method of claim 22, wherein the method further comprises:

The block vector candidate list is constructed, the block vector candidate list including at least one block vector.
The method of claim 25, wherein the constructing the block vector candidate list comprises:

Obtain historical block vector prediction information;

The block vector candidate list is determined based on the historical block vector prediction information.
The method of claim 26, wherein the determining the block vector candidate list based on the historical block vector prediction information comprises:

If the size parameter of the decoded block is greater than or greater than a preset size parameter, storing the block vector of the decoded block in the zeroth bit of the block vector candidate list; and

If the number of times the decoded block appears in the historical block vector prediction information is greater than or equal to a preset number of times, storing the block vector of the decoded block in the first position of the block vector candidate list; and

Store the block vectors of the decoded adjacent blocks on the left side of the current block, the decoded adjacent blocks on the upper side, the decoded adjacent blocks on the upper left, the decoded adjacent blocks on the upper right, and the decoded adjacent blocks on the lower left in the the second, third, fourth, fifth and sixth bits of the block vector candidate list;

The block vector candidate list is obtained based on the block vectors stored in the zeroth bit, the first bit, the second bit, the third bit, the fourth bit, the fifth bit and the sixth bit in the block vector candidate list.
The method according to any one of claims 22 to 27, wherein the determining the first predicted value of the first partition according to the first target block vector information comprises:

Motion compensation is performed on the first partition according to the first target block vector information to obtain a predicted value of the first partition.
The method according to any one of claims 22 to 27, wherein the determining the second predicted value of the second partition according to the second target block vector information comprises:

Motion compensation is performed on the second partition according to the second target block vector information to obtain a predicted value of the second partition.
The method according to any one of claims 22 to 27, wherein the determining the first weight value of the first partition and the second weight value of the second partition comprises:

Parse the code stream and obtain the index number of the angle division mode;

According to the angle division mode index sequence number, the first calculation model is used to obtain the mapping angle value;

According to the mapping angle value, using the second calculation model to obtain the slope classification index value;

According to the mapping angle value, the third calculation model is used to obtain the partition value to which the angle belongs;

Based on the slope classification index value and the partition value to which the angle belongs, a preset weight calculation model is used to obtain a first weight value of the first partition and a second weight value of the second partition.
An encoder comprising a first determination unit, a first calculation unit and a first prediction unit; wherein,

the first determining unit, configured to determine the prediction mode parameter of the current block;

The first determining unit is further configured to, when the prediction mode parameter indicates to use the INBC mode, determine the first target block vector information of the first partition of the current block and the second target block vector information of the second partition of the current block ;

The first calculation unit is configured to determine a first prediction value of the first partition according to the first target block vector information, and determine a second prediction value of the second partition according to the second target block vector information value; and determining a first weight value for the first partition and a second weight value for the second partition;

The first prediction unit is configured to perform weighted fusion by using the first prediction value, the first weight value, the second prediction value and the second weight value to determine the intra prediction of the current block value.
An encoder comprising a first memory and a first processor; wherein,

the first memory for storing a computer program executable on the first processor;

The first processor is configured to execute the method according to any one of claims 1 to 21 when running the computer program.
A decoder, the decoder includes a parsing unit, a second determination unit, a second calculation unit and a second prediction unit; wherein,

The parsing unit is configured to parse the code stream to obtain the prediction mode parameter of the current block; and is also configured to parse the code stream when the prediction mode parameter indicates to use the INBC mode, to obtain the first block vector index number and the second block vector index number;

The second determining unit is configured to, based on the block vector candidate list, determine the first target block vector information of the first partition of the current block corresponding to the first block vector index number in the block vector candidate list, and the the second target block vector information of the second partition of the current block corresponding to the second block vector index number in the block vector candidate list;

The second calculation unit is configured to determine a first prediction value of the first partition according to the first target block vector information, and determine a second prediction value of the second partition according to the second target block vector information value; and determining a first weight value for the first partition and a second weight value for the second partition;

the second prediction unit, configured to perform weighted fusion by using the first prediction value, the first weight value, the second prediction value and the second weight value to determine the intra prediction of the current block value.
A decoder comprising a second memory and a second processor; wherein,

the second memory for storing a computer program executable on the second processor;

The second processor is configured to execute the method according to any one of claims 22 to 30 when running the computer program.
A computer storage medium, wherein the computer storage medium stores a computer program, which when executed by a first processor implements the method according to any one of claims 1 to 21, or is executed by a second processor A method as claimed in any one of claims 22 to 30 is implemented when executed.