RU2802175C2 - Advanced weight processing using combined mode with intra-frame and inter-frame prediction - Google Patents

Abstract

FIELD: computer science.

SUBSTANCE: video processing method comprises the steps of determining, in the course of converting between a current video block that is encoded in a combined intra-frame and inter-frame prediction (CIIP) coding mode, video and a data bit stream representation of the current video block, a pair of weight coefficients comprising the first weight coefficient for the first prediction result of the current video block and the second weight coefficient for the second prediction result of the current video block, based on one or more adjacent video blocks relative to the current video block, the first prediction result being generated in the intra-frame prediction mode, and the second prediction result is generated in the inter-frame prediction mode; and determining a prediction result of the current block based on the weighted sum of the first prediction result and the second prediction result.

EFFECT: improvement in the quality of a digital image or video after decompression or decoding.

15 cl, 31 dwg

Description

The field of technology to which the invention belongs

This document relates to video and image encoding and decoding technologies.

State of the art

Digital video occupies the largest share of the bandwidth on the Internet and other digital communication networks. As the number of connected user devices capable of receiving and presenting video on a display increases, the bandwidth requirements for digital video use are expected to continue to grow.

Disclosure of the essence of the invention

The proposed technology can be used in versions of decoders or encoders for video or images, which use a combined coding mode with intra-frame and inter-frame prediction.

According to one exemplary aspect, a video processing method is provided. The method comprises the steps of determining the coding mode of the first video block; restricting one or more flags to an operational state based on the result of determining the coding mode of the first video block, wherein the operational state may be false or true; and performing further processing of the second video block in accordance with the operating state of the specified one or more flags, and the first video block is a neighboring video block or a reference video block relative to the second video block.

According to another exemplary aspect, a video processing method comprises determining whether to use pairwise prediction or combined bidirectional prediction with respect to a first video block; determining an operating state of a combined inter-intra prediction (CIIP) coding mode based on the determination that pairwise prediction or combined bidirectional prediction is used, and the operating state is enabled or disabled; and performing further processing of the first video block in accordance with the operation state of the CIIP prediction mode.

According to another exemplary aspect, another video processing method is provided. The method comprises converting between a video video block and an encoded representation of the video block using a combined intra-prediction and inter-prediction coding mode, wherein the encoded representation corresponds to a weighted average of the intra-prediction and inter-prediction results for the specified video block using a weight pair from a set of weight pairs. coefficients having less than three pairs.

According to another exemplary aspect, another video processing method is provided. The method comprises the step of converting between a video video block and an encoded representation of the video block using a combined intra-prediction and inter-prediction coding mode, wherein the encoded representation corresponds to a weighted average of the intra-prediction and inter-prediction results for the specified video block using a pair of weight coefficients from the set of pairs weight coefficients determined according to the encoding information of one or more neighboring blocks.

According to another exemplary aspect, another video processing method is provided. The method comprises determining, in a process of converting between a first block of video data and a data bitstream representation of the first block, one or more coding modes for one or more second blocks; determining, based on said one or more coding modes for said one or more second blocks, a coding mode constraint for the first block; and perform, at least by applying the restrictions for the coding mode for the first block, the specified transformation; wherein said one or more second blocks comprise at least one of an adjacent block, a non-adjacent block, and/or a reference block for said first block.

According to another exemplary aspect, another video processing method is provided. The method comprises converting between a current block in video data and a data bitstream representation of the current block using at least one of a combined intra-frame and inter-prediction (CIIP) coding mode, diffusing filtering, bidirectional filtering, filtering in of the transformed region, or some other type of post-reconstruction filtering other than scattering filtering, two-way filtering, and filtering in the transformed region, wherein the reconstructed adjacent samples of the current block used in at least one of the combined intra- and inter-prediction (CIIP) coding mode ), a diffuse filtering mode, a two-way filtering mode, a transformed domain filtering mode, or some other type of post-rendered filtering mode, are replaced by approximate samples generated from the corresponding samples of the reconstructed adjacent samples in one or more reference images.

According to another exemplary aspect, another video processing method is provided. The method comprises storing a combined intra- and inter-prediction (CIIP) coding mode flag and/or a CIIP mode intra-frame prediction mode flag with motion information in a history-based motion vector prediction (HMVP) table. ); and performing, at least based on the HMVP prediction table, a transformation between the current video data block and a data bitstream representation of the current block.

According to another exemplary aspect, another video processing method is provided. The method comprises determining, in a process of converting between the current video data block and a data bitstream representation of the current block, a prediction mode for the current block; determine the applicability of the combined intra-frame and inter-frame prediction (CIIP) coding mode, indicating that the combined CIIP prediction mode is activated for the current block, in response to determining that the current block is encoded using the advanced motion vector prediction (AMVP) mode ) or in join mode; and performing a transformation based on the applicability of the CIIP prediction mode.

According to another exemplary aspect, another video processing method is provided. The method comprises determining, in the process of converting between the current block of video data and the data bitstream representation of the current block, the type of the selected merging candidate for the current block, and determining whether a combined intra-frame and inter-frame predictive (CIIP) coding mode is applicable to the current block according to the type of the selected candidate to be merged, the current block being coded in the merging mode.

According to another exemplary aspect, another video processing method is provided. The method comprises encoding, in the process of converting between a current video block of video data and a data bitstream representation of the current video block, a combined intra-frame and inter-frame prediction (CIIP) coding mode flag for the current video block by encoding based on a context model without reference to a prediction mode flag for one or more video blocks adjacent to the current block, and performing transformation by at least applying a combined intra- and inter-prediction (CIIP) coding mode flag to the current video block.

According to another exemplary aspect, another video processing method is provided. The method comprises encoding, in the process of converting between the current video block of video data and a representation of the current video block as a data bit stream, a combined intra-frame and inter-frame prediction (CIIP) coding mode flag for the current video block by bypass coding, and converting at least least by applying a combined intra- and inter-prediction (CIIP) coding mode.

According to another exemplary aspect, another video processing method is provided. The method comprises the steps of determining the intra-frame prediction mode for the first video video block in accordance with some rule, the rule comprising: skipping, during the procedure for determining the intra-frame prediction mode for the first video block, checking the flag of the combined intra- and inter-frame prediction (CIIP) coding mode for one or more video blocks adjacent to the first video block, and performing, based on at least the found intra-prediction mode, a transformation between the first video block and a data bitstream representation of the first video block.

According to another exemplary aspect, another video processing method is provided. The method comprises determining, in the process of converting between a current video block encoded in a combined intra-frame and inter-frame prediction (CIIP) coding mode, video and a representation of this current video block as a data bit stream, a pair of weight coefficients containing a first weight coefficient for a first prediction result of the current video block and a second weighting factor for a second prediction result of the current video block, based on one or more video blocks adjacent to the current video block, the first prediction result being generated in an intra prediction mode and the second prediction result being generated in an inter prediction mode; and determining a prediction result of the current block based on the weighted sum of the first prediction result and the second prediction result.

According to another exemplary aspect, the method described above may be implemented by a video encoder that includes a processor.

In yet another exemplary aspect, these methods may be implemented as processor-executable instructions stored on a computer-readable program medium.

These and other aspects will be further described in this document.

Brief description of the drawings

Fig. 1 shows an example of a procedure for constructing a list of merged candidates.

Fig. 2 shows an example of spatial candidate positions.

Fig. 3 shows an example of pairs of candidates subjected to redundancy control from a pool of spatial merged candidates.

Fig. 4 shows an example of positions for a second PU with N×2N and 2N×N partitions.

Fig. 5 shows an example of motion vector scaling for temporal pooled candidates.

Fig. 6 shows an example of candidate positions for temporary merged candidates, C0 and C1.

Fig. 7 shows an example of a combined bidirectionally interpolated (predictive) merging candidate.

Fig. 8 shows an example of a candidate construction procedure with motion vector prediction.

Fig. 9 shows an example of motion vector scaling for spatial merging candidates.

Fig. 10 shows an example of motion prediction using an alternative temporal motion vector prediction (ATMVP) algorithm for coding units (CU).

Fig. 11 shows an example of adjacent samples for determining illumination compensation (IC) parameters.

Fig. 12 shows an example of an ultimate motion vector expression (UMVE) search procedure.

Fig. 13 shows an example of a UMVE expression lookup point.

Fig. 14 shows an example flow diagram of a decoding procedure using the proposed Historical Motion Vector Prediction (HMVP) method.

Fig. 15 shows an example of updating a table in the proposed HMVP prediction method.

Fig. 16 shows an example of a symmetrical mode.

Fig. 17 shows an example of neighboring samples for the current block and their corresponding samples in the reference picture.

Fig. 18 is a block diagram of an example of a video processing apparatus.

Fig. 19 shows a block diagram of an example implementation of a video encoder.

Fig. 20 is a logic diagram of an example of a video processing method.

Fig. 21 is a logic diagram of an example of a video processing method.

Fig. 22 shows an example of top and left adjacent blocks used in estimating the weights for the CIIP prediction mode.

Fig. 23 is a logic diagram of an example of a video processing method.

Fig. 24 is a logic diagram of an example of a video processing method.

Fig. 25 is a logic diagram of an example of a video processing method.

Fig. 26 is a logic diagram of an example of a video processing method.

Fig. 27 is a logic diagram of an example of a video processing method.

Fig. 28 is a logic diagram of an example of a video processing method.

Fig. 29 is a logic diagram of an example of a video processing method.

Fig. 30 is a logic diagram of an example of a video processing method.

Fig. 31 is a logic diagram of an example of a video processing method.

Implementation of the invention

The present document proposes various methods that can be used by a decoder for image or video data bitstreams to improve the quality of a digital image or video after decompression or decoding. For brevity, the term "video" is used here in such a way that it covers both a sequence of images (traditionally referred to as video) and individual images. In addition, the video encoder also implements these methods during the encoding procedure in order to reconstruct the decoded frames used for further encoding.

Section headings are used herein for ease of understanding and are not intended to limit the options and methods to their respective sections. In such a situation, options from one section can be combined with options from other sections.

1. General Provisions

This document relates to video coding technologies. In particular, it refers to a combined intra-frame and inter-frame prediction (CIIP) coding mode applied in video encoding or decoding. This can be applied to existing video coding standards such as the HEVC standard or the Versatile Video Coding (VVC) standard, which has yet to be finalized and released. This may also apply to future video processing standards or video codecs.

2. State of the art

Video coding standards have evolved primarily through the development of the well-known ITU-T and ISO/IEC standards. ITU-T released H.261 and H.263 standards, ISO/IEC released MPEG-1 and MPEG-4 Visual standards, and the two organizations jointly released H.262/MPEG-2 Video and H.264/ MPEG-4 Advanced Video Coding (AVC) and H.265/HEVC [1]. Since the H.262 standard, video coding standards have been based on a hybrid video coding framework using temporal prediction plus transformation coding. For research on future video coding technologies to be developed after HEVC coding technology, the Video Coding Expert Group (VCEG) and the Motion Picture Experts Group (MPEG) jointly founded the Joint Video Exploration Team in 2015. (JVET)). Since then, the JVET group has developed many methods and incorporated them into reference software called the Joint Exploration Model (JEM). In April 2018, the VCEG (Q6/16) and ISO/IEC JTC1 SC29/WG11 (MPEG) established a Joint Video Expert Team (JVET) to work on the VVC standard with the goal of reducing required bit rate by 50% compared to HEVC coding.

In FIG. 19 is a block diagram of an example implementation of a video encoder. In FIG. 19 shows that the encoder implementation has a built-in feedback loop into which the video encoder also performs video decoding functions (reconstruction of a compressed representation of the video data for use in encoding the next video data).

2.1 Interframe prediction in HEVC/H.265

Each PU (prediction unit) has motion parameters for one or two reference picture lists. The set of motion parameters contains a motion vector and a reference image index. The use of one or two reference picture lists may also be signaled using the inter_pred_idc parameter. The motion vectors may be explicitly encoded as increments relative to the predictors.

When a CU is encoded in skip mode, a single PU is associated with that CU and there are no significant residual coefficients, no coded motion vector increment or reference picture index. The merge mode is specified such that the motion parameters for the current PU are derived from neighboring PUs, including spatial and temporal candidates. The combining mode can be applied to any inter prediction PU, not only in the skip mode. An alternative for the merging mode is to explicitly transmit the motion parameters, where the motion vectors (more specifically, the motion vector differences relative to the motion vector predictor), the corresponding reference picture index for each reference picture list, and the reference picture list utilization rate are signaled explicitly. for each PU. This type of mode is referred to herein as advanced motion vector prediction (AMVP).

When the signaling indicates that one of the two reference picture lists should be used, a PU is created from one block of samples. This is called 'uni-prediction'. Unidirectional prediction is available for both types of slices - P-slice or slice with reference to the previous slice (predicted slice) and B-slice (B-slice) or slice with references to the previous and subsequent slices (or bidirectionally interpolated slice ).

When the signaling indicates that both reference picture lists should be used, a PU is created from two blocks of samples. This is called "bi-directional interpolation (prediction)" ('bi-prediction'). Bidirectional interpolation is only available for B-slices.

The following text contains details of the inter-prediction modes specified in the HEVC coding standard. This description will start with the merge mode.

2.1.1 Combine mode

2.1.1.1 Determination of Candidates for Merge Mode

When a PU is predicted using the merge mode, an index indicating an entry position in the merge candidate list is parsed from the data bitstream and used to extract motion information. The procedure for constructing this list is specified in the HEVC standard and can be summarized according to the following sequence of steps:

Stage 1: Obtaining Initial Candidates

Step 1.1: Obtaining Spatial Candidates

Step 1.2: Redundancy Control for Spatial Candidates

Stage 1.3: Obtaining temporary candidates

Stage 2: Inserting Additional Candidates

Step 2.1: Creating Bidirectionally Interpolated Candidates

Step 2.2: Inserting Candidates with Zero Movement

These steps are shown schematically in Fig. 1. To obtain spatial merging candidates, select a maximum of four merged candidates from a pool of candidates located in five different positions. To obtain temporary merged candidates, a maximum of one merged candidate from two candidates is selected. Since the decoder assumes a constant number of candidates for each PU, if the number of candidates obtained in step 1 does not reach the maximum number of merged candidates (MaxNumMergeCand) signaled in the slice header, additional candidates are generated. Because the number of candidates is constant, the index of the best merged candidate is encoded using a truncated unary binarization (TU)). If the CU size is 8, all PUs from the current CU share one merged candidate list, which is identical to the merged candidate list for a 2N×2N prediction unit.

In the following, the operations associated with the listed steps are discussed in more detail.

2.1.1.2 Obtaining spatial candidates

Upon receipt of the spatial merged candidates, a maximum of four merged candidates is selected from the pool of candidates located at the positions shown in FIG. 2. Candidates are selected in the following order A _1, B _1, B _0, A ₀ and B ₂ . Position B ₂ is taken into account only when any of the PUs that should be in positions A ₁ , B ₁ , B ₀ , A ₀ is not available (for example, because this unit belongs to another slice or tile) or is coded with using intraframe prediction. After adding a candidate at position A ₁ , the addition of the remaining candidates should be done with redundancy control, which ensures that candidates with the same motion information are excluded from the list, so that coding efficiency is improved. To reduce computational complexity, not all possible pairs of candidates are considered in the above redundancy control process. On the contrary, only the pairs connected by the arrow in FIG. 3 and a candidate is only added to the list if the corresponding candidate used for redundancy control does not have the same traffic information. Another source of duplicated motion information is the “second PU” associated with partitions other than 2Nx2N. As an example, FIG. 4 shows the second PU for the N×2N and 2N×N cases, respectively. When the current PU is partitioned as N×2N, the candidate in position A ₁ is not taken into account when building the list. In fact, adding this candidate may result in two prediction units having the same motion information, which is redundant in terms of the requirement to have only one PU per coding unit. Likewise, position B ₁ is ignored when the current PU is split as 2N×N.

2.1.1.3 Obtaining temporary candidates

At this stage, only one candidate is added to the list. In particular, upon receipt of this temporal merged candidate, a scaled motion vector is generated based on the same location of the PU belonging to the image having the smallest Picture Order Count (POC) difference relative to the current image in the considered reference picture list. The reference picture list to be used to obtain the colocated PU is signaled explicitly in the header. Dashed. line in Fig. 5 illustrates the derivation of a scaled motion vector for a temporal merging candidate that is scaled from the motion vector for a co-located PU using sequence number distances (POC distances), tb and td, where the distance tb is defined as the difference in POC numbers between the reference the image for the current image and the current image itself, and the distance td is defined as the difference of the POC numbers between the reference image for the sibling image and the sibling image itself. The reference picture index for the temporary merging candidate is set to zero. The practical implementation of the scaling procedure is described in the HEVC standard. For the B-slice, two motion vectors are obtained, one for reference picture list 0 and the other for reference picture list 1, and combine these vectors to obtain a bidirectionally interpolated merging candidate.

In the same-located PU (Y) belonging to the reference frame, a position for a temporary candidate is selected between candidates C ₀ and C ₁ as shown in FIG. 6. If the PU at position C ₀ is not available, encoded using intra-prediction, or is outside the current CTU, position C ₁ is used. Otherwise, position C ₀ is used to obtain a temporary merging candidate.

2.1.1.4 Inserting additional candidates

Besides spatiotemporal merged candidates, there are two additional types of merged candidates: combined bidirectionally interpolated merged candidate and null merged candidate. Combined bidirectionally interpolated merged candidates are generated using spatial and temporal merged candidates. The combined bidirectionally interpolated merging candidate is only used for the B-slice. Such combined bidirectionally interpolated candidates are generated by combining the motion parameters from the first reference picture list for the original candidate with the motion parameters from the second reference picture list for the other candidate. If these two groups of parameters form different motion hypotheses, they will create a new bidirectionally interpolated candidate. As an example, in FIG. 7 shows a case where two candidates from the original list (left) having parameters mvL0 and refIdxL0 or mvL1 and refIdxL1 are used to create a combined bidirectionally interpolated merged candidate to be added to the final list (right). There are numerous rules regarding the construction of such combinations that are taken into account when generating such additional merged candidates.

Candidates with zero movement are inserted to fill the remaining input positions in the list of merged candidates and thereby achieve the maximum capacity of the MaxNumMergeCand list. These candidates have a spatial offset of zero, and the reference picture index starts at zero and is incremented each time a new zero-motion candidate is added to the list. The number of reference frames used by these candidates is one and two for unidirectional prediction and bidirectional prediction, respectively. In some embodiments, redundancy control is not performed for these candidates.

2.1.1.5 Motion evaluation areas for parallel processing

To speed up the coding procedure, the motion estimation can be performed in parallel so that the motion vectors for all prediction units within any particular area under consideration are obtained simultaneously. The procedure for deriving merged candidates from the spatial environment can interfere with parallel processing because one prediction unit cannot derive motion parameters from a neighboring PU until the motion estimation associated with that unit is completed. To smooth trade-offs between coding efficiency and processing delay, the HEVC coding standard defines a motion estimation region (MER) whose dimensions are signaled in a picture parameter set using the “log2_parallel_merge_level_minus2” syntax element. When a MER region is defined, merged candidates that fall within the same region are marked as unavailable and therefore not taken into account when building the list.

2.1.2 Advanced Motion Vector Prediction (AMVP)

AMVP prediction uses the spatio-temporal correlation of the motion vector with neighboring PUs, which is used to explicitly convey the motion parameters. For each reference picture list, when constructing the motion vector candidate list, first check the availability of temporary neighboring PUs at top left positions, eliminate redundant candidates, and add a null vector to make a constant length candidate list. The encoder may then select the best predictor from the list of candidates and transmit an appropriate index indicating the selected candidate. Similar to signaling the union index transmission, the best motion vector index is encoded using truncated unary binarization. The maximum value to be encoded in this case is 2 (see FIG. 8). The following sections provide details of the procedure for obtaining a candidate in motion vector prediction.

2.1.2.1 Obtaining candidates in AMVP prediction

Fig. 8 summarizes the procedure for obtaining a candidate in motion vector prediction.

In motion vector prediction, two types of motion vector candidates are considered: a spatial motion vector candidate and a temporal motion vector candidate. To generate a spatial motion vector candidate, two motion vector candidates are ultimately generated based on motion vectors for each of the PUs located at five different positions, as previously shown in FIG. 2.

To form a temporal motion vector candidate, one motion vector candidate is selected from two candidates obtained based on two different positions located at the same place. After the creation of the first list of spatiotemporal candidates, the duplicated candidate motion vectors are excluded from this list. If the number of potential candidates is greater than two, motion vector candidates for which the reference picture index in the associated reference picture list is greater than 1 are excluded from the list. If this number of candidate space-time motion vectors is less than two, an additional null candidate motion vector is added to the list.

2.1.2.2 Candidate spatial motion vectors

To generate a spatial motion vector candidate, a maximum of two potential candidates from a set of five potential candidates derived from PUs located at positions as shown in FIG. 2, these positions are the same as when combining the movement. The generation order for the left side of the current PU is defined as candidate A ₀ , candidate A ₁ , and scaled candidate A ₀ , scaled candidate A ₁ . The generation order for the upper side from the current PU is defined as candidate B ₀ , candidate B ₁ , candidate B ₂ , scaled candidate B ₀ , scaled candidate B ₁ , scaled candidate B ₂ . For each side, therefore, there are four cases that can be used as a motion vector candidate, where in two cases spatial scaling is not required and in two cases spatial scaling is applied. These four different cases are summarized as follows.

No spatial scaling

(1) Same reference picture list and same reference picture index (same POC order)

(2) Different reference picture lists but same reference picture (same POC order)

Spatial scaling

(3) Same reference picture list but different reference pictures (different POC order)

(4) Different reference picture lists and different reference pictures (different POC order)

Cases without spatial scaling are tested first, followed by cases that allow spatial scaling. Spatial scaling is considered when the POC order differs between a reference picture for a neighboring PU and a reference picture for the current PU regardless of the reference picture list. If all of the left candidate PUs are not available or encoded using intra-prediction, motion vector scaling for the top unit is allowed to help determine left and top MV candidate vectors in parallel. Otherwise, no spatial scaling is allowed for the unit motion vector from above.

For the case of spatial scaling, the motion vector for a neighboring PU is scaled in a manner similar to temporal scaling as shown in the example shown in FIG. 9. The main difference is that the reference picture list and the index of the current PU are used as input; the actual scaling procedure is the same as in the case of temporal scaling.

2.1.2.3 Temporal motion vector candidates

Other than obtaining the reference picture index, all procedures for generating temporal merging candidates are the same as for generating spatial motion vector candidates (as shown in the example in FIG. 6). The reference picture index is signaled to the decoder.

2.2 New ways of inter-frame prediction

2.2.1 Motion vector prediction based on CU sub-units

In a JEM model using quadtrees plus binary trees (QTBT), each CU can have at most one set of motion parameters per prediction direction. Two methods are considered for predicting motion vectors at the sub-CU level in an encoder by dividing a large CU into sub-CUs and generating motion information for all sub-CUs from a large CU. The Alternate Temporal Motion Vector Prediction (ATMVP) method allows each CU to sample multiple sets of motion information from multiple blocks smaller than the current CU in the same location reference picture. Using the spatial-temporal motion vector prediction (STMVP) method, motion vectors of CUs are generated using a temporal motion vector predictor and a spatial neighbor motion vector.

In order to maintain a more accurate motion field for CU motion prediction, motion compression for reference frames may not be currently enabled.

2.2.1.1 Alternative temporal motion vector prediction

According to the alternative temporal motion vector prediction (ATMVP) method, the temporal motion vector prediction (TMVP) method is modified by fetching multiple sets of motion information (including motion vectors and reference indices) from blocks less than the current CU. As shown in FIG. 10, CU sub-units are N×N square blocks (N is set to 4 by default).

The ATMVP prediction method performs motion vector prediction of CU sub-units within a CU in two steps. In the first step, the corresponding block in the reference picture is identified with a so-called time vector. The reference image is also called the motion source image. In the second step, the current CU is partitioned into sub-CUs, and the motion vectors as well as the reference indices of each sub-CU are obtained from the block corresponding to each sub-CU, as shown in FIG. 10.

In the first step, the reference image 1050 and the corresponding block are determined by motion information of spatially neighboring blocks for the current CU. To avoid repeated scans of adjacent blocks, the first merged candidate from the list of merged candidates for the current unit is used. CU. The first available motion vector, as well as its associated reference index, is set as the temporal vector and index for the motion source image. In this way, in the ATMVP prediction mode, the corresponding block can be more accurately identified, as compared to the TMVP prediction method, where the corresponding block (sometimes called a colocated block) is always in the lower right or center position relative to the current CU.

In the second step, the corresponding CU sub-unit block is identified by a temporal vector in the motion source image by adding the temporal vector to the coordinate of the current CU. For each CU sub-unit, the motion information of its respective block (the smallest motion grid covering the center sample) is used to obtain motion information for the CU sub-unit in question. After identifying the motion information of the corresponding N×N block, it is converted into motion vectors and reference indices of the current CU sub-unit, in the same manner as in the TMVP prediction method in the HEVC coding standard, where motion scaling and other procedures are applied. For example, the decoder checks whether the low delay condition is satisfied, (for example, the POC sequence numbers for all reference pictures for the current picture are less than the POC sequence number for the current picture), and possibly uses a motion vector MVx (a motion vector corresponding to the reference picture list X) to motion vector prediction MVy (with X equal to 0 or 1 and Y equal to 1−X) for each CU sub-unit.

2.2.2 Pairwise averaged candidates

Pairwise averaged candidates are generated by averaging the given pairs of candidates in the current pooled candidate list, and these given pairs are defined as {(0, 1), (0, 2), (1, 2), (0, 3), (1, 3 ), (2, 3)}, where the numbers denote the merging indices to the list of merged candidates. The average motion vectors are calculated separately for each reference list. If both motion vectors are available in the same list, the two motion vectors are averaged even if they point to different reference pictures; if one motion vector is available, that one motion vector is used directly; if no motion vector is available, this list is left invalid. The pairwise averaged candidates replace the combined candidates in the HEVC coding standard.

The complexity analysis of pairwise averaged candidates is summarized in Table 1. For the worst case additional calculations for averaging (last column in Table 1), 4 summation operations and 4 shift operations are needed for each pair (vectors MVx and MVy in the lists L0 and L1), as well as 4 reference index comparisons are needed for each pair (index refIdx0 is valid and index refIdx1 is valid in lists L0 and L1). There are 6 pairs here, resulting in 24 sums, 24 shifts, and 24 reference index comparisons in total. The combined candidates in the HEVC coding standard use 2 reference index comparisons for each pair (refIdx0 is valid in the L0 list and refIdx1 is valid in the L1 list), and there are 12 pairs, resulting in 24 reference index comparisons in total.

Table 1. Analysis of operations for pairwise averaged candidates

Join list size Max. number of potential candidates Max. number of comparisons Max. number of vector scalings MV Max. number of temporary candidates Additional local buffer Max. number of memory accesses Other 6, 8, 10 6 0 0 0 0 0 Replaces combined. candidates for the HEVC standard, additional calculations are needed for averaging

2.2.3 Local light compensation

Local Illumination Compensation (LIC) is based on a linear model of illumination changes using a scale factor a and a shift b. Moreover, this compensation is activated or deactivated adaptively for a coding unit (CU) encoded using inter-prediction.

When LIC is applied to a CU, a least squares method is applied to obtain parameters a and b using neighboring samples relative to the current CU and their corresponding reference samples. More specifically, as illustrated in FIG. 11, down-sampled (2:1 down-sampling) adjacent samples relative to the CU and corresponding samples (identified by motion information of the current CU or sub-CU) from the reference picture are used. The IC compensation parameters are obtained and applied for each prediction direction separately.

When a CU is encoded using the combining mode, the compensation flag LIC is copied from neighboring blocks in a manner similar to copying the motion information in the combining mode; otherwise, a LIC compensation flag is signaled to the CU to indicate whether LIC compensation is applied or not.

When LIC is enabled for an image, an additional redundancy check (RD) must be performed at the CU level to determine if LIC is applied to any CU. If LIC compensation is activated for some CU, use the mean-removed sum of absolute difference (MR-SAD) and the Hadamard-transformed sum of absolute differences with mean elimination (mean-removed sum of absolute Hadamard-transformed difference (MR-SATD)) instead of the sum of SAD and the sum of SATD, to search for integer motion of pixels and search for fractional motion of pixels, respectively.

To reduce the complexity of coding, the following coding scheme is used in the JEM model.

LIC compensation is not activated for the entire image when. there are no noticeable changes in illumination between the current image and its corresponding reference images. To identify this situation, the encoder calculates histograms for the current picture and for each reference picture corresponding to that current picture. If the histogram difference between the current picture and each of the reference pictures for that current picture is less than a specific threshold value, LIC compensation for the current picture is not activated; otherwise, activate this LIC compensation for the current picture.

2.2.4 Combined intra- and inter-prediction coding mode

In some embodiments, multi-hypothesis prediction is provided, with a combined intra- and inter-prediction coding mode being one way to generate multiple hypotheses.

When multi-hypothesis prediction is applied to improve the intra prediction mode, such multi-hypothesis prediction combines one intra prediction and one combined index prediction. In the CU to be combined, one flag is signaled for the combining mode to select an intra prediction mode from a list of candidate intra prediction modes when the flag is true. For the luminance component, the candidate mode list is selected from 4 intra-frame prediction modes, including DC mode, planar mode, horizontal mode, and vertical mode, and the size of this intra-frame prediction mode candidate list can be 3 or 6 depending on the block shape. When the width of the CU is greater than twice the height of that CU, the horizontal mode must be excluded from the list of intra prediction modes, and when the height of the CU is greater than twice the width of that CU, the vertical mode is excluded from the list of intra prediction modes. One intra prediction mode selected by the intra prediction mode index and one combined index prediction selected by the pooling index are combined using weighted averaging. Chroma is always in DM mode with no additional signaling. The weighting coefficients for combining the prediction results are determined as follows. When DC mode or planar mode is selected, or the coding block width or height (CB) is less than 4, equal weighting factors are applied. For those CB blocks for which the width and height of the CB block are not less than 4 when the horizontal/vertical mode is selected, one CB block is first vertically/horizontally divided into four regions of the same area. Each group of weights, denoted as (w_intrai, w_interi), where i takes values from 1 to 4 and (w_intra1, w_inter1) = (6, 2), (w_intra2, w_inter2) = (5, 3), (w_intra3, w_inter3 ) = (3, 5), and (w_intra4, w_inter4) = (2, 6) will be applied to the corresponding region. Here, group (w_intra1, w_inter1) is for the area closest to the reference samples, and group (w_intra4, w_inter4) is for the area farthest from the reference samples. The combined prediction can then be computed by summing the two weighted predictions and right shifting by 3 bits. Moreover, the result of the intra prediction mode for predictors related to the intra prediction hypothesis can be stored as a reference for the next neighboring CUs.

Generalized bidirectional prediction (interpolation)

In conventional bidirectional prediction, the predictors for lists L0 and L1 are averaged to generate a final predictor using the same weights of 0.5. The predictor generation formula is given as Equation (3) (Equ. (3))

P _{TraditionalBiPred} = (P _L0 + P _L1 + RoundingOffset) >> shiftNum, … (1)

In Equation (3) (Equ. (3)), the parameter PTraditionalBiPred represents the final predictor for conventional bidirectional prediction, PL0 and PL1 denote predictors from the lists L0 and L1, respectively, and the parameters RoundingOffset and shiftNum are used to normalize the final predictor.

Generalized Bi-prediction (GBI) is proposed to allow different weights to be applied to predictors from L0 and L1 lists. The generation of predictors is described by Equation (4) (Equ. (4)).

P _GBi = ( (1-w ₁ )* P _L0 + w ₁ * P _L1 + RoundingOffset _GBi ) >> shiftNum _GBi , … (2)

In Equation (4) (Equ. (4)), the parameter PGBi denotes the final prediction predictor GBi. The coefficients (1-w1) and w1 are the selected GBI prediction weights applied to the predictors from lists L0 and L1, respectively. The RoundingOffsetGBi and shiftNumGBi parameters are used to normalize the final predictors in the GBi prediction.

The table of supported weights w1 is {-1/4, 3/8, 1/2, 5/8, 5/4}. Here, one group of equal weights and four groups of unequal weights are supported. For the case of equal weights, the procedure for generating the final predictor is exactly the same as in the normal bidirectional prediction mode. For cases of true bidirectional prediction under random access (RA) conditions, the number of candidate weight groups is reduced to three.

For the advanced motion vector prediction (AMVP) mode, the choice of GBI prediction weights is signaled explicitly at the CU level if the CU is encoded using bi-directional interpolation. For merge mode, the choice of weights is "inherited" from the merge candidate. For this purpose, the GBI prediction mode supports a decoder-side motion vector refinement (DMVR) mode to generate a weighted average over the template as well as a final predictor for BMS-1.0.

2.2.6 Motion vector limit expression

In some embodiments, an ultimate motion vector expression (UMVE) is provided. The UMVE parameter is used in conjunction with skip mode or merge mode with a suggested way of expressing the motion vector.

The UMVE parameter reuses the merged candidate as the same as used in the VVC encoding standard. From the set of combined candidates, one candidate can be selected and further expanded by the proposed method of expressing the motion vector.

The UMVE parameter offers a new motion vector expression with simplified signaling. This way of expression contains the starting point, the amount of movement, and the direction of movement.

This proposed method uses the merged candidate list as it is. But for the UMVE extension, only candidates that have a default merge type (MRG_TYPE_DEFAULT_N) are considered.

The base candidate index defines the starting point. This base candidate index designates the best candidate from the pool of candidates in the list as follows.

Table 1. Index (IDX) of the base candidate

Index (IDX) of the underlying candidate 0 1 2 3 Nth MVP 1st MVP 2nd MVP 3rd MVP 4th MVP

If the number of base candidates is 1, the base candidate IDX index is not signaled.

The distance index is information about the amount of movement. The distance index indicates a predetermined distance from the start point information. This preset distance is defined as follows:

Table 2. Index (IDX) distance

Index (IDX) distance 0 1 2 3 4 5 6 7 Distance in pixels (pel) 1/4-pel 1/2-pel 1-pel 2-pel 4-pel 8-pel 16-pel 32-pel

The direction index represents the direction of the motion vector difference (MVD) relative to the starting point. A direction index can represent four directions, as shown below.

Table 3. Index (IDX) directions

Index (IDX) directions 00 01 10 eleven x-axis + - Not applicable Not applicable y-axis Not applicable Not applicable + -

The UMVE extension flag is signaled immediately after the transmission of the skip flag and the merge flag. If the skip and merge flag is true, the UMVE flag is parsed. If the UMVE flag is 1, the UMVE extension syntax is parsed. But if this flag is not equal to 1, the affinity flag (AFFINE) is parsed. If the AFFINE flag is 1, it means affine (AFFINE) mode. But if this flag is not equal to 1, the skip/merge index for the skip/merge mode from the VTM document is parsed.

An additional row buffer due to the emergence of UMVE candidates is not required since the skip/merge candidate from software is directly used as the base candidate. Using the input index UMVE, determine the addition of the MV vector just before motion compensation. There is no need to keep a long string buffer for this.

2.2.7 Motion vector prediction based on history

Our previous patent application, P1805028401H, uses one or more lookup tables with at least one stored motion candidate to predict motion information for a block.

A history-based motion vector prediction (HMVP) method is provided in which an HMVP prediction candidate is defined as motion information of a previously encoded block. In the encoding/decoding process, a multi-candidate HMVP prediction table is maintained. This table is emptied when a new slice is marked. Whenever an inter-prediction encoded block is encountered, its associated motion information is added to the last input table position as a new HMVP prediction candidate. The overall coding flow is shown in FIG. 13.

In one example, the table size is set to L (eg, L = 16 or 6 or 44), which means that up to L total of HMVP prediction candidates can be entered in the table.

In one embodiment, if there are more than L HMVP prediction candidates from previously coded blocks, the First-In-First-Out (FIFO) rule is applied so that the table always contains the L most recent previously coded blocks. movement candidates. In FIG. 14 shows an example in which the FIFO rule is applied to delete one HMVP prediction candidate from the table used in the proposed method and add a new candidate to the table.

In another embodiment, each time a new motion candidate is added (eg, when the current block is encoded in non-affine mode and using inter prediction), a redundancy check is first performed to identify if there are identical or similar motion candidates in the LUTs.

2.2.8 Symmetric motion vector difference

In some embodiments, a symmetric motion vector difference (SMVD) approach has been proposed to more efficiently encode the MVD difference.

First, at the slice level, the variables BiDirPredFlag, RefIdxSymL0 and RefIdxSymL1 are defined as follows:

First, reference picture list 0 is searched for the forward direction reference picture closest to the current picture. If one is found, the variable RefIdxSymL0 is set equal to the reference index of this forward image.

In the reference picture list 1, a reverse direction reference picture closest to the current picture is searched. If one is found, the variable RefIdxSymL1 is set equal to the reference index of this reverse image.

If both forward and backward images are found, the BiDirPredFlag flag is set to 1.

Otherwise, the following applies:

Reference picture list 0 is searched for the reverse direction reference picture closest to the current picture. If one is found, the variable RefIdxSymL0 is set equal to the reference index of this reverse image.

In the reference picture list 1, a forward direction reference picture closest to the current picture is searched. If one is found, the variable RefIdxSymL1 is set equal to the reference index of this forward image.

If both reverse and forward images are found, the BiDirPredFlag flag is set to 1. Otherwise, the BiDirPredFlag flag is set to 0.

Second, at the CU level, a symmetric mode flag is explicitly signaled indicating whether symmetric mode is applied or not if the prediction direction for the CU in question is "bidirectional" and the BiDirPredFlag flag is 1.

When this flag is true, only the mvp_l0_flag flag, the mvp_l1_flag flag and the MVD0 difference are explicitly signaled. The reference indexes are set to RefIdxSymL0, RefIdxSymL1 for list 0 and list 1, respectively. The MVD1 difference is simply set to -MVD0. The final motion vectors are defined by the formulas below.

Modifications to the coding unit syntax are shown in Table 2.

Table 2. Syntax modifications of a coding unit

2.2. 9 Combined CIIP prediction mode in VTM4 standard

In the VTM4 standard, when a CU is encoded in combining mode, and if that CU contains at least 64 luma samples (in other words, the product of the width of the CU and the height of that CU is not less than 64), an additional flag is signaled for indicating whether the combined inter-picture/intra-picture prediction (CIIP) mode is applied to the current CU.

To generate a CIIP combined mode prediction, an intra prediction mode is first determined based on two additional syntax elements. Up to four possible intra prediction modes can be used: DC mode, planar mode, horizontal mode, or vertical mode. Then, inter-frame and intra-frame prediction signals are generated using regular intra-frame and inter-frame prediction procedures. Finally, these inter- and intra-prediction signals are weighted averaged to obtain a combined CIIP prediction.

1. Determination of intra-prediction mode

Up to 4 intra-prediction modes, including DC mode, PLANAR mode, HORIZONTAL mode, and VERTICAL mode, can be used to predict the luminance component in the combined CIIP prediction mode. If the CU is very long in width (in other words, the width is more than twice the height), then the horizontal mode is not allowed. If the CU is very narrow (in other words, the height is more than twice the width), then vertical mode is not allowed. In these cases, only 3 intra prediction modes are allowed.

The CIIP combined prediction mode uses the 3 most probable modes (MPM) for intra prediction. The list of such most likely candidate modes for combined prediction (CIIP MPM) is formed as follows:

- Neighboring blocks on the left and top are designated as A and B, respectively

- Intra-prediction modes for block A and block B, denoted as. intraModeA and intraModeB, respectively, are defined as follows:

○ Let X be A or B

○ The intraModeX parameter is set to DC if 1) block X is not available; or 2) block X is not predicted in the combined CIIP mode and intra prediction mode; 3) block B is outside the current CTU

○ Otherwise, the intraModeX parameter is set to 1) DC or PLANAR if the intra prediction mode for block X is DC mode or PLANAR mode; or 2) VERTICAL mode if the intra frame prediction mode for block X is a "vertical type" angle mode (number greater than 34), or 3) HORIZONTAL mode if the intra frame prediction mode for block X is a "horizontal type" angle mode (number no more than 34)

- If parameters. intraModeA and intraModeB are the same:

○ If intraModeA is set to PLANAR or DC, then the three MPM modes are {PLANAR, DC, VERTICAL} in that order

○ Otherwise, the three MPM modes are {intraModeA, PLANAR, DC} in that order

- Otherwise (parameters intraModeA and intraModeB are different):

○ The first two MPM modes are set to {intraModeA, intraModeB} in this order

○ The uniqueness of the PLANAR, DC and VERTICAL modes is checked in this order against the first two candidate MPM modes; once a unique mode is found, it is added as a third MPM mode

If the CU has a very wide or very narrow shape as defined above, the MPM mode flag is considered to be 1 without signaling. Otherwise, an MPM mode flag is signaled to indicate if the intra-prediction mode from the combined CIIP mode is one of the CIIP MPM candidate modes.

If the MPM mode flag is 1, then an MPM mode index is signaled to indicate which of the candidate MPM modes is used for intra-prediction in the combined CIIP mode. Otherwise, if the MPM mode flag is 0, a mode "not present" in the MPM candidate mode list is set as the intra-prediction mode. For example, if the PLANAR mode is not in the MPM candidate mode list, then the PLANAR mode is the missing mode, and the PLANAR mode is set as the intra-prediction mode. Since 4 possible intra-prediction modes are allowed in the CIIP combined prediction mode, and the list of candidate MPM modes contains only 3 intra-prediction modes, one of the 4 possible modes should be the missing mode indicated.

Chroma is always in DM mode without additional signaling; in other words, the chrominance component always uses the same prediction mode as the luminance component.

An indication of the intra-prediction mode applied to a CU encoded in the combined CIIP mode will be kept and this mode will be used for intra-frame coding of future adjacent CUs.

2.2.9.2 Combining inter-frame and intra-frame prediction signals

The inter prediction signal P _inter in the combined CIIP mode is obtained using the same inter prediction procedure as applied to the normal, regular combining mode; and the intra prediction signal P _intra is determined using the intra prediction mode applied in the combined CIIP mode, following a normal, regular intra prediction procedure. Then, the intra prediction and inter prediction signals are combined by weighted averaging, where the value of the weighting factor depends on the intra prediction mode, and where the sample is located in the coding block, as follows:

- If the intra prediction mode is DC mode or planar mode, or if the block width or block height is less than 4, then the same weights are applied to the intra prediction and inter prediction signals.

- Otherwise, the weights are determined based on the intra-prediction mode (either horizontal mode or vertical mode in this case) and the sample position in the block. Take the horizontal prediction mode as an example (the weights for the vertical mode are determined in a similar way, but in the orthogonal direction). Let W denote the width of the block and H the height of this block. The coding block is first divided into four parts of equal area, each with a size of (W/4)xH. Starting from the part closest to the intra prediction reference samples to the part farthest from these intra prediction reference samples, the weighting coefficient wt for each of the 4 regions is set to 6, 5, 3, and 2, respectively. The final CIIP combined mode prediction signal is determined using the following:

ii Combined CIIP prediction mode in VTM5 standard

In the VTM5 standard, when a CU is encoded in merge mode, if that CU contains at least 64 luma samples (in other words, the product of the width of the CU and the height of that CU is at least 64), and if both dimensions and the width of the unit A CU and a CU height less than 128 luma samples signal an additional flag to indicate that a combined inter-frame/intra-picture prediction (CIIP) mode is applied to the current CU. As the name itself indicates, the combined CIIP prediction mode combines an inter prediction signal and an intra prediction signal. The inter prediction signal P _inter in the combined CIIP mode is obtained using the same inter prediction procedure as applied to the normal, regular combining mode; and the _intra intra prediction signal P is determined using the intra prediction mode applied in the combined CIIP mode, following the normal regular intra prediction procedure in the planar mode. Then, the intra and inter prediction signals are combined by weighted averaging, where the weight value is calculated depending on the coding modes for the top and left adjacent blocks (shown in FIG. 16) as follows:

- If the up-neighbor is available and encoded using intra-prediction, then the isIntraTop parameter is set to 1, otherwise the isIntraTop parameter is set to 0;

- If the left neighbor is available and encoded using intra-prediction, then the isIntraLeft parameter is set to 1, otherwise the isIntraLeft parameter is set to 0;

- If (isIntraLeft + isIntraTop) is 2, then the weight wt is set to 3;

- Otherwise, if (isIntraLeft + isIntraTop) is 1, then the weight wt is set to 2;

- Otherwise, the weighting factor wt is set to 1.

The combined CIIP prediction result is generated as follows:

In FIG. 16 shows the top and left neighbor blocks used to determine the weights for the combined CIIP prediction mode.

2.3. Intra prediction determination procedure

In today's version of the VTM-4.0 document, when encoding one block using intra-prediction, one most likely mode (MPM) flag is first signaled. If the MPM mode flag is true, then the index to the MPM mode list is further signaled. Otherwise, an index to non-MPM modes is signaled.

The relevant syntax elements, symmetry, and decoding procedure in the most recent version of the VVC encoding standard (JVET-M1001_v7) are as follows:

Relevant Syntax

Syntax of coding units

Semantics

The syntax elements intra_luma_mpm_flag[ x0 ][ y0 ], intra_luma_mpm_idx[ x0 ][ y0 ] and intra_luma_mpm_remainder[ x0 ][ y0 ] specify the intra-frame prediction mode for luma samples. The array indices x0, y0 specify the position ( x0 , y0 ) of the top left luma sample of the coding block in question relative to the top left luma sample of the image. When the parameter intra_luma_mpm_flag[ x0 ][ y0 ] is equal to 1, the intra prediction mode is output from the adjacent intra prediction coding unit according to clause 8.4.2.

When the parameter intra_luma_mpm_flag[ x0 ][ y0 ] is not present, it is assumed to be 1.

Decoding procedure

Derivation Procedure for Intra-Picture Luminance Prediction Mode

The input to this procedure is:

position ( xCb , yCb ) of the luminance component, specifying the upper left sample of the current luminance component coding block relative to the upper left sample of the luminance component of the current image,

variable cbWidth specifying the width of the current coding block in luma samples,

variable cbHeight specifying the height of the current coding block in luma samples.

In this procedure, the parameter IntraPredModeY[ xCb ][ yCb ] of the intra-prediction mode of the luminance component is determined.

Table 8-1 specifies the IntraPredModeY[ xCb ][ yCb ] parameter values for intra-prediction mode and associated names.

Table 8-1. Specification of Intra Prediction Modes and Associated Names

Intra-prediction mode Associated name 0 INTRA_PLANAR 1 INTRA_DC 2..66 INTRA_ANGULAR2..INTRA_ANGULAR66 81..83 INTRA_LT_CCLM, INTRA_L_CCLM, INTRA_T_CCLM

Note: The intra-frame prediction modes INTRA_LT_CCLM, INTRA_L_CCLM and INTRA_T_CCLM are only applicable to chroma.

The IntraPredModeY[xCb][yCb] parameter is determined through the following ordered steps:

1. Adjacent positions ( xNbA, yNbA ) and ( xNbB, yNbB ) are set equal to ( xCb − 1, yCb + cbHeight − 1 ) and ( xCb + cbWidth − 1, yCb − 1 ), respectively.

2. For X replaced by A or B, the variables candIntraPredModeX are defined as follows:

- The procedure for determining availability for a block, as specified in Article 6.4.X, [Rev. (BB): Neighbor block availability check procedure yet to be defined] is invoked by setting position ( xCurr, yCurr ) to ( xCb, yCb ) and neighbor position ( xNbY, yNbY ) to ( xNbX, yNbX ) as input data, and the output data is assigned to the parameter availableX.

- The intra-prediction candidate mode candIntraPredModeX is determined as follows:

- If one or more of the following conditions are true, the candIntraPredModeX parameter is set to INTRA_PLANAR.

- The availableX variable is set to FALSE.

- Parameter CuPredMode[ xNbX ][ yNbX ] is not equal to MODE_INTRA flag ciip_flag[ xNbX ][ yNbX ] is not equal to 1.

- Flag pcm_flag[ xNbX ][ yNbX ] is 1.

- X is equal to B and yCb − 1 is less than ( ( yCb. >>. CtbLog2SizeY ). <<. CtbLog2SizeY ).

- Otherwise, the parameter candIntraPredModeX is set equal to the parameter IntraPredModeY[ xNbX ][ yNbX ].

3. The ispDefaultMode1 and ispDefaultMode2 variables are defined as follows:

- If the IntraSubPartitionsSplitType parameter is ISP_HOR_SPLIT, the ispDefaultMode1 parameter is set to INTRA_ANGULAR18 and the ispDefaultMode2 parameter is set to INTRA_ANGULAR5.

- Otherwise, the ispDefaultMode1 parameter is set to INTRA_ANGULAR50 and the ispDefaultMode2 parameter is set to INTRA_ANGULAR63.

4. Parameter candModeList[ x ] for x = 0..5 is defined as follows:

- If the parameter candIntraPredModeB is equal to candIntraPredModeA and the parameter candIntraPredModeA is greater than INTRA_DC, the parameter candModeList[ x ] at x = 0..5 is defined as follows:

- If IntraLumaRefLineIdx[ xCb ][ yCb ] is 0 and IntraSubPartitionsSplitType is ISP_NO_SPLIT, the following applies:

candModeList[ 0 ] = candIntraPredModeA(8-9)

candModeList[ 1 ] = INTRA_PLANAR(8-10)

candModeList[ 2 ] = INTRA_DC(8-11)

candModeList[ 3 ] = 2 + ( ( candIntraPredModeA + 61 ) % 64 ) (8-12)

candModeList[ 4 ] = 2 + ( ( candIntraPredModeA − 1 ) % 64 ) (8-13)

candModeList[ 5 ] = 2 + ( ( candIntraPredModeA + 60 ) % 64 ) (8-14)

- Otherwise (IntraLumaRefLineIdx[ xCb ][ yCb ] is not equal to 0 or IntraSubPartitionsSplitType is not equal to ISP_NO_SPLIT), the following applies:

candModeList[ 0 ] = candIntraPredModeA(8-15)

candModeList[ 1 ] = 2 + ( ( candIntraPredModeA + 61 ) % 64 ) (8-16)

candModeList[ 2 ] = 2 + ( ( candIntraPredModeA − 1 ) % 64 ) (8-17)

- If one of the following conditions is true,

- The IntraSubPartitionsSplitType parameter is ISP_HOR_SPLIT and the parameter candIntraPredModeA. less than INTRA_ANGULAR34,

- The parameter IntraSubPartitionsSplitType is equal to ISP_VER_SPLIT and the parameter candIntraPredModeA. not less than INTRA_ANGULAR34,

- Parameter IntraLumaRefLineIdx[ xCb ][ yCb ] is not equal to 0, the following applies:

candModeList[ 3 ] = 2 + ( ( candIntraPredModeA + 60 ) % 64 ) (8-18)

candModeList[ 4 ] = 2 + ( candIntraPredModeA % 64 ) (8-19)

candModeList[ 5 ] = 2 + ( ( candIntraPredModeA + 59 ) % 64 ) (8-20)

- Otherwise, the following applies:

candModeList[ 3 ] = ispDefaultMode1 (8-21)

candModeList[ 4 ] = ispDefaultMode2 (8-22)

candModeList[ 5 ] = INTRA_PLANAR(8-23)

- Otherwise, if candIntraPredModeB is not equal to candIntraPredModeA and candIntraPredModeA or candIntraPredModeB is greater than INTRA_DC, the following applies:

- Variables minAB and maxAB are defined as follows:

minAB = Min( candIntraPredModeA, candIntraPredModeB ) (8-24)

maxAB = Max( candIntraPredModeA, candIntraPredModeB ) (8-25)

- If the parameters candIntraPredModeA and candIntraPredModeB are both greater than INTRA_DC, the parameter candModeList[ x ] at x = 0..5 is defined as follows:

candModeList[ 0 ] = candIntraPredModeA(8-26)

candModeList[ 1 ] = candIntraPredModeB(8-27)

- If IntraLumaRefLineIdx[ xCb ][ yCb ] is 0 and IntraSubPartitionsSplitType is ISP_NO_SPLIT, the following applies:

candModeList[ 2 ] = INTRA_PLANAR(8-28)

candModeList[ 3 ] = INTRA_DC(8-29)

- If maxAB − minAB is between 2 and 62, inclusive, the following applies:

candModeList[ 4 ] = 2 + ( ( maxAB + 61 ) % 64 ) (8-30)

candModeList[ 5 ] = 2 + ( ( maxAB − 1 ) % 64 ) (8-31)

- Otherwise, the following applies:

candModeList[ 4 ] = 2 + ( ( maxAB + 60 ) % 64 ) (8-32)

candModeList[ 5 ] = 2 + ( ( maxAB ) % 64 ) (8-33)

- Otherwise, the parameter (IntraLumaRefLineIdx[ xCb ][ yCb ] is not equal to 0 or the parameter IntraSubPartitionsSplitType is not equal to ISP_NO_SPLIT), the following applies:

- When IntraSubPartitionsSplitType is not equal to ISP_NO_SPLIT and abs( candIntraPredModeB − ispDefaultMode1 ) is less than abs( candIntraPredModeA − ispDefaultMode1 ), the following applies:

candModeList[ 0 ] = candIntraPredModeB(8-34)

candModeList[ 1 ] = candIntraPredModeA(8-35)

- If maxAB − minAB is equal to 1, the following applies:

candModeList[ 2 ] = 2 + ( ( minAB + 61 ) % 64 ) (8-36)

candModeList[ 3 ] = 2 + ( ( maxAB − 1 ) % 64 ) (8-37)

candModeList[ 4 ] = 2 + ( ( minAB + 60 ) % 64 ) (8-38)

candModeList[ 5 ] = 2 + ( maxAB % 64 ) (8-39)

- Otherwise, if maxAB − minAB is 2, the following applies:

candModeList[ 2 ] = 2 + ( ( minAB − 1 ) % 64 ) (8-40)

candModeList[ 3 ] = 2 + ( ( minAB + 61 ) % 64 ) (8-41)

candModeList[ 4 ] = 2 + ( ( maxAB − 1 ) % 64 ) (8-42)

candModeList[ 5 ] = 2 + ( ( minAB + 60 ) % 64 ) (8-43)

- Otherwise, if maxAB − minAB is greater than 61, the following applies:

candModeList[ 2 ] = 2 + ( ( minAB − 1 ) % 64 ) (8-44)

candModeList[ 3 ] = 2 + ( ( maxAB + 61 ) % 64 ) (8-45)

candModeList[ 4 ] = 2 + ( minAB % 64 ) (8-46)

candModeList[ 5 ] = 2 + ( ( maxAB + 60 ) % 64 ) (8-47)

- Otherwise, the following applies:

candModeList[ 2 ] = 2 + ( ( minAB + 61 ) % 64 ) (8-48)

candModeList[ 3 ] = 2 + ( ( minAB − 1 ) % 64 ) (8-49)

candModeList[ 4 ] = 2 + ( ( maxAB + 61 ) % 64 ) (8-50)

candModeList[ 5 ] = 2 + ( ( maxAB − 1 ) % 64 ) (8-51)

- Otherwise (the parameter candIntraPredModeA or the parameter candIntraPredModeB is greater than INTRA_DC), the parameter candModeList[ x ] when x = 0..5 is defined as follows:

- If IntraLumaRefLineIdx[ xCb ][ yCb ] is 0 and IntraSubPartitionsSplitType is ISP_NO_SPLIT, the following applies:

candModeList[ 0 ] = candIntraPredModeA(8-52)

candModeList[ 1 ] = candIntraPredModeB(8-53)

candModeList[ 2 ] = 1 − minAB (8-54)

candModeList[ 3 ] = 2 + ( ( maxAB + 61 ) % 64 ) (8-55)

candModeList[ 4 ] = 2 + ( ( maxAB − 1 ) % 64 ) (8-56)

candModeList[ 5 ] = 2 + ( ( maxAB + 60 ) % 64 ) (8-57)

- Otherwise, if the parameter IntraLumaRefLineIdx[ xCb ][ yCb ] is not equal to 0, the following applies:

candModeList[ 0 ] = maxAB(8-58)

candModeList[ 1 ] = 2 + ( ( maxAB + 61 ) % 64 ) (8-59)

candModeList[ 2 ] = 2 + ( ( maxAB − 1 ) % 64 ) (8-60)

candModeList[ 3 ] = 2 + ( ( maxAB + 60 ) % 64 ) (8-61)

candModeList[ 4 ] = 2 + ( maxAB % 64 ) (8-62)

candModeList[ 5 ] = 2 + ( ( maxAB + 59 ) % 64 ) (8-63)

- Otherwise (IntraSubPartitionsSplitType is not equal to ISP_NO_SPLIT), the following applies:

candModeList[ 0 ] = INTRA_PLANAR(8-64)

candModeList[ 1 ] = maxAB(8-65)

candModeList[ 2 ] = 2 + ( ( maxAB + 61 ) % 64 ) (8-66)

candModeList[ 3 ] = 2 + ( ( maxAB − 1 ) % 64 ) (8-67)

candModeList[ 4 ] = 2 + ( ( maxAB + 60 ) % 64 ) (8-68)

candModeList[ 5 ] = 2 + ( maxAB % 64 ) (8-69)

- Otherwise, the following applies:

- If IntraLumaRefLineIdx[ xCb ][ yCb ] is 0 and IntraSubPartitionsSplitType is ISP_NO_SPLIT, the following applies:

candModeList[ 0 ] = candIntraPredModeA(8-70)

candModeList[ 1 ] = ( candModeList[0]. = =. INTRA_PLANAR ). ?. INTRA_DC. :. (8-71)

INTRA_PLANAR

candModeList[ 2 ] = INTRA_ANGULAR50 (8-72)

candModeList[ 3 ] = INTRA_ANGULAR18 (8-73)

candModeList[ 4 ] = INTRA_ANGULAR46 (8-74)

candModeList[ 5 ] = INTRA_ANGULAR54 (8-75)

- Otherwise, if the parameter IntraLumaRefLineIdx[ xCb ][ yCb ] is not equal to 0, the following applies:

candModeList[ 0 ] = INTRA_ANGULAR50 (8-76)

candModeList[ 1 ] = INTRA_ANGULAR18 (8-77)

candModeList[ 2 ] = INTRA_ANGULAR2 (8-78)

candModeList[ 3 ] = INTRA_ANGULAR34 (8-79)

candModeList[ 4 ] = INTRA_ANGULAR66 (8-80)

candModeList[ 5 ] = INTRA_ANGULAR26 (8-81)

- Otherwise, if the IntraSubPartitionsSplitType parameter is equal to ISP_HOR_SPLIT, the following applies:

candModeList[ 0 ] = INTRA_PLANAR(8-82)

candModeList[ 1 ] = INTRA_ANGULAR18 (8-83)

candModeList[ 2 ] = INTRA_ANGULAR25 (8-84)

candModeList[ 3 ] = INTRA_ANGULAR10 (8-85)

candModeList[ 4 ] = INTRA_ANGULAR65 (8-86)

candModeList[ 5 ] = INTRA_ANGULAR50 (8-87)

- Otherwise, if IntraSubPartitionsSplitType is ISP_VER_SPLIT, the following applies:

candModeList[ 0 ] = INTRA_PLANAR(8-88)

candModeList[ 1 ] = INTRA_ANGULAR50 (8-89)

candModeList[ 2 ] = INTRA_ANGULAR43 (8-90)

candModeList[ 3 ] = INTRA_ANGULAR60 (8-91)

candModeList[ 4 ] = INTRA_ANGULAR3 (8th)

candModeList[ 5 ] = INTRA_ANGULAR18 (8-93)

5. The parameter IntraPredModeY[ xCb ][ yCb ] is obtained by applying the following procedure:

- If the flag intra_luma_mpm_flag[ xCb ][ yCb ] is equal to 1, the parameter IntraPredModeY[ xCb ][ yCb ] is set equal. candModeList[ intra_luma_mpm_idx[ xCb ][ yCb ] ].

- Otherwise, the parameter IntraPredModeY[ xCb ][ yCb ] is obtained by applying the following ordered steps:

1. When parameter candModeList[ i ] is greater than candModeList[ j ] for i = 0..4 and for each i, j = ( i + 1 )..5, both values are replaced as follows:

( candModeList[ i ], candModeList[ j ] ) = Swap( candModeList[ i ], candModeList[ j ] ) (8-94)

2. The parameter IntraPredModeY[ xCb ][ yCb ] is obtained by applying the following ordered steps:

i. The parameter IntraPredModeY[ xCb ][ yCb ] is set to intra_luma_mpm_remainder[ xCb ][ yCb ].

ii. For i equal to 0 - 5, inclusive, when the parameter IntraPredModeY[ xCb ][ yCb ] is not less than candModeList[ i ], the value of IntraPredModeY[ xCb ][ yCb ] is increased by one.

Variable IntraPredModeY[ x ][ y ] at. x = xCb..xCb + cbWidth − 1 and y = yCb..yCb + cbHeight − 1 are set to IntraPredModeY[ xCb ][ yCb ].

3. Examples of Problems Solved by Embodiments of the Invention

In LIC compensation mode, two parameters, including the scaling parameter (scale factor) a and offset b, must be determined using adjacent reconstructed samples, which can cause latency problems.

The group of allowable weights used in GBI prediction is fixed, which may not be efficient.

The combined CIIP prediction mode is applied only to the non-skip mode combining mode, which may be inefficient.

In today's version, the CIIP combined mode flag should be retained because the intra prediction mode determination procedure for an intra prediction encoded block and the intra prediction mode determination procedure for blocks encoded in CIIP combined mode use the adjacent CIIP combined mode flag. block.

In today's version, it is possible to further improve the determination of the weights for the combined CIIP mode, for example, checking two neighboring blocks and three different pairs of weights can be simplified.

In today's version, in the process of determining the weights for the combined CIIP prediction mode, if the neighboring block is encoded in the mode. block-based delta pulse code modulation (BDPCM), this is considered an intra-prediction mode. However, it may be more reasonable to consider that this mode is not an intra-prediction mode, since the BDPCM modulation mode is designed for screen content coding.

4. Examples of options

In the following, the term "block" will be used to refer to a transform unit (TU)/prediction unit (PU)/coding unit (CU)/sub-unit in one of the TU/PUs. /CU etc.

The following detailed descriptions of the methods should be considered as examples to clarify the general concepts. These methods should not be interpreted in a narrow sense. Moreover, these methods can be combined in any way.

Assume that the coordinates (xCb, yCb) denote the position of the top left of the current box relative to the top left of the current image, the cbWidth and cbHeight parameters specify the width and height of the current box.

1. CIIP prediction mode flag or/and LIC compensation flag or/and diffuse filtering flag or/and two-way filtering flag or/and transform domain filtering flag or/and some other type of post-reconstruction filter activation flag may be restricted, to be false (and combined CIIP prediction mode or/and LIC compensation or/and diffusing filter or/and two-sided filter or/and transformed region filter may be implicitly not activated), depending on the coding modes of other blocks (such as adjacent or non-adjacent neighboring blocks and/or reference blocks).

a. When one flag is determined to be false, the corresponding method may not be applied.

b. When one flag is determined to be false, signaling indicating the use of such modes is skipped.

c. When one flag is determined to be false, an indication of the use of such modes may still be signaled, however, the values of such an indication are limited to be false in the conformance data bitstream and such modes are not applied.

d. In one example, whether one or more of several proposed constraints (such as 1.a, 1.b, and 1.c) apply or not may depend on the encoding modes of all or some of the adjacent and/or non-adjacent adjacent rows or columns.

i. Alternatively, whether or not to apply such a constraint may depend on at least the number N (N >= 1) of samples in adjacent or non-adjacent adjacent rows or columns that are NOT encoded in certain modes.

e. In one example, adjacent or non-adjacent adjacent rows may include a top row and/or a top right row.

f. In one example, adjacent or non-adjacent adjacent columns may include a left and/or bottom left and/or top left column.

g. In one example, said defined modes for a block other than the current block may include an intra-frame prediction mode and/or a CIIP combined prediction mode and/or a current picture reference (CPR) mode.

h. In one example, if any one of the adjacent/non-adjacent blocks in adjacent and/or non-adjacent rows or columns is encoded in a particular mode (e.g., CIIP intra-frame and/or combined prediction mode and/or CPR mode), one or more from proposed constraints (such as 1.a, 1.b and 1.c).

i. In one example, if all adjacent/non-adjacent blocks in adjacent and/or non-adjacent adjacent rows or columns are encoded in a particular mode (e.g., intra-prediction mode and/or combined CIIP mode and/or CPR mode), one or more of the proposed restrictions.

j. In one example, if at least N adjacent/non-adjacent blocks in an adjacent or non-adjacent row or columns are NOT encoded in a particular mode (e.g., CIIP intra-frame and/or combined prediction mode and/or CPR mode), one or more of the proposed restrictions (such as 1.a, 1.b and 1.c) do NOT apply.

k. In one example, whether one or more of the proposed constraints (such as 1.a, 1.b, and 1.c) should be applied or not may depend on the position of the current block.

i. In one example, if the current block is at the top of the current CTU (the current block and its top neighbor belong to different CTUs), the proposed restrictions do not apply.

ii. In one example, if the current block is on the left side of the current CTU (the current block and the block to its left belong to different CTUs), the proposed restrictions do not apply.

2. The flag of the CIIP prediction mode and/or the intra-frame prediction mode of the combined CIIP prediction mode may be stored together with motion information in a history-based motion vector prediction (HMVP) table.

a. In one example, when comparing motion information for two candidates (eg, during a truncation procedure), the CIIP prediction mode flag and/or the intra-frame prediction mode flag from the combined CIIP prediction mode are not taken into account.

b. In one example, when comparing motion information for two candidates (eg, during a truncation procedure), the CIIP prediction mode flag and/or the intra prediction mode flag from the combined CIIP prediction mode are taken into account.

c. In one example, when the merged candidate is from one of the HMVP prediction table input positions, the CIIP prediction mode flag for that input position is also copied to the merged candidate.

d. In one example, when the merging candidate is taken from one of the HMVP prediction table input positions, the CIIP prediction mode flag and intra prediction mode indication from that input position are also copied to the merged candidate.

3. Combined CIIP prediction mode can also be implemented for AMVP prediction mode (AMVP prediction mode or/and AMVP prediction with SMVD difference mode)

a. The combined CIIP prediction mode and/or intra-frame prediction mode flag from the adjacent/non-adjacent CIIP prediction mode can be "inherited" in the merge mode and/or the UMVE expression mode (also known as merge with motion vector difference mode). ), abbreviated as MMVD) for the current block.

b. A combined CIIP prediction mode flag and/or an intra prediction mode flag from a CIIP prediction mode may be signaled for a combining mode that is not a skip mode and/or a UMVE expression mode that is not a skip mode, and a combined CIIP prediction mode flag and/or intra-frame prediction mode from CIIP prediction mode for neighbor/non-contiguous blocks can be "inherited" in being skip mode merge mode and/or UMVE mode.

c. The combined CIIP prediction mode and/or intra prediction mode flag from the CIIP prediction mode can be signaled for being skip modes of the combining mode and/or UMVE expression mode, and the combined CIIP prediction mode and/or intra prediction mode flag from the CIIP prediction mode for neighboring/non-contiguous blocks can be "inherited" in non-skip modes merge mode and/or UMVE expression mode.

d. In one example, a combined CIIP prediction mode and intra prediction mode flag may be signaled in the AMVP prediction mode.

e, In one example, the CIIP combined prediction mode flag may be inherited in the combined mode and/or the UMVE expression mode, and if the CIIP combined prediction mode flag is true, the intra prediction mode signaling may be additionally transmitted if in the combined mode CIIP prediction, more than one intra-prediction mode is allowed.

f. In one example, the combined CIIP prediction mode and intra-frame prediction mode flag for adjacent/non-adjacent blocks in merge mode and/or UMVE expression mode may be inherited by the current block.

g. In one example, the CIIP prediction mode may not be activated for the skip mode.

h. In one example, when comparing two merged candidates, the combined CIIP prediction mode flag and/or the CIIP intra prediction mode flag may be ignored.

i. In one example, when comparing two merged candidates, the combined CIIP prediction mode flag and/or the CIIP intra prediction mode flag may be taken into account.

4. The CIIP combined prediction mode may not be activated for pairwise prediction or combined bidirectional prediction or other kinds of virtual/artificial candidates (eg, zero motion vector candidates).

a. Alternatively, if one of the two candidates participating in pairwise prediction or combined bi-directional prediction receives a combined CIIP prediction, the combined CIIP prediction mode may be activated for the pairwise or bi-directional combined prediction candidate.

ii. In one example, the intra-prediction mode from the combined CIIP prediction mode may be inherited.

iii. In one example, an intra prediction mode indication may be explicitly signaled.

b. Alternatively, if both candidates participating in pairwise prediction or combined bi-directional prediction receive combined CIIP prediction, the combined CIIP prediction mode may be activated for the pairwise or bi-directional combined prediction candidate.

iv. In one example, the intra-prediction mode for one of the two candidates may be inherited.

v. In one example, an intra-prediction mode may be determined from a plurality of intra-prediction modes for two candidates, and used for a pairwise or bidirectionally predictive merging candidate.

vi. In one example, an intra prediction mode indication may be signaled explicitly in the form of signalling.

5. Adjacent and/or non-adjacent spatially reconstructed samples required in CIIP combined prediction mode or/and for diffusing filtering or/and for bidirectional filtering or/and for filtering in the transformed region or/and for activating another type of post-reconstruction filtering may be replaced by corresponding reference picture samples (such as adjacent and/or spatially non-adjacent reference block samples, as shown in FIG. 17).

a. In one example, if the current block is bidirectionally predicted, adjacent samples from two reference blocks may be averaged to generate the final adjacent samples.

b. In one example, if the current block is bidirectionally predicted, adjacent samples of one of the two reference blocks may be used as the final adjacent samples.

c. In one example, if the current block is bidirectionally predicted, adjacent samples from two reference blocks may be weighted averaged to generate final adjacent samples if GBI prediction with unequal weights or weighted prediction or LIC compensation is applied to the current block.

d. In one example, corresponding samples in reference pictures (eg, neighboring samples of a reference block) can be identified by motion information for the current block.

e. In one example, corresponding samples in reference pictures (eg, neighboring samples from a reference block) can be identified by modified motion information of the current block. For example, the motion vector may be rounded to integer precision before being used to identify neighboring samples.

f. In one example, corresponding samples in the reference pictures (eg, adjacent samples from the reference samples) are identified by motion vectors to within an integer pixel.

i. In one example, the reference block vector MV is first rounded to an integer pixel. The rounded MV vector is used to identify adjacent reference block samples.

ii. In one example, the proposed substitution is applied when the current block is encoded using motion information up to an integer pixel. Therefore, rounding is not required.

g. In one example, the proposed substitution can only be applied to a particular color component, such as the luminance component.

i. Alternatively, the proposed substitution can be applied to all color components.

6. It is proposed to prevent the previously coded CIIP combined prediction mode flags from being used to code the next blocks.

a. In one example, the procedure for checking CIIP combined prediction mode flags from previously coded blocks is omitted to improve throughput.

b. In one example, the procedure for checking CIIP combined prediction mode flags from adjacent blocks is omitted when determining the intra prediction mode.

i. In one example, for one adjacent block, if encoded in CIIP combined prediction mode, a particular mode (such as planar mode) may be set as the associated intra-prediction mode. Alternatively, in addition, the associated intra-prediction mode may be used in generating the list of MPM modes.

ii. In one example, for one adjacent block, if it is encoded in the CIIP combined prediction mode or in the normal inter prediction mode, a particular mode (such as planar mode) can be set as the associated intra prediction mode. Alternatively, in addition, the associated intra-prediction mode may be used in generating the list of MPM modes.

iii. In one example, intra prediction mode indication for blocks encoded in combined CIIP prediction mode may not be stored, and blocks encoded in combined CIIP prediction mode may be considered unavailable during the decoding process. Alternatively, blocks encoded in the combined CIIP prediction mode may be viewed in the same manner as in the conventional inter prediction mode.

c. Alternatively, moreover, it is proposed to remove the combined CIIP prediction mode flag from the storage device in order to save the required memory size for storing the mode information.

7. It is proposed that the CIIP combined prediction mode flag be encoded by bypass coding.

a. Alternatively, the CIIP combined prediction mode flag may be encoded in a context-dependent manner without reference to neighboring block CIIP combined prediction mode flags.

8. It is proposed that the method of constructing the weighted sum in the combined CIIP prediction mode may depend on the color components.

a. For example, the weight values in the CIIP combined mode are different for the main color component (eg, G component) and for other color components (eg, B and R components).

b. For example, the values of the weight coefficients in the combined CIIP mode are different for the luminance component and for the chrominance components.

c. For example, the weight values for inter-prediction and intra-prediction are equal for chrominance components.

9. It is proposed that when the selection of weights is made according to adjacent blocks, then the adjacent block, if encoded in the CIIP combined prediction mode, can be considered as a block encoded in the inter prediction mode.

a. Alternatively, when the selection of weights is made according to adjacent blocks, then the adjacent block, if encoded in the CIIP combined prediction mode, may be considered as a block encoded in the intra prediction mode.

10. The method proposed above can be applied under certain conditions such as block sizes, slice/image/tile types, or motion information.

a. In one example, when the block contains less than M*H samples, for example, 16 or 32 or 64 samples of the luminance component, the proposed method is not allowed.

b. Alternatively, when the minimum width or/and height of the box is less than or less than X, the proposed method is not allowed. In one example, the X parameter is set to 8.

c. Alternatively, when the minimum width or/and height of the block is not less than X, the proposed method is not allowed. In one example, the X parameter is set to 8.

d. Alternatively, when the box width is > th1 or >=th1 and/or the box height is > th2 or >= th2, the proposed method is not allowed. In one example, the value of th1 and/or th2 is set to 8.

e. Alternatively, when the block width is < th1 or <=th1 and/or a block height is < th2 or <a=th2, the proposed method is not allowed. In one example, the value of th1 and/or th2 is set to 8.

11. The number of valid weight pairs (wIntra, wInter) used in the combined CIIP prediction mode can be reduced from 3 to 2, denoted as (a, b) and (c, d).

a. In one example, these two pairs are defined as {(1,3) and (3,1)}; or {(1,3) and (2, 2)}; or {(3,1) and (2, 2)}; or {(3, 5) and (4, 4)} or {(5, 3) and (4, 4)} or {(1, 7) and (4, 4)} or {(7, 1) and (4, 4)}.

b. In one example, a pair of weights is determined based on only one neighboring block A.

i. In one example, if one adjacent block A is available and encoded in intra prediction mode, the values (wIntra, wInter) are set to (a, b); Otherwise, the values (wIntra, wInter) are set to (c, d).

ii. In one example, block A is a neighboring block on the left.

iii. In one example, block A is a neighboring block from above.

c. In one example, a weight pair is determined based on two or more neighboring blocks, and at least one of the neighboring blocks satisfies certain conditions.

i. In one example, if at least one of adjacent blocks A and B is available and encoded in intra-prediction mode, the values (wIntra, wInter) are set to (a, b); Otherwise, the values (wIntra, wInter) are set to (c, d).

1. In one example, block A is the adjacent block on the left and block B is the adjacent block on the top.

d. In one example, a weight pair is determined based on two or more neighboring blocks, and the same conditions are satisfied for each of the neighboring blocks.

i. In one example, if both adjacent blocks A and B are available and encoded in intra prediction mode, the values (wIntra, wInter) are set to (a, b); Otherwise, the values (wIntra, wInter) are set to (c, d).

1. In one example, block A is the adjacent block on the left and block B is the neighboring block on the top.

e. In one example, the values (a, b) and (c, d) can be set as follows:

1. In one example, (a, b) is set to (2, 2) or (3, 1).

2. In one example, (c, d) is set to (1, 3).

3. In one example, at least one of two conditions is true: a is not equal to c or b is not equal to d.

4. (a, b) is not equal to (c, d).

f. In one example, an adjacent block (eg, block A or B) mentioned above is a contiguous or non-contiguous spatially adjacent block or a temporal adjacent block.

i. In one example, adjacent block A or B is a neighboring block to the left (or top).

ii. In one example, adjacent blocks A and B are neighboring blocks on the left and top, respectively.

iii. In one example, the adjacent block on the left covers the position (xCb − 1, yCb + cbHeight − 1).

iv. In one example, the adjacent block from above covers the position (xCb + cbWidth − 1, yCb − 1).

v. In one example, the adjacent block on the left covers position (xCb − 1, yCb).

vi. In one example, the adjacent block from above covers position (xCb, yCb − 1).

g. For the examples above, combined CIIP prediction is done as follows:

where the offset is set to (1<< (N-1)) or 0, and N can be set to log2(wIntra + wInter).

12. The number of valid weight pairs (wIntra, wInter) used in the combined CIIP prediction mode can be reduced from 3 to 1.

a. In one example, one pair of weights is defined as (1,3) or (2, 2) or (1,7) or (2, 6) or (3, 5) or (4, 4).

b. In one example, the values (wIntra, wInter) are set to (2, 2).

c. In one example, the values (wIntra, wInter) are set to (1, 3).

d. For the examples above, combined CIIP prediction is done as follows:

where the offset is set to (1<< (N-1)) or 0, and N can be set to log2(wIntra + wInter).

13. Pairs of weight coefficients (wIntra, wInter) may be determined based on whether one or more neighboring blocks are encoded in the combined CIIP prediction mode.

a. The weight pair used for the current block may be determined from those used for the previously encoded block.

b. In one example, a pair of weights is determined based on only one neighboring block A.

i. In one example, if one neighbor block A is encoded in CIIP combined prediction mode, the values (wIntra, wInter) for the current block are set equal to the values (wIntra, wInter) for that neighbor block A; otherwise, if neighboring block A is available and encoded in intra prediction mode, the values (wIntra, wInter) are set to (a, b); otherwise, the values (wIntra, wInter) are set to (c, d).

ii. In one example, if one neighboring block A is encoded in CIIP combined prediction mode, the values (wIntra, wInter) for the current block are set equal to the values (wIntra, wInter) for the neighbor; otherwise, the values (wIntra, wInter) are set to (a, b).

iii. For the examples above, the following might apply:

1. In one example, (a, b) is set to (2, 2) or (3, 1).

2. In one example, (c, d) is set to (1, 3).

3. In one example, at least one of two conditions is true: a is not equal to c; b is not equal to d.

c. In one example, a weight pair is determined based on two or more neighboring blocks, and for at least one of these neighboring blocks, certain conditions are met.

i. Several adjacent blocks may be checked in a particular check order (eg, check the block on the left first and then check the block on top) to identify the use of the combined CIIP prediction mode.

ii. In one example, if at least one of neighboring blocks A and B is encoded in combined CIIP prediction mode, the values (wIntra, wInter) for the current block are set to (wIntra, wInter) for the first neighboring block encoded in combined CIIP prediction mode in a specific order of verification; otherwise, if at least one of the neighboring blocks A and B is available and encoded in intra prediction mode, the values (wIntra, wInter) are set to (a, b); otherwise, the values (wIntra, wInter) are set to (c, d).

iii. For the examples above, the following may apply:

1. In one example, (a, b) is set to (2, 2) or (3, 1).

2. In one example, (c, d) is set to (1, 3).

3. In one example, at least one of two conditions is true: a is not equal to c; b is not equal to d.

iv. In one example, if at least one of neighboring blocks A and B is encoded in CIIP combined prediction mode, the values (wIntra, wInter) for the current block are set equal to the values (wIntra, wInter) for the first CIIP combined prediction mode coded neighbor block in specific order of verification; otherwise, if both neighboring blocks A and B are available and coded in intra prediction mode, the values (wIntra, wInter) are set to (a, b); otherwise, the values (wIntra, wInter) are set to (c, d).

v. In one example, if at least one of neighboring blocks A and B is encoded in CIIP combined prediction mode, the values (wIntra, wInter) for the current block are set equal to the values (wIntra, wInter) for the first CIIP combined prediction mode coded neighbor block in specific order of verification; otherwise, the values (wIntra, wInter) are set to (c, d).

vi. For the examples above, the following might apply:

1. In one example, (c, d) is set to (2, 2) or (1, 3).

d. In one example, adjacent block A or B, noted above, is an adjacent or non-adjacent spatial adjacent block or a temporal adjacent block.

i. In one example, adjacent block A or B is a neighboring block to the left (or top).

ii. In one example, adjacent blocks A and B are neighboring blocks on the left and top, respectively.

iii. In one example, the adjacent block on the left covers the position (xCb − 1, yCb + cbHeight − 1).

iv. In one example, the adjacent block from above covers the position (xCb + cbWidth − 1, yCb − 1).

v. In one example, the adjacent block on the left covers position (xCb − 1, yCb).

vi. In one example, the adjacent block from above covers position (xCb, yCb − 1).

e. For the examples above, combined CIIP prediction is done as follows:

where the offset is set to (1<< (N-1)) or 0, and N can be set to log2(wIntra + wInter).

14. The selection of neighboring blocks used in the combined CIIP prediction mode may depend on encoded information such as block size/block shape/low delay check flag/reference picture information/movement information of the current block and neighboring blocks/indication of intra frame prediction modes for neighboring blocks.

15. Weight pairs used for combined predictive CIIP may depend on encoded information such as block size/block shape/low delay check flag/reference picture information/motion information of current block and adjacent blocks/intra prediction modes indication for neighboring blocks.

a. In one example, a group of weight pairs is further signaled.

b. In one example, the choice of a pair of weight coefficients may depend on whether the neighboring block is encoded in inter-prediction mode instead of intra-prediction.

16. When determining the CIIP combined prediction mode information (for example, when determining the weights applied to the intra prediction signal or the inter prediction signal for the previous method configuration and the above sections), if the adjacent block is not encoded in MODE_INTRA mode (i.e., . in the intra prediction mode), it can be considered as a block encoded in the intra prediction mode.

a. In one example, if the adjacent block is encoded in IBC copy mode.

b. In one example, if the adjacent block is encoded in the combined CIIP prediction mode.

c. In one example, if the adjacent block is encoded in triangular prediction mode (TPM).

d. In one example, if the adjacent block is coded in palette mode.

e. In one example, if the neighboring block is encoded in RDPCM modulation mode.

f. In one example, if the adjacent block is encoded in a non-transform mode (eg, transform-skip mode) and/or with quantization applied (eg, transform-bypass quantization mode).

g. Alternatively, if an adjacent block is encoded in the mode mentioned in the above subsections (e.g., IBC copy mode, RDPCM modulation mode, paletted mode), that adjacent block may be considered to be a non-intra-frame encoded block ( for example, in inter-frame prediction mode).

h. In one example, if an adjacent block is encoded in intra prediction mode but is NOT encoded in certain prediction modes (e.g., planar mode), that adjacent block can be considered to be a non-intra frame encoded block (e.g., in inter-frame prediction mode).

i. Alternatively, if an adjacent block is encoded in a matrix-based intra-frame prediction mode and/or in a multi-reference row intra-frame prediction mode with an unequal reference row index K (e.g., K=0) and/or in a BDPCM modulation mode, that adjacent a block can be considered as a block encoded in a non-intra-frame mode (eg, in an inter-prediction mode).

j. The proposed methods can be applied to other coding tools that rely on whether some adjacent block is coded in intra-prediction mode or not.

k. The proposed methods can be applied to other coding tools that rely on whether some adjacent block is encoded in inter-prediction mode or not.

17. Whether to activate or deactivate the above methods can be signaled in the SPS set/PPS set/VPS set/sequence header/image header/slice header/tile group header/tile/CTU group, etc. .P.

a. Alternatively, which method to use may be signaled in the SPS set/PPS set/VPS set/sequence header/image header/slice header/tile group header/tile/CTU group, etc.

b. Alternatively, whether to enable or disable the above methods and/or which method to apply depends on the block size, video processing data unit (VPDU), image type, low latency check flag , encoding information of the current block (such as reference pictures, unidirectional or bidirectional prediction), or previously coded blocks.

5. Options

5.1 Option 1

An example of skipping the check of CIIP combined prediction mode flags for previously coded blocks is described as follows.

8.4.2 Luminance intra-frame prediction mode determination procedure

The input to this procedure is:

- position ( xCb , yCb ) of the luminance component, specifying the upper left sample of the current luminance component coding block relative to the upper left sample of the luminance component for the current image,

- cbWidth variable specifying the width of the current coding block in luma samples,

- cbHeight variable specifying the height of the current coding block in luma samples.

In this procedure, an indication of the mode IntraPredModeY[ xCb ][ yCb ] of the intra-frame luminance component prediction is determined.

Table 8-1 specifies the IntraPredModeY[ xCb ][ yCb ] indication value of intra-prediction mode and associated names.

Table 8-1. Intra Prediction Mode Specification and Associated Names

Intra-prediction mode Associated name 0 INTRA_PLANAR 1 INTRA_DC 2..66 INTRA_ANGULAR2..INTRA_ANGULAR66 81..83 INTRA_LT_CCLM, INTRA_L_CCLM, INTRA_T_CCLM

Note: The intra-frame prediction modes INTRA_LT_CCLM, INTRA_L_CCLM and INTRA_T_CCLM are only applicable to chroma.

The IntraPredModeY[ xCb ][ yCb ] parameter is determined through the following ordered steps:

1. Adjacent positions ( xNbA, yNbA ) and ( xNbB, yNbB ) are set equal to ( xCb − 1, yCb + cbHeight − 1 ) and ( xCb + cbWidth − 1, yCb − 1 ), respectively.

2. For X being replaced by A or B, the candIntraPredModeX variables are defined as follows:

- The procedure for determining availability for a block, as specified in Article 6.4.X, [Rev. (BB): Neighbor block availability check procedure yet to be defined] is attracted from position ( xCurr, yCurr ) set to ( xCb, yCb ), and neighbor position ( xNbY, yNbY ) is set to ( xNbX, yNbX ) as input , and the output data is assigned to the availableX variable.

- The intra-prediction candidate mode candIntraPredModeX is determined as follows:

- If one or more given conditions are true, the candIntraPredModeX parameter is set to INTRA_PLANAR.

- The availableX variable is equal to FALSE.

- Parameter CuPredMode[ xNbX ][ yNbX ] is not equal to MODE_INTRA.

- pcm_flag[ xNbX ][ yNbX ] is equal to 1.

- X is equal to B and yCb − 1 is less than ( ( yCb. >>. CtbLog2SizeY ). <<. CtbLog2SizeY ).

- Otherwise, the parameter candIntraPredModeX is set to IntraPredModeY[ xNbX ][ yNbX ].

3. The ispDefaultMode1 and ispDefaultMode2 variables are defined as follows:

- If IntraSubPartitionsSplitType is equal to ISP_HOR_SPLIT, the ispDefaultMode1 parameter is set to INTRA_ANGULAR18 and the ispDefaultMode2 parameter is set to INTRA_ANGULAR5.

- Otherwise, the ispDefaultMode1 parameter is set to INTRA_ANGULAR50 and the ispDefaultMode2 parameter is set to INTRA_ANGULAR63.

4. Parameter candModeList[ x ] for x = 0..5 is defined as follows:

…

Option #2

If the left neighbor is available and encoded in intra prediction mode, the values (wIntra, wInter) are set to (2, 2); Otherwise, the values (wIntra, wInter) are set to (1, 3).

Combined CIIP prediction is done as follows:

Option #3

If the left neighbor is available and encoded in intra prediction mode, the values (wIntra, wInter) are set to (3, 1); Otherwise, the values (wIntra, wInter) are set to (1, 3).

Combined CIIP prediction is done as follows:

Option #4

If the up-neighbor is available and encoded in intra-prediction mode, the values of (wIntra, wInter) are set to (2, 2); Otherwise, the values (wIntra, wInter) are set to (1, 3).

Combined CIIP prediction is done as follows:

Option #5

If the up-neighbor is available and encoded in intra-prediction mode, the values (wIntra, wInter) are set to (3, 1); Otherwise, the values (wIntra, wInter) are set to (1, 3).

Combined CIIP prediction is done as follows:

Option #6

If left and top neighbors are available and encoded in intra-prediction mode, the values of (wIntra, wInter) are set to (2, 2); Otherwise, the values (wIntra, wInter) are set to (1, 3).

Combined CIIP prediction is done as follows:

Option #7

If left and top neighbors are available and encoded in intra-prediction mode, the values of (wIntra, wInter) are set to (3, 1); Otherwise, the values (wIntra, wInter) are set to (1, 3).

Combined CIIP prediction is done as follows:

Option #8

If the left or top neighbor is available and encoded in intra-prediction mode, the values of (wIntra, wInter) are set to (2, 2); Otherwise, the values (wIntra, wInter) are set to (1, 3).

Combined CIIP prediction is done as follows:

Option #9

If the left or top neighbor is available and encoded in intra prediction mode, the values of (wIntra, wInter) are set to (3, 1); Otherwise, the values (wIntra, wInter) are set to (1, 3).

Combined CIIP prediction is done as follows:

Option #10

the values (wIntra, wInter) are set to (2, 2).

Combined CIIP prediction is done as follows:

Option #11

the values (wIntra, wInter) are set to (1, 3).

Combined CIIP prediction is done as follows:

Option #12

If the left neighbor is encoded in combined CIIP prediction mode, the values (wIntra, wInter) for the current block are set to the values (wIntra, wInter) for the left neighbor, otherwise, if the left neighbor is available and encoded in intra prediction mode, the values (wIntra, wInter) are set to (3, 1). Otherwise, the values (wIntra, wInter) are set to (1, 3).

Combined CIIP prediction is done as follows:

Option #13

If the left neighbor is encoded in combined CIIP prediction mode, the values (wIntra, wInter) for the current block are set to the values (wIntra, wInter) for the left neighbor, otherwise, if the left neighbor is available and encoded in intra prediction mode, the values (wIntra, wInter) are set equal to (2, 2); otherwise, the values (wIntra, wInter) are set to (1, 3).

Combined CIIP prediction is done as follows:

Option #14

If the up-neighbor is encoded in the combined CIIP prediction mode, the values (wIntra, wInter) for the current block are set to the values (wIntra, wInter) for the up-neighbor; otherwise, if the up-neighbor is available and encoded in intra-prediction mode, the values of (wIntra, wInter) are set to (3, 1); otherwise, the values (wIntra, wInter) are set to (1, 3).

Combined CIIP prediction is done as follows:

Option #15

If the up-neighbor is encoded in the combined CIIP prediction mode, the values (wIntra, wInter) for the current block are set to the values (wIntra, wInter) for the up-neighbor; otherwise, if the up-neighbor is available and encoded in intra-prediction mode, the values of (wIntra, wInter) are set to (2, 2); otherwise, the values (wIntra, wInter) are set to (1, 3).

Combined CIIP prediction is done as follows:

Option #16

If the neighbor on the left and/or the top is encoded in the combined CIIP prediction mode, the values (wIntra, wInter) for the current block are set to the values (wIntra, wInter). for the first neighbor (left->top) encoded in the combined CIIP prediction mode; otherwise, if the left or/and top neighbor is available and encoded in intra prediction mode, the values of (wIntra, wInter) are set to (3, 1); otherwise, the values (wIntra, wInter) are set to (1, 3).

Combined CIIP prediction is done as follows:

Option #17

If the left or/and top neighbor is coded in the combined CIIP prediction mode, the values (wIntra, wInter) for the current block are set to the values (wIntra, wInter) for the first neighbor (left->top) coded in the combined CIIP prediction mode; otherwise, if the left or/and top neighbor is available and encoded in intra prediction mode, the values of (wIntra, wInter) are set to (2, 2); otherwise, the values (wIntra, wInter) are set to (1, 3).

Combined CIIP prediction is done as follows:

Option #18

If the left neighbor is encoded in the combined CIIP prediction mode, the values (wIntra, wInter) for the current block are set equal to the values (wIntra, wInter) for the left neighbor; otherwise, the values (wIntra, wInter) are set to (1, 3).

Combined CIIP prediction is done as follows:

Option #19

If the left neighbor is encoded in the combined CIIP prediction mode, the values (wIntra, wInter) for the current block are set equal to the values (wIntra, wInter) for the left neighbor; otherwise, the values (wIntra, wInter) are set to (2, 2).

Combined CIIP prediction is done as follows:

Option #20

If the up-neighbor is encoded in the combined CIIP prediction mode, the values (wIntra, wInter) for the current block are set to the values (wIntra, wInter) for the up-neighbor; otherwise, the values (wIntra, wInter) are set to (1, 3).

Combined CIIP prediction is done as follows:

Option #21

If the up-neighbor is encoded in the combined CIIP prediction mode, the values (wIntra, wInter) for the current block are set to the values (wIntra, wInter) for the up-neighbor; otherwise, the values (wIntra, wInter) are set to (2, 2).

Combined CIIP prediction is done as follows:

Option #22

If the left or/and top neighbor is coded in the combined CIIP prediction mode, the values (wIntra, wInter) for the current block are set to the values (wIntra, wInter) for the first neighbor (left->top) coded in the combined CIIP prediction mode; otherwise, the values (wIntra, wInter) are set to (1, 3).

Combined CIIP prediction is done as follows:

Option #23

If the left or/and top neighbor is coded in the combined CIIP prediction mode, the values (wIntra, wInter) for the current block are set to the values (wIntra, wInter) for the first neighbor (left->top) coded in the combined CIIP prediction mode; otherwise, the values (wIntra, wInter) are set to (2, 2).

Combined CIIP prediction is done as follows:

Option #24

8.5.6 Encoding procedure for blocks encoded in inter-prediction mode

8.5.6.1 General

This procedure is invoked when decoding a coding unit that is encoded in the inter prediction mode.

When the ciip_flag[ xCb ][ yCb ] flag is 1, the predSamples array of predicted samples is modified as follows:

- If the cIdx parameter is 0, the following applies:

- The general intra-frame sample prediction procedure as specified in clause 8.4.5.2.5 is invoked with position ( xTbCmp, yTbCmp ) set to ( xCb, yCb ), with the intra-frame prediction mode predModeIntra set to IntraPredModeY[ xCb ][ yCb ] , and use as input the width nTbW and height nTbH of the transform block, set equal to the width cbWidth and height cbHeight, the width nCbW and height nCbH of the encoding block, set equal to the width cbWidth and height cbHeight, and the variable cIdx, and the output is the array predSamplesIntra _L size (cbWidth)x(cbHeight).

- The weighted sample prediction procedure for combined pooled prediction and intra prediction as specified in clause 8.5.6.7 is invoked from a position ( xTbCmp, yTbCmp ) set to ( xCb, yCb ) and takes as input the block width cbWidth encoding block height cbHeight, predSamplesInter and predSamplesIntra arrays of samples set equal to predSamples and predSamplesIntra _L arrays, respectively, predModeIntra intra-prediction mode set to IntraPredModeY[ xCb ][ yCb ], and color component index cIdx, and the output is predSamples array size (cbWidth)x(cbHeight).

…

8.5.6.7 Weighted sample prediction procedure for combined combining mode and intra-frame prediction

The input to this procedure is:

- position ( xCb, yCb ) of the luminance component, specifying the upper left sample of the current luminance component coding block relative to the upper left sample of the current image,

- cbWidth width of the current coding block,

- cbHeight height of the current coding block,

- two arrays predSamplesInter and predSamplesIntra of size (cbWidth)x(cbHeight),

- variable cIdx specifying the index of the color component.

The output of this procedure is a predSamplesComb array of size (cbWidth)x(cbHeight) of the predicted sample values.

The bitDepth variable is defined as follows:

- If the cIdx parameter is 0, the bitDepth variable is set to BitDepth _Y .

- Otherwise, the bitDepth variable is set to BitDepth _C .

The variable scallFact is defined as follows:

scallFact = ( cIdx == 0 ) ? 0 : 1. (8-838)

The adjacent position ( xNbA, yNbA ) and ( xNbB, yNbB ) of the luminance component is set equal to ( xCb − 1, yCb − 1 + ( cbHeight << scallFact ) ) and. xCb − 1. + (cbWidth << scallFact ), yCb − 1 ), respectively.

For X replaced by A or B, the variables availableX and isIntraCodedNeighbourX are defined as follows:

- The procedure for determining the availability of a neighboring block, as specified in clause 6.4.4, is invoked from a position ( xCurr, yCurr ) set to ( xCb, yCb ), using as input a neighboring position ( xNbY, yNbY ) set to ( xNbX , yNbX ), the checkPredModeY parameter set to FALSE, and the cIdx parameter set to 0, and the output is the availableX parameter.

- The variable isIntraCodedNeighbourX is defined as follows:

- If availableX is TRUE and CuPredMode[ 0 ][ xNbX ][ yNbX ] is MODE_INTRA and BdpcmFlag[ xNbX ][ yNbX ] is 0, isIntraCodedNeighbourX is set to TRUE.

- Otherwise, isIntraCodedNeighbourX is set to FALSE.

The weighting factor w is determined as follows:

- If the parameters isIntraCodedNeighbourA and isIntraCodedNeighbourB are both TRUE, the weighting factor w is set to 3.

- Otherwise, if the parameters isIntraCodedNeighbourA and isIntraCodedNeighbourB are both FALSE, the weighting factor w is set to 1.

- Otherwise, the weighting factor w is set to 2.

When the cIdx parameter is 0 and the slice_lmcs_enabled_flag is 1, the predSamplesInter[ x ][ y ] parameter with x = 0..cbWidth − 1 and y = 0..cbHeight − 1 is modified as follows:

In FIG. 18 is a block diagram of a device 1800 for video processing. Device 1800 may be used to implement one or more of the methods described here. This device 1800 may be a smartphone, a tablet computer, a desktop computer, an Internet of Things (IoT) receiver, and so on. Device 1800 may include one or more processors 1802, one or more memory devices 1804, and video processing hardware 1806. Processor(s) 1802 may be configured to implement one or more of the methods described herein. The storage device(s) 1804 may be used to store data and code used to implement the methods and technologies described here. Video processing hardware 1806 may be used to implement, in hardware, some of the technologies described herein.

In FIG. 20 is a flow diagram of a video processing method 2000. This method 2000 comprises determining (2005) the coding mode of the first video block, restricting (2010) one or more flags to an operational state based on the determination of the coding mode of the first video block, this operational state is "false" (false) or "true" (true), and performing (2015) further processing of the second video block in accordance with the operating state of one or more flags, where the first video block is a neighboring video block or a reference video block relative to the second video block.

In FIG. 21 is a logic diagram of a video processing method 2100. This method 2100 comprises determining (2105) that pairwise prediction or combined bidirectional prediction is used with respect to the first video block, determining (2110) a combined intra- and inter-prediction (CIIP) coding mode operating state based on the determination that pairwise prediction or combined bidirectional prediction is used. predicting where the operating state is enabled or disabled; and performing (2115) further processing of the first video block in accordance with the operating state of the combined CIIP prediction mode.

In FIG. 23 is a flow chart of a video processing method 2300. This method 2300 includes determining (2305), in the process of converting the first block of video data and representing this first block in the form of a data bitstream, one or more coding modes for one or more second blocks; determining (2310), based on one or more coding modes of one or more second blocks, a coding mode constraint for the first block; performing (2315) at least by applying said coding mode constraint to the first block of said transform; where the collection of one or more second blocks contains at least one - adjacent block, non-adjacent block and / or reference block relative to the specified first block.

In FIG. 24 is a logic diagram of a video processing method 2400. This method 2400 comprises performing (2405) a transformation between a current block of video data and a representation of that current block in the form of a data bitstream by using at least one of a combined intra- and inter-prediction (CIIP) coding mode, diffusing filtering, bidirectional filtering, transform-domain filtering or other type of post-reconstruction filtering other than diffusing, two-way filtering, and transform-domain filtering where the reconstructed adjacent samples of the current block used in at least one combined intra- and inter-prediction (CIIP) coding mode , diffuse filtering mode, two-sided filtering mode, transformed region filtering mode, or another type of post-rendered filtering mode, are replaced by approximated samples generated from the corresponding samples from a set of reconstructed adjacent samples in one or more reference images.

In FIG. 25 is a flow chart of a video processing method 2500. The method 2500 comprises storing (2505) a combined intra- and inter-prediction (CIIP) coding mode flag and/or an intra-prediction mode from a combined CIIP mode with motion information in a history-based motion vector prediction (HMVP) table; and performing, at least based on the HMVP prediction table, a transformation between the current block of video data and a representation of this current block in the form of a data bitstream.

In FIG. 26 is a logic diagram of a video processing method 2600. This method 2600 comprises determining (2605), in the process of converting between a current block of video data and a data bitstream representation of that current block, a prediction mode for that current block; determining (2610) applicability of a combined intra-frame and inter-frame prediction (CIIP) coding mode indicating that this CIIP prediction mode is enabled for the current block, in response to determining that the current block is encoded in the advanced motion vector prediction (AMVP) mode or in the associations; and performing (2615) transformation based on the applicability of the combined prediction mode. CIIP.

In FIG. 27 is a flowchart of a video processing method 2700. This method 2700 includes determining (2705), in the process of converting between the current block of video data and the data bitstream representation of that current block, the type of the selected merging candidate for the current block; determining (2710) whether a combined intra- and inter-prediction (CIIP) coding mode is applicable for the current block according to the type of the selected merged candidate, where the current block is coded in the merging mode.

In FIG. 28 is a flow diagram of a video processing method 2800. This method 2800 comprises encoding (2805), in the process of converting between a current video block of video data and a data bitstream representation of that current video block, a combined intra- and inter-prediction (CIIP) coding mode flag for the current video block by encoding based on the context model without reference to the CIIP prediction mode flag of one or more adjacent video blocks relative to the current video block; and performing said transformation (2810) by at least applying a combined intra- and inter-prediction (CIIP) coding mode flag for the current block.

In FIG. 29 is a flow diagram of a video processing method 2900. This method 2900 includes encoding (2905), in the process of converting between the current video block of the video data and the representation of this current video block in the form of a data bit stream, a combined intra- and inter-prediction (CIIP) coding mode flag for the current video block by bypass coding; and performing the transformation (2910) by at least applying a combined intra- and inter-prediction (CIIP) coding mode flag.

In FIG. 30 is a logic diagram of a video processing method 3000. The method 3000 comprises determining (3005) an intra-prediction mode for a first video video block according to some rule, where the rule contains a gap, in the process of determining the intra-prediction mode for the first video block, checking a combined intra- and inter-prediction (CIIP) coding mode flag ) for one or more adjacent video blocks relative to the first video block; and performing (3010), based on at least the determined intra-prediction mode, a transformation between the first video block and a representation of that first video block in the form of a data bit stream.

In FIG. 31 is a logic diagram of a video processing method 3100. This method 3100 comprises determining (3105), in the process of converting between a current video block of video encoded in a combined intra-frame and inter-frame prediction (CIIP) coding mode, and a representation of that current video block in the form of a data bit stream, a pair of weights containing a first weight for the first prediction result of the current video block, and a second weighting coefficient for the second prediction result of the current video block, where the first prediction result is generated in the intra prediction mode and the second prediction result is generated in the inter prediction mode; and determining (3110) a prediction result for the current block based on the weighted sum of the first prediction result and the second prediction result.

According to methods 2000 and 2100, some examples of the combined intra- and inter-prediction coding mode and their use have been described in Section 4 of this document. For example, as described in Section 4, video blocks may be processed in accordance with a combined intra- and inter-prediction coding mode.

According to methods 2000 and 2100, a video block may be encoded into a video data bitstream in which bit efficiency can be achieved by applying a data bitstream generation rule related to a combined intra- and inter-prediction coding mode.

According to these methods, the collection of one or more flags may comprise a combined intra- and inter-prediction (CIIP) coding mode flag, a local illumination compensation (LIC) flag, a diffuse filtering flag, a two-way filtering flag, a transformed area filtering flag, or some other type of flag. post-reconstruction filtration.

These methods may include the situation in which the specified set of one or more flags contains the first flag associated with the first operation, this first flag is determined to be false, and then the first operation is not applied.

The methods may include signaling that the first operation should be skipped.

The methods may comprise signaling that the use of the first operation is constrained to be false in the matching data bit stream.

The methods may include the situation where the first video block is in an adjacent row or column relative to the second video block.

The methods may include the situation where the specified adjacent row is the top row or top right row.

The methods may comprise the situation where said adjacent column is a column on the left, a column on the bottom left, or a corner column on the top left.

The methods may comprise a situation where it may be an intra-prediction mode, a combined CIIP prediction mode, or a current picture-as-a-reference (CPR) mode.

The methods may include determining the position of the second video block, wherein one or more flags being set to false is also based on determining the position of the second video block.

The methods may include the situation where the specified position is above the current coding tree unit (CTU), and the neighboring block located above the second video block is located in another CTU.

The methods may include the situation where the indicated position is on the left side of the current coding tree unit (CTU) and the adjacent block located to the left of the second video block is located in another CTU.

The methods may comprise a situation where the collection of one or more flags comprises a CIIP combined prediction mode flag or an intra-frame prediction mode flag from a CIIP combined prediction mode, and data regarding these one or more flags is stored along with motion information in a motion vector prediction table based on history. (HMVP).

The methods may comprise comparing the motion information for the two candidates, wherein the CIIP combined prediction mode flag or intra-frame prediction mode flag from the CIIP combined prediction mode is not used in the comparison of the motion information.

The methods may comprise comparing motion information for the two candidates, wherein a CIIP combined prediction mode flag or an intra prediction mode flag from the CIIP combined prediction mode is used in comparing the motion information.

The methods may comprise determining that the candidate to be combined comes from one of the HMVP prediction input positions; and copying the combined CIIP prediction mode flag from this input position to the merged candidate.

The methods may comprise determining that the candidate to be combined comes from one of the HMVP prediction input positions; and copying the combined CIIP prediction mode flag and the CIIP intra prediction mode indication from the input position to the merged candidate.

The methods may comprise a situation where any flag of said set of one or more flags is related to a combined CIIP prediction mode, and this CIIP prediction mode is performed for advanced motion vector prediction (AMVP).

The methods may comprise a situation where a combined CIIP prediction mode flag and an intra prediction mode flag are signaled in the AMVP prediction mode.

The methods may comprise a situation where the CIIP combined prediction mode flag is inherited in the combining mode or in the UMVE extension mode, this CIIP prediction mode flag contains the operating state "true", more than one intra frame prediction mode is allowed in the CIIP prediction mode, and signaling one of intra-prediction modes based on those one or more intra-prediction modes allowed in the CIIP prediction mode.

The methods may comprise a situation where the CIIP combined prediction mode flag and the intra-frame prediction mode indication for adjacent or non-adjacent video blocks in the merge mode or the UMVE extension mode are inherited by the second video block.

The methods may include the situation where the combined CIIP prediction is not activated for the skip mode.

The methods may comprise comparing information regarding the two candidates, and wherein the CIIP combined prediction mode flag or intra-frame prediction mode flag from the CIIP combined prediction mode is not used in comparing the information.

The methods may comprise comparing information regarding the two candidates, wherein a CIIP combined prediction mode flag or an intra prediction mode flag from the CIIP combined prediction mode is used in comparing the information.

The methods may comprise a situation where one or more candidates participating in pairwise prediction or combined bidirectional prediction receive a combined CIIP prediction and when the operating state is activated.

The methods may comprise a situation where the intra-prediction mode of one of the two candidates is legacy.

The methods may comprise a situation in which the intra-prediction mode is signaled.

The methods may include the situation where two candidates participate in pairwise prediction or combined bidirectional prediction.

The methods may include reconstructed samples used in combined CIIP prediction in a diffusing filter, a two-sided filter, a transformed region filter, or other types of post-reconstruction filters are replaced with samples from reference images.

The methods may comprise a situation where the second video block is subjected to bi-directional prediction and adjacent samples of two reference blocks are averaged to generate the final adjacent samples.

The methods may comprise a situation where the second video block is subjected to bi-directional prediction and adjacent samples of two reference blocks are used as the final adjacent samples.

The methods may include a situation where a second video block is subjected to bi-directional prediction, and to obtain a second video block, a weighted average of adjacent samples of two reference blocks is used to generate final adjacent samples based on generalized bi-directional prediction (GBI) with unequal weights, or LIC compensation with weighted prediction.

The methods may comprise the situation where the samples in the reference pictures are identified by motion information for the second video block.

The methods may comprise the situation where the samples in the reference pictures are identified by motion information for the second video block.

The methods may include a situation where the motion vector is rounded to integer precision and used to identify samples.

The methods may include the situation where samples are located in reference images identified by motion vectors with an accuracy of whole pixels.

The methods may comprise defining characteristics of the second video block, the set of these characteristics comprising one or more of block size, slice type, image type, tile type, or motion information, and wherein the operating state is constrained based on such characteristic definition.

The methods may include the situation that the methods are signaled in a sequence parameter set (SPS), a video parameter set (VPS), a picture parameter set (PPS), a sequence header, a picture header, a slice header, a tile group header, a tile, or a group of units. CTU.

The following list of technical solutions further suggests variants and variations of the articles listed in the previous section (for example, articles 11 - 16).

40. A video processing method, comprising: performing a transformation between a video video block and an encoded representation of this video block using a combined mode of intra-frame and inter-frame prediction, in which the specified encoded representation corresponds to a weighted average of the results of intra-frame and inter-frame prediction for a video block using a pair of weight coefficients from a group of pairs weight coefficients, which include less than three pairs.

41. The method according to solution 40, characterized in that said group of weight pairs corresponds to two pairs.

42. The method according to any of the solutions 40-41, characterized in that pairs of weight coefficients are determined based on one neighboring block.

43. The method according to any of the solutions 40-41, characterized in that pairs of weight coefficients are determined based on several adjacent blocks.

44. The method of solution 40, wherein the group of weight pairs contains exactly one pair.

45. The method according to solution 44, characterized in that said one pair is one of (1,3) or (2, 2) or (1,7) or (2, 6) or (3, 5) or (4 , 4).

46. A video processing method, comprising: converting between a video video block and an encoded representation of this video block using a combined intra-frame and inter-frame prediction mode, in which this encoded representation corresponds to a weighted average of the results of intra-frame and inter-frame prediction of the video block using a pair of weight coefficients from a group of weight pairs coefficients determined based on the coding information for one or more neighboring blocks.

47. The method according to decision 46, characterized in that the group of weight pairs is determined based on exactly one adjacent block.

48. The method according to decision 46, characterized in that a group of weight pairs is determined based on two or more neighboring blocks.

49. The method according to any of the solutions 40-48, characterized in that the conversion procedure comprises video encoding to generate an encoded representation.

50. The method according to any one of solutions 40-48, wherein the conversion procedure comprises decoding the encoded representation to generate a video.

Various other variations and additional features of these methods may be described using the following itemized enumeration.

1. Video processing method, comprising:

determining, in the process of converting between a first block of video data and a data bitstream representation of that first block, one or more coding modes for one or more second blocks;

determining, based on said one or more coding modes for the one or more second blocks, a coding mode constraint for the first block; And

performing the conversion at least by applying said coding mode constraint to the first block;

where the collection of one or more second blocks contains at least one of the following - an adjacent block, a non-adjacent block, and/or a reference block for the first block.

2. The method according to Article 1, characterized in that the procedure for determining the restriction of the coding mode for the first block contains:

determining, based on one or more coding modes for one or more second blocks, one or more flags corresponding to said one or more coding modes of the first block, respectively.

3. The method according to Article 2, characterized in that the set of said one or more encoding modes contains:

a combined intra- and inter-prediction (CIIP) coding mode, a local illumination compensation (LIC) mode, a diffuse filtering mode, a two-way filtering mode, a transform domain filtering mode, or a post-rendering filtering mode other than. diffuse filtering mode, bilateral filtering mode and filtering mode in the transformed area.

4. The method according to any of articles 2 - 3, characterized in that the specified encoding mode restriction for the first block contains:

the first coding mode of the plurality of one or more coding modes for the first block is not activated when it is determined that the first flag corresponding to this first coding mode is false.

5. A method according to any of Articles 2 to 4, characterized in that said coding mode constraint for the first block contains:

information indicating whether the second coding mode is activated from said set of one or more coding modes for the first block is not signaled when it is determined that the second flag corresponding to this second coding mode is false.

6. A method according to any of Articles 2 to 5, characterized in that said coding mode constraint for the first block contains:

information indicating whether a third coding mode is activated from a specified set of one or more coding modes for the first block is signaled and constrained to be false in the matching data bit stream when it is determined that the third flag corresponding to the third mode encoding is false.

7. A method according to any of Articles 1 to 6, further comprising:

determining whether to apply the specified coding mode constraint to the first block.

8. The method according to Article 7, characterized in that the procedure for determining whether to apply the specified coding mode constraint for the first block comprises:

determining whether to apply the specified encoding mode constraint to the first block according to the encoding modes for adjacent rows or columns relative to the first block.

9. The method according to Article 7, characterized in that the procedure for determining whether to apply the specified coding mode constraint for the first block comprises:

determining whether to apply the specified coding mode constraint to the first block according to at least N samples in adjacent rows or adjacent columns of the first block that are not fourth mode encoded, and N≥1.

10. The method according to article 8 or 9, characterized in that said adjacent line is the line above and/or the line above to the right of the first block.

11. A method according to any of articles 8 to 10, characterized in that said adjacent column is a column on the left, a column on the bottom left, and a corner column on the top left of the first block.

12. A method according to any of Articles 7 to 11, characterized in that the procedure for determining whether said coding mode constraint should be applied to the first block comprises:

determining that the specified coding mode constraint for the first block should be applied when any neighboring non-contiguous block is encoded in the fourth mode.

13. A method according to any of Articles 7 to 11, characterized in that the procedure for determining whether said coding mode constraint should be applied to the first block comprises:

determining that the specified coding mode constraint for the first block should be applied when all neighboring non-contiguous blocks are encoded in the fourth mode.

14. A method according to any of Articles 7 to 11, characterized in that the procedure for determining whether said coding mode constraint should be applied to the first block comprises:

determining that said coding mode constraint for the first block should not be applied when at least M adjacent non-contiguous blocks are not fourth mode encoded and M is a predetermined first threshold.

15. The method according to any of Articles 9 to 14, characterized in that the set of fourth modes comprises at least one of the modes - intra-prediction mode, combined intra- and inter-prediction (CIIP) coding mode, and a mode using a reference image in as a support (CPR).

16. A method according to any one of Articles 7 to 14, characterized in that the procedure for determining whether said coding mode constraint should be applied to the first block comprises:

determining whether to apply the specified coding mode constraint to the first block, according to the position of the first block.

17. The method according to article 16, characterized in that the procedure for determining whether to apply the specified coding mode restriction for the first block in accordance with the position of this first block, contains:

determining that the specified coding mode constraint for the first block should not be applied when the specified position is upstream of the current coding tree unit (CTU) and the upstream adjacent unit and the first block belong to different CTUs.

18. The method according to article 16, characterized in that the procedure for determining whether to apply the specified coding mode restriction for the first block in accordance with the position of this first block, contains:

determining that the specified coding mode constraint for the first block should not be applied when the specified position is to the left of the current coding tree unit (CTU) and the left adjacent block and the first block belong to different CTUs.

19. A method according to any of Articles 1 to 18, further comprising:

determining the characteristics of the current block; And

determining that the specified coding mode constraint should be applied to the current block when the specified characteristic of the current block satisfies the specified condition.

20. A method according to any of Articles 1 to 18, further comprising:

determining characteristics of the current block and/or previously encoded blocks; And

determining whether a specified coding mode constraint should be applied to the current block, according to characteristics of the current block and/or previously coded blocks

21. Video processing method, comprising:

converting between the current block of video data and the representation of this current block in the form of a data bit stream using at least one of the combined intra-frame and inter-frame prediction (CIIP) coding mode, diffuse filtering mode, two-way filtering mode, transformed filtering mode region or other type of post-reconstruction filtering mode other than diffuse filtering, two-sided filtering, and filtering in the transformed region,

where are the reconstructed neighbor samples for a neighboring block used in at least one of the combined intra- and inter-frame prediction (CIIP) coding mode, diffuse filtering mode, two-way filtering mode, transformed domain filtering mode, or another type of post-reconstruction filtering mode, are replaced by approximated samples generated based on the corresponding samples from the set of reconstructed adjacent samples in one or more reference images.

22. The method according to Clause 21, wherein adjacent samples from two reference blocks relative to the current block are averaged to generate approximate samples when the current block is subjected to bidirectional prediction.

23. The method according to clause 21, characterized in that adjacent samples of one reference block relative to the current block are used as approximate samples when the current block is subjected to bidirectional prediction or unidirectional prediction.

24. The method according to Article 21, characterized in that adjacent samples from two reference blocks for the current block are subjected to a weighted average to generate approximate samples, when the current block is subjected to bidirectional prediction, and at least one generalized bidirectional prediction is applied to this current block ( GBI) with unequal weighting factors, weighted prediction and/or local illumination compensation (LIC).

25. The method according to Articles 22-24, characterized in that neighboring samples from the reference blocks relative to the current block are identified by information about the movement of the current block.

26. The method according to Articles 22 to 24, characterized in that adjacent reference block samples relative to the current block are identified by modified motion information for the current block.

27. The method according to clause 24, characterized in that the modified motion information of the current block is a modified motion vector rounded to integer precision.

28. The method according to Article 21, characterized in that neighboring samples from the reference blocks relative to the current block are identified by motion vectors with an accuracy of whole pixels.

29. The method according to clause 28, characterized in that the motion vectors for the reconstructed adjacent samples are rounded to integer precision in order to identify the corresponding samples.

30. The method according to any of Articles 21 to 29, characterized in that the reconstructed adjacent samples for the current blocks are replaced by approximated samples only when the current block is encoded with an accuracy of whole pixels.

31. The method according to any of articles 21 to 30, characterized in that the reconstructed adjacent samples for the current blocks are replaced with approximated samples of only the luminance component or only the chrominance component.

32. A method according to any of Articles 19 to 31, further comprising:

determining the characteristics of the current block; And

determining that the reconstructed adjacent samples for the current blocks should be replaced with the approximated samples when the specified characteristic of the current block satisfies a given condition.

33. The method according to article 19 or 32, characterized in that said characteristic of the current block contains at least one - block size, slice type, image type, tile type, and motion information.

34. The method according to article 33, characterized in that said predetermined condition is that the current block contains samples not less than a predetermined second threshold value.

35. The method according to article 33, characterized in that said predetermined condition is that the width and height of the current block is greater than the predetermined third threshold value.

36. The method according to article 33, characterized in that said predetermined condition is that the width and height of the current block is less than a predetermined fourth threshold value.

37. The method according to Article 33, characterized in that said predetermined condition is that the width of the current block is less than the predetermined fifth threshold value and/or the height of the current block is less than the predetermined sixth threshold value.

38. The method according to Article 33, characterized in that said predetermined condition is that the width of the current block is greater than the predetermined seventh threshold value and/or the height of the current block is greater than the predetermined eighth threshold value.

39. Method according to article 38, characterized in that

signaling information indicating whether to apply a coding mode constraint to the current block and/or replace reconstructed adjacent samples with approximated samples in the sequence parameter set (SPS), video parameter set (VPS), picture parameter set (PPS), in the header sequence, image title, slice title, tile group title, tile, or CTU group.

40. A method according to any of Articles 21 to 39, further comprising:

determining characteristics of the current block and/or previously encoded blocks; And

determining whether reconstructed adjacent samples should be replaced with approximated samples according to specified characteristics of the current block or previously coded blocks.

41. The method according to Article 20 or 40, characterized in that the set of specified characteristics of the current block and/or previously coded blocks contains at least one of the following - block size, video processing unit (VPDU), image type, low delay check flag , encoding information for the current block and/or previously coded blocks.

42. The method according to clause 41, characterized in that the encoding information for the current block and/or previously coded blocks indicates reference pictures, unidirectional prediction or bidirectional prediction.

43. A video processing device containing a processor configured to implement a method according to any of Articles 1 to 42.

44. Device according to article 43, characterized in that this device is a video encoding device.

45. A device according to article 43, characterized in that this device is a decoding device for video.

46. Computer-readable media for recording information on which a code containing a program is recorded, in accordance with this program, the processor performs a method according to any of Articles 1 to 42.

Various other variations and additional features of these methods may be described using the following itemized enumeration.

1. Video processing method, comprising:

storing a combined intra- and inter-prediction (CIIP) coding mode flag and/or an intra-frame prediction mode from the CIIP combined prediction mode with motion information in a history-based motion vector prediction (HMVP) table; And

performing, at least based on the HMVP prediction table, a transformation between the current block of video data and a representation of this current block in the form of a data bitstream.

2. The method according to article 1, further comprising:

comparing traffic information for two candidates,

where the CIIP combined prediction mode flag and/or intra-frame prediction mode from the CIIP combined prediction mode are not used in comparing the motion information for the two candidates.

3. The method according to Article 1, further comprising:

comparing traffic information for two candidates,

where the CIIP combined prediction mode flag and/or intra-frame prediction mode from the CIIP combined prediction mode are used in comparing the motion information for the two candidates.

4. A method according to any of Articles 1 to 3, characterized in that the procedure contains:

when the merged candidate comes from one of the input positions of the HMVP prediction table; copying the combined CIIP prediction mode flag from this input position to the merged candidate.

5. A method according to any of Articles 1 to 3, characterized in that the procedure contains:

when the merged candidate comes from one of the input positions of the HMVP prediction table; copying the combined CIIP prediction mode flag and the CIIP intra prediction mode indication from the input position to the merged candidate.

6. Video processing method, comprising:

determining, in the process of converting between the current block of video data and a representation of this current block in the form of a data bit stream, a prediction mode for this current block;

determining the applicability of a combined intra-frame and inter-frame prediction (CIIP) coding mode indicating that this CIIP prediction mode is activated for the current block, in response to determining that the current block is encoded in an advanced motion vector prediction (AMVP) mode or in a combining mode; And

performing a transformation based on the applicability of the combined prediction mode. CIIP.

7. The method of Clause 6, wherein the CIIP combined prediction mode flag and/or CIIP intra prediction mode indication is signaled when the current block is encoded in the AMVP prediction mode.

8. The method of Clause 6 or 7, characterized in that the combined CIIP prediction mode flag and/or the CIIP intra-frame prediction mode indication for adjacent adjacent blocks and/or non-adjacent adjacent blocks are inherited in the combining mode and/or in the combining mode with motion vector differences (MMVD) for the current block.

9. The method according to any one of clauses 6 to 8, characterized in that the CIIP combined prediction mode flag and/or the CIIP intra-frame prediction mode indication for a non-skip combining mode and/or a non-skip MMVD mode, and a CIIP combined prediction mode flag and/or an intra-frame CIIP prediction mode indication for adjacent adjacent blocks and/or non-adjacent adjacent blocks are transmitted as signaling. inherit in skip merge mode and/or skip MMVD mode.

10. Method according to any of the articles 6 - 8,. characterized in that the CIIP combined prediction mode flag and/or the CIIP intra prediction mode indication of the skip combining mode and/or the MMVD skip mode is signaled, and the CIIP combined prediction mode flag and/or the CIIP intra prediction mode indication for adjacent adjacent blocks and/or non-contiguous neighboring blocks are inherited in a non-skip merge mode and/or in a non-skip MMVD mode.

11. The method according to any one of Clauses 6 to 10, characterized in that the combined CIIP prediction mode flag is inherited in the combined mode and/or in the skip MMVD mode.

12. The method of Clause 11, wherein the intra prediction mode indication is signaled when the combined CIIP prediction mode flag is true and more than one intra prediction mode is allowed in the CIIP prediction mode.

13. The method according to any one of clauses 6 to 12, characterized in that the combined CIIP prediction mode flag and/or the CIIP intra-frame prediction mode indication for contiguous adjacent blocks and/or non-contiguous adjacent blocks encoded in the combined mode and/or in the mode MMVD, inherits the current block.

14. A method according to any of Articles 6 to 13, further comprising:

deactivating the combined CIIP prediction mode for the skip mode.

15. A method according to any of Articles 6 to 13, further comprising:

comparison of information about two merged candidates,

where the CIIP combined prediction mode flag and/or the CIIP intra prediction mode indication is not used when comparing information about the two candidates being combined.

16. A method according to any of Articles 6 to 13, further comprising:

comparison of information about the two candidates being merged,

where the combined CIIP prediction mode flag and/or the CIIP intra prediction mode indication is used when comparing information about the two candidates to be combined.

17. Video processing method, comprising:

determining, in the process of converting between the current video data block and the data bitstream representation of that current block, the type of the selected merging candidate for the current block, and

determining whether a combined intra-frame and inter-frame prediction (CIIP) coding mode is applicable for the current block in accordance with the selected merging candidate,

where the current block is encoded in merge mode.

18. The method according to Clause 17, wherein the CIIP prediction mode is not activated when the selected merged candidate for the current block is at least one of a pairwise merged candidate, a bidirectional merged candidate, a zero motion merged candidate, or a virtual or an artificial merge candidate.

19. The method according to Clause 17 or 18, characterized in that when one candidate participating in a pairwise pooled candidate or bidirectional prediction pooling candidate receives a combined CIIP prediction mode, that CIIP prediction mode is activated for that pairwise pooled candidate or bidirectional pooling candidate. .

20. The method of Clause 19, wherein the intra-prediction mode for the participating CIIP combined prediction mode candidate is inherited.

21. The method according to Clause 19, wherein the intra prediction mode indication for the participating combined CIIP prediction mode is reported as a signaling for a pairwise combined candidate or a combined bidirectional prediction candidate.

22. The method according to Clause 17 or 18, characterized in that when both candidates participating in a pairwise combined candidate or a combined bidirectional prediction candidate receive a combined CIIP prediction mode, this CIIP prediction mode is activated for a pairwise combined candidate or a combined bidirectional candidate. forecasting.

23. The method according to Article 22, characterized in that the intra-prediction mode for one of the two participating candidates is inherited.

24. The method according to Clause 22, wherein the intra-prediction mode of the participating combined CIIP prediction mode is determined from a plurality of intra-prediction modes for two participating candidates, and is used for a pairwise combined candidate or a combined bidirectional prediction candidate.

25. The method according to Clause 22, wherein the intra prediction mode indication from the participating combined CIIP prediction mode is reported as a signaling for a pairwise combined candidate or a combined bidirectional prediction candidate.

26. A video processing device comprising a processor configured to implement a method according to any of Articles 1 to 25.

27. A device according to article 26, characterized in that this device is a video encoder.

28. Device according to article 26, characterized in that this device is a video decoding device.

29. Computer-readable media for recording information on which a program containing code is recorded, when executing this program, the processor performs a method according to any of Articles 1 to 25.

Various other variations and additional features of these methods may be described using the following itemized enumeration.

1. Video processing method, comprising:

encoding, in the process of converting between the current video block of the video data and the data bitstream representation of that current video block, the combined intra-frame and inter-frame prediction (CIIP) coding mode flag for the current video block using a context model-based coding method without considering the combined mode flag predicting CIIP for one or more adjacent video blocks relative to the current video block, and

performing the transformation by at least applying a combined intra- and inter-prediction (CIIP) coding mode flag to the current video block.

2. The method according to Article 1, characterized in that when encoding the CIIP combined prediction mode flag for the current video block based on the context model, a fixed context is used.

3. Video processing method, comprising:

encoding, in the process of converting between the current video block of the video data and the data bitstream representation of that current video block, a combined intra- and inter-prediction (CIIP) coding mode flag for the current video block by bypass coding, and

performing the transformation by at least applying said combined intra- and inter-prediction (CIIP) coding mode flag.

4. The method according to Article 3, characterized in that the procedure for encoding the combined inter-frame-intra-frame prediction (CIIP) flag for the current video block by bypass coding comprises encoding the CIIP combined prediction mode flag with an equal probability that this flag will be equal to 0 or 1.

5. A method according to any of Articles 1 to 4, further comprising:

in response to the fact that the current video block is encoded in the combined CIIP prediction mode, setting some particular intra prediction mode as the intra prediction mode associated with the current video block.

6. The method according to Article 5, characterized in that said particular intra-prediction mode is a planar mode.

7. The method according to Article 5 or 6, characterized in that said particular intra prediction mode is used in determining the intra prediction mode for subsequent encoded video blocks.

8. The method according to Article 7, further comprising:

in the process of converting the second video block, which is one of the subsequent encoded video blocks relative to the current video block, if the current video block is a neighboring video block relative to the second video block, the specified intra-frame prediction mode is added to the list of candidate intra-frame prediction modes for the second video block.

9. The method according to article 8, further comprising:

the list of intra-prediction candidate modes contains a list of the most likely candidate modes.

10. The method according to any one of Clauses 1 to 9, characterized in that, in response to the current video block being encoded in the combined CIIP prediction mode, information about the intra-frame prediction mode for the current video block is not stored.

11. The method according to article 10, characterized in that the current video block is considered inaccessible in the process of decoding other blocks.

12. The method according to article 10, characterized in that the current video block is considered to be a video block encoded in the inter-prediction mode.

13. The method according to Article 1 to 12, characterized in that the CIIP combined prediction mode flag for the current video block is not stored.

14. Video processing method, comprising:

determining the mode of intra-frame prediction for the first video block of the video in accordance with some rule, this rule contains:

skipping, during the procedure for determining the intra-frame prediction mode for the first video block, checking the combined intra- and inter-frame prediction (CIIP) coding mode flag for one or more neighboring video blocks relative to the first video block, and

performing, based on at least the found intra-prediction mode, a transformation between the first video block and a representation of that first video block in the form of a data bitstream.

15. The method according to article 14, characterized in that

the procedure for determining the intra-prediction mode comprises determining the most probable mode.

16. The method according to Clause 14 or 15, characterized in that, for the second video block of video, in response to the second video block being encoded in the inter-frame prediction mode or in the combined CIIP prediction mode, the second video block is set to the default intra-frame prediction mode, where the second the video block is a neighboring video block relative to the first video block.

17. The method according to Article 16, characterized in that the intra prediction mode determination procedure is based on the default intra prediction mode for the second video block;

and the default intra prediction mode is the planar intra prediction mode.

18. The method according to any one of clauses 14 to 17, characterized in that the CIIP combined prediction mode flag for one or more adjacent video blocks is not stored.

19. A video processing device comprising a processor configured to implement a method according to any one of Articles 1 to 18.

20. Device according to article 19, characterized in that this device is a video encoder.

21. Device according to article 19, characterized in that this device is a video decoding device.

22. Computer-readable media for recording information on which a program containing code is recorded, when executing this program, the processor performs a method according to any of Articles 1 to 21.

Various other variations and additional features of these methods may be described using the following itemized enumeration.

1. Video processing method, comprising:

determining, in the process of converting between the current video block encoded in the combined intra- and inter-prediction (CIIP) coding mode, the video and the bitstream representation of that current video block, a weight pair containing a first weight coefficient for the first prediction result for the current video block and a second weight coefficient for the second prediction result for the current video block, based on one or more neighboring video blocks relative to the current video block,

where the first prediction result is generated by the intra prediction mode, and the second prediction result is generated by the inter prediction mode; And

determining a prediction result for the current block based on the weighted sum of the first prediction result and the second prediction result.

2. The method according to Article 1, characterized in that the procedure for determining a pair of weight coefficients contains:

determining a pair of weight coefficients in accordance with the prediction mode of one or more adjacent blocks relative to the current video block.

3. The method according to Article 1 or 2, characterized in that for an adjacent video block encoded in the combined CIIP prediction mode, the adjacent video block is considered as a block encoded in the inter-picture prediction mode.

4 The method according to Article 1 or 2, characterized in that, in the case of a neighboring video block encoded in the combined CIIP prediction mode, this neighboring video block is considered as a block encoded in the intra prediction mode.

5. A method according to any of Articles 1 to 4, characterized in that said adjacent video blocks are at least one adjacent block, non-adjacent block, and/or temporary adjacent block relative to the neighboring video block.

6. The method according to any one of articles 1 to 5, characterized in that one of the adjacent video blocks represents the adjacent video block on the left or the adjacent video block on top.

7. The method according to any one of articles 1 to 5, characterized in that two of the neighboring video blocks represent the neighboring video block on the left and the neighboring video block on top, respectively.

8. Method according to article 6 or 7, characterized in that the neighboring video block on the left covers the position (xCb-1, yCb+cbHeight-1) and the neighboring video block on the top covers the position (xCb+cbWidth-1, yCb-1), and characterized in that that (xCb, yCb) denotes the top-left reference position of the current video block, and cbWidth and cbHeight are the width and height of the current video block, respectively.

9. The method according to Article 6 or 7, characterized in that the adjacent video block on the left covers the position (xCb-1, yCb) and the neighboring video block on the top covers the position (xCb, yCb-1), and characterized in that (xCb, yCb) denotes the position of the upper left reading of the current video block.

10. The method according to any one of Articles 1 to 9, characterized in that the combined CIIP prediction mode result is obtained by applying a pair of weight coefficients to the intra prediction result and the inter prediction result according to the formula:

and where P _PRP denotes the result of the CIIP combined prediction mode, P _inter denotes the result of inter-prediction, P _intra denotes the result of intra-prediction, (wInter, wIntra) denotes a pair of weight coefficients, offset (shift) is set to (1<< (N-1) ) or 0, and N is set to log2(wIntra + wInter).

11. A method according to any one of Articles 1 to 10, characterized in that said adjacent video block is selected based on encoding information for the current block and/or that adjacent block.

12. The method according to any one of Articles 1 to 11, characterized in that a pair of weight coefficients is determined based on information about the coding of the adjacent block and/or neighboring block.

13. The method according to clause 11 or 12, characterized in that this encoding information contains at least one of: block size information, block shape information, low delay check flag, reference picture information, current video block motion information, and /or an adjacent video block or an indication of intra-prediction modes for neighboring video blocks.

14. The method according to article 1, characterized in that a pair of weight coefficients depends on the color components of the current video block.

15. The method according to article 14, characterized in that the pair of weight coefficients for the main color component is different from the coefficients for other color components.

16. The method according to article 14, characterized in that the pair of weight coefficients for the luminance component are different from the coefficients for the chrominance component.

17. The method according to any of the articles 14 to 16, characterized in that for the chromaticity component, the first weighting factor is equal to the second weighting factor.

18. A method according to any one of Clauses 1 to 17, wherein said weight pair is one of two candidate weight pairs, including a first weight candidate pair and a second weight candidate pair.

19. The method according to Article 18, wherein said two candidate weight pairs are one of {(1,3) and (3,1)}, {(1,3) and (2,2)}, {(3,1) and (2,2)}, {(3, 5) and (4, 4)}, {(5, 3) and (4, 4)}, {(1, 7) and ( 4, 4)} and {(7, 1) and (4, 4)}.

20. The method according to clause 18 or 19, characterized in that the weight pair is determined based on one adjacent video block relative to the current video.

21. The method of Clause 20, wherein when said one adjacent video block is encoded in intra-prediction mode, the weight pair is a first candidate weight pair; and when said one adjacent video block is encoded in the inter prediction mode, the weight pair is the second candidate weight pair.

22. The method according to Article 20 or 21, wherein said one adjacent video block is a left adjacent video block or a top adjacent video block.

23. The method according to Article 18 or 19, characterized in that said pair of weight coefficients is determined based on two or more adjacent video blocks relative to the current video block and at least one of the two or more adjacent video blocks satisfies the given conditions.

24. The method of Clause 23, wherein when at least one of two or more adjacent video blocks is encoded in intra-prediction mode, said weight pair is the first candidate weight pair; and when at least one of the two or more adjacent video blocks is encoded in the inter prediction mode, said weight pair is a second candidate weight pair.

25. The method according to Article 18 or 19, characterized in that said weight coefficient pair is determined based on two or more neighboring video blocks relative to the current video block, and each of these two or more neighboring video blocks satisfies the given conditions.

26. The method of Clause 25, wherein when all of two or more adjacent video blocks are encoded in intra-prediction mode, said weight pair is the first candidate weight pair; and when all of the two or more adjacent video blocks are encoded in the inter prediction mode, said weight pair is a second candidate weight pair.

27. A method according to any one of Articles 23 to 26, wherein one of the two or more adjacent video blocks is a left adjacent video block and the other of the two or more adjacent video blocks is a top adjacent video block.

28. A method according to any one of clauses 23 to 27, wherein the first weight candidate pair is one of (2, 2) and (3, 1) and the second weight candidate pair is (1 , 3).

29. A method according to any of Clauses 23-28, wherein at least one weight in the first candidate weight pair is different from at least one weight in the second candidate weight pair.

30. A method according to any one of clauses 23 to 29, wherein the first candidate weight pair is different from the second candidate weight pair.

31. A method according to any one of clauses 1 to 17, wherein said weight pair is exactly one candidate weight pair.

32. The method according to Article 31, characterized in that said one pair of candidate weights is one of (1,3), (2,2), (1, 7), (2, 6), (3, 5 ) and (4, 4).

33. The method according to any one of Articles 1 to 32, characterized in that said weight coefficient pair is determined based on whether one or more adjacent video blocks are coded in the CIIP combined prediction mode.

34. The method according to article 33, characterized in that said pair of weight coefficients is determined based on a pair of weight coefficients for previously encoded video blocks.

35. The method according to clause 33 or 34, characterized in that said weight coefficient pair for the current video block is determined based on one adjacent video block relative to the current video block.

36. The method according to Clause 35, wherein when one adjacent video block is encoded in the combined CIIP prediction mode, a pair of weight coefficients for the current video block is set equal to a pair of weight coefficients for one neighboring video block; And

when said one adjacent video block is encoded in intra-prediction mode, said weight pair is a first weight candidate pair of two weight candidate pairs comprising a first weight candidate pair and a second weight candidate pair;

when said one adjacent video block is encoded in inter-frame prediction mode, said weight pair is the second weight candidate pair of two weight candidate pairs comprising the first weight candidate pair and the second weight candidate pair.

37. The method according to Clause 35, wherein when said one adjacent video block is encoded in a combined CIIP prediction mode, a pair of weights for the current video block is set equal to a pair of weights for said one neighboring video block; And

when said one adjacent video block is encoded in intra-prediction mode or inter-prediction mode, said weight pair is the first weight candidate pair of two weight candidate pairs comprising the first weight candidate pair and the second weight candidate pair .

38. The method according to clause 33 or 34, characterized in that said pair of weight coefficients is determined based on two or more neighboring video blocks relative to the current video block and at least one of the two or more neighboring video blocks satisfies the given conditions.

39. The method of Clause 38, wherein two or more of the adjacent video blocks are checked in a specific test order to identify whether said two or more adjacent video blocks are encoding in a combined CIIP prediction mode.

40. The method according to Clause 39, wherein when at least one of said two or more neighboring video blocks is encoded in a combined CIIP prediction mode, the weight pair for the current video block is set equal to the weight pair for said neighboring video block that was first identified. , as encoded in the combined CIIP prediction mode when checked in the specified specific order;

when none of the two or more adjacent video blocks are encoded in the combined CIIP prediction mode, at least one of the two or more adjacent video blocks are encoded in the intra prediction mode, the specified weight pair is the first candidate weight pair of the two pairs weight candidates comprising a first weight candidate pair and a second weight candidate pair;

when none of the two or more adjacent video blocks are encoded in the combined CIIP prediction mode, at least one of the two or more adjacent video blocks is encoded in the inter-picture prediction mode, the specified weight pair is the second candidate weight pair of the two pairs weight candidates comprising a first weight candidate pair and a second weight candidate pair.

41. The method according to Clause 39, characterized in that when at least one of two or more adjacent video blocks are encoded in the combined CIIP prediction mode, the weight pair for the current block is set equal to the weight pair for the specified neighboring video block that was first identified, as encoded in the combined CIIP prediction mode when checked in the specified specific order;

when none of the two or more adjacent video blocks are encoded in the combined CIIP prediction mode, the specified weight pair is the second weight candidate pair of the two weight candidate pairs comprising the first weight candidate pair and the second weight candidate pair. coefficients.

42. A method according to any one of clauses 36 to 41, wherein the first weight candidate pair is one of (2, 2) and (3, 1) and the second weight candidate pair is (1 , 3).

43. A method according to any of Clauses 36-42, wherein at least one weight in the first candidate weight pair is different from at least one weight in the second candidate weight pair.

44. The method according to any one of Articles 36 to 41, characterized in that said second pair of candidate weights is one of (2, 2) and (1, 3).

45. A method according to any one of articles 1 to 44, characterized in that a pair of weights is transmitted as a signaling.

46. The method according to any one of Articles 1 to 45, characterized in that said weight coefficient pair is determined based on whether an adjacent video block is encoded in inter-prediction mode.

47. The method according to any one of Clauses 1 to 46, wherein when an adjacent video block is not intra prediction encoded, that adjacent video block is considered an intra prediction encoded block.

48. The method according to Article 47, characterized in that the adjacent video block is not encoded in at least one of the modes - intra block copy (IBC) mode, CIIP combined prediction mode, triangular prediction mode (TPM )), palette mode, RDPCM modulation mode.

49. The method according to article 48, characterized in that the neighboring video block is encoded without applying transformation and/or quantization.

50. The method according to any one of Articles 1 to 46, characterized in that when an adjacent video block is encoded in at least one of intra-frame block coding (IBC) mode, CIIP combined prediction mode, triangular prediction mode (TPM), palette mode, RDPCM modulation mode, this adjacent video block is considered as a block encoded in a non-intra-prediction mode.

51. The method according to any one of clauses 1 to 46, wherein when an adjacent video block is encoded in intra prediction mode but not encoded in a given prediction mode, that adjacent video block is considered to be a block encoded in a non-intra prediction mode. forecasting.

52. The method according to any one of clauses 1 to 46, characterized in that when an adjacent video block is encoded in a matrix-based intra-frame prediction mode and/or in a multiple reference row intra-frame prediction mode, where the reference row index is not equal to 0, and/ or in BDPCM modulation mode, this adjacent video block is considered as a block encoded in a non-intra-prediction mode.

53. A video processing device containing a processor configured to implement a method according to any of Articles 1 to 52.

54. Device according to article 53, characterized in that this device is a video encoder.

55. A device according to article 53, characterized in that this device is a video decoding device.

56. Computer-readable media for recording information on which a program containing code is recorded, when executing this program, the processor performs a method according to any of Articles 1 to 52.

It should be appreciated that the techniques described may be implemented in video encoders or video decoders to improve compression efficiency using hash-based motion estimation.

Described here and other technical solutions, examples, variants, modules and functional operations discussed in this document may be implemented in digital electronic circuit or computer downloadable software, firmware or hardware, including the structures described in this document and their structural equivalents or combinations of one or more of the listed items. The described and other embodiments may be implemented as one or more computer program products, i. one or more modules of computer program instructions encoded on a computer-readable medium for execution by a data processing device or for controlling the operation of such a device. Such a computer-readable storage medium can be a computer-readable storage device, a computer-readable information storage card, a memory device, a composition of objects implementing a computer-readable propagating signal, or a combination of one or more of these components. The term "data processing device" encompasses all data processing apparatus, devices, and machines, including, by way of example, a programmable processor, a computer, or a plurality of processors or computers. The device may contain, in addition to hardware, code constituting the environment for executing the computer program in question, such as code constituting processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of these components. A propagating signal is an artificially generated signal, such as a machine-generated electrical, optical, or electromagnetic signal, that is generated to encode information for transmission to a suitable receiver.

A computer program (also known as a "program", "software", "software application", "script", or "code") may be written in any programming language, including compiled or interpreted languages, and may be deployed in any form, including a stand-alone program, program module, component, subroutine, or other similar entity suitable for use in a computer environment. A computer program does not necessarily correspond to a single file on a computer system. A program may be stored in a portion of a file that stores other programs or data (for example, one or more scripts stored in a markup language document) in a single file dedicated to the program in question, or in several coordinated files (for example, in files storing one or more modules, subroutines, or parts of code). The computer program may be deployed to run on a single computer or on multiple computers located in the same location or distributed over multiple locations and connected by a communications network.

The procedures and logic described herein may be implemented by one or more programmable processors executing one or more programs to perform a function by operating on input data and generating output data. These procedures and logic circuits can also be implemented by and devices can be implemented as special-purpose logic circuits, such as field programmable gate array (FPGA) or application specific integrated circuit (ASIC) .

Processors suitable for executing a computer program may be, for example, microprocessors, both general purpose and special purpose, and one or more digital computer processors of some type. In general, the processor will receive instructions and data from ROM or Random Access Memory, or both. The essential elements of a computer are a processor for executing instructions and one or more memory devices for storing instructions and data. In general, the computer will also include or be operatively connected for receiving and/or transmitting data to mass storage devices for data storage, such as magnetic disks, magneto-optical disks or optical disks. However, the computer does not need to have such devices. Computer-readable storage media for storing instructions and data includes all forms of non-volatile memory, storage media, and storage devices, including, by way of example, semiconductor memory devices such as erasable programmable read-only memory (EPROM), electrically erasable, and programmable constant storage device (EEPROM (EEPROM)) and flash memory devices; magnetic disks, such as built-in hard disks or removable disks; magneto-optical disks; as well as discs. CD-ROM and DVD-ROM. The processor and storage device may be augmented or incorporated into special purpose logic.

Although this patent document contains many specific details, they should not be construed as any limitation on the scope of any innovation or what may be claimed as an invention, but merely as descriptions of features that may be specific to particular variations of a particular innovation. . Some of the features described in this patent document in the context of separate variants may also be implemented as a combination in one embodiment. On the contrary, various features described in the context of one embodiment may also be implemented in several variants individually or in any suitable subcombination. Moreover, although the features may be described above as operating in certain combinations and even initially claimed as such, one or more features from the claimed combination may in some cases be excluded from this claimed combination, so that this claimed combination can be turned into a subcombination or variations of such a subcombination.

Likewise, while the operations are shown in the drawings in a specific order, this should not be understood as a requirement that such operations must be performed in the specific order shown or in sequential order, or that all illustrations shown must be performed in order to achieve the desired results. Moreover, separation of the various system components described in this patent document should not be understood as requiring such separation in all embodiments.

Only a few variants and examples are described here, however, other implementations, improvements and variations can be created based on what is described and illustrated in this patent document.

Claims (48)

1. A video processing method, comprising the steps of: determine, in the process of converting between the current video block, which is encoded in a combined intra- and inter-prediction coding mode, of video data and a data bit stream, a pair of weight coefficients containing a first weight coefficient for the first prediction result of the current video block and a second weight coefficient for the second prediction result of the current video block, based on one or more neighboring video blocks relative to the current video block, wherein the first prediction result is generated in the intra prediction mode and the second prediction result is generated in the inter prediction mode; determining a prediction result of the current block based on a weighted sum of the first prediction result and the second prediction result; And performing a transformation based on the prediction result, wherein the specified pair of weight coefficients is determined in accordance with the prediction mode of the specified one or more adjacent video blocks relative to the current video block, when at least one adjacent video block of said one or more adjacent video blocks is encoded in a combined intra-prediction and inter-prediction coding mode, said at least one adjacent video block is considered as a video block encoded in an inter-prediction mode that is not an intra-prediction mode, the specified one or more neighboring video blocks contain a video block covering the position and a video block covering the position Where indicates the position of the top left reference of the current video block, cbWidth and cbHeight are respectively the width and height of the current video block, and the parameter "a" is determined using the cIdx of the current video block, wherein cIdx is a variable defining the color component index for the current block, and the color component index of the current block indicates that the color component of the current block is the luminance component. 2. The method of claim 1, wherein the prediction mode for said one or more neighboring video blocks indicates whether said one or more neighboring video blocks are encoded in intra prediction mode or not in intra prediction mode. 3. The method of claim 1, wherein when said at least one adjacent video block is encoded in at least one of intra block copy mode, combined intra and inter prediction coding mode, geometric separation mode, or paletted mode, said adjacent video block considered as a non-intra-prediction encoded block. 4. The method of claim. 1, in which the specified pair of weight coefficients is determined in accordance with the color component of the current video block. 5. The method of claim 4, wherein the position of said one or more neighboring video blocks is determined by the color component of the current video block. 6. The method of claim 1, wherein said one or more adjacent video blocks comprise at least one of a left adjacent video block or a top adjacent video block. 7. The method of claim 1, wherein said weight pair is determined according to the availability of said one or more adjacent video blocks, wherein the variable checkPredModeY, which determines whether the availability of the adjacent video block depends on the prediction mode, is set to false. 8. The method of claim. 1, in which in response to the fact that the parameter cIdx for the current block is 0, the parameter "a" is set to 0. 9. The method of claim. 1, in which in response to the fact that the parameter cIdx for the current block is not equal to 0, the parameter "a" is set equal to 1. 10. The method according to p. 1, in which the specified pair of weight coefficients is determined based on two or more adjacent video blocks; when all of said two or more adjacent video blocks are intra prediction encoded, said weight pair is the first candidate weight pair, when all of said two or more adjacent video blocks are encoded in a non-intra-prediction mode, said weight pair is a second weight candidate pair different from the first weight candidate pair, otherwise, said weight pair is a third candidate weight pair different from the first and second weight candidate pairs. 11. The method of claim 1, wherein the first weight candidate pair is (3, 1), the second weight candidate pair is (1, 3), and the third weight candidate pair is (2, 2), wherein for the pair (x, y), x denotes the first weight and y denotes the second weight. 12. The method of claim 1, wherein the prediction result is obtained by applying a pair of weight coefficients to the intra-prediction result and the inter-prediction result by the formula and where Р is the result of forecasting, - the first prediction result, - the second prediction result, (wInter, wIntra) - a pair of weight coefficients, the offset parameter is set to 2. 13. A video data processing device containing a processor and a non-volatile storage device with instructions recorded therein, wherein the instructions, when executed by the processor, cause the processor to execute: determining, in the conversion process between the current video block, which is encoded in a combined intra- and inter-prediction coding mode, of video data and a data bit stream, a pair of weight coefficients containing a first weight coefficient for the first prediction result of the current video block and a second weight coefficient for the second prediction result of the current video block, based on one or more neighboring video blocks relative to the current video block, wherein the first prediction result is generated in the intra prediction mode and the second prediction result is generated in the inter prediction mode; determining a prediction result of the current block based on a weighted sum of the first prediction result and the second prediction result; And performing a transformation based on the prediction result, wherein the specified pair of weight coefficients is determined in accordance with the prediction mode of the specified one or more adjacent video blocks relative to the current video block, when at least one adjacent video block of said one or more adjacent video blocks is encoded in a combined intra-prediction and inter-prediction coding mode, said at least one adjacent video block is considered as a video block encoded in an inter-prediction mode that is not an intra-prediction mode, the specified one or more neighboring video blocks contain a video block covering the position and a video block covering the position Where indicates the position of the top left reference of the current video block, cbWidth and cbHeight are respectively the width and height of the current video block, and the parameter "a" is determined using the cIdx of the current video block, wherein cIdx is a variable defining the color component index for the current block, and the color component index of the current block indicates that the color component of the current block is the luminance component. 14. A non-volatile computer-readable storage medium that stores instructions that cause the processor to execute: determining, in the conversion process between the current video block, which is encoded in a combined intra- and inter-prediction coding mode, of video data and a data bit stream, a pair of weight coefficients containing a first weight coefficient for the first prediction result of the current video block and a second weight coefficient for the second prediction result of the current video block, based on one or more neighboring video blocks relative to the current video block, wherein the first prediction result is generated in the intra prediction mode and the second prediction result is generated in the inter prediction mode; determining a prediction result of the current block based on a weighted sum of the first prediction result and the second prediction result; And performing a transformation based on the prediction result, wherein the specified pair of weight coefficients is determined in accordance with the prediction mode of the specified one or more adjacent video blocks relative to the current video block, when at least one adjacent video block of said one or more adjacent video blocks is encoded in a combined intra-prediction and inter-prediction coding mode, said at least one adjacent video block is considered as a video block encoded in an inter-prediction mode that is not an intra-prediction mode, the specified one or more neighboring video blocks contain a video block covering the position and a video block covering the position Where indicates the position of the top left reference of the current video block, cbWidth and cbHeight are respectively the width and height of the current video block, and the parameter "a" is determined using the cIdx of the current video block, wherein cIdx is a variable defining the color component index for the current block, and the color component index of the current block indicates that the color component of the current block is the luminance component. 15. A non-volatile computer-readable storage medium for recording information, storing a stream of video data bits generated by a method performed by a video processing device, the method comprising the steps of: determining, for a current video block that is encoded in a combined intra- and inter-prediction coding mode, a pair of weight coefficients comprising a first weight coefficient for the first prediction result of the current video block and a second weight coefficient for the second prediction result of the current video block, based on one or more adjacent video blocks relative to the current video block, wherein the first prediction result is generated in the intra prediction mode and the second prediction result is generated in the inter prediction mode; determining a prediction result of the current block based on a weighted sum of the first prediction result and the second prediction result; And generating a bitstream based on the prediction result, wherein the specified pair of weight coefficients is determined in accordance with the prediction mode of the specified one or more adjacent video blocks relative to the current video block, when at least one adjacent video block of said one or more adjacent video blocks is encoded in a combined intra-prediction and inter-prediction coding mode, said at least one adjacent video block is considered as a video block encoded in an inter-prediction mode that is not an intra-prediction mode, the specified one or more neighboring video blocks contain a video block covering the position and a video block covering the position Where indicates the position of the top left reference of the current video block, cbWidth and cbHeight are respectively the width and height of the current video block, and the parameter "a" is determined using the cIdx of the current video block, wherein cIdx is a variable defining the color component index for the current block, and the color component index of the current block indicates that the color component of the current block is the luminance component.

Images