Method and device for video processing and medium

By dynamically determining filter coefficients for chroma blocks based on the video's color format, the method addresses inefficiencies in existing video coding technologies, enhancing coding efficiency.

CN119072921APending Publication Date: 2024-12-03DOUYIN VISION CO LTD +1
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202280095109.0
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Priority Date
2022-04-20
Filing Date
2022-08-08
Publication Date
2024-12-03

AI Technical Summary

Technical Problem

Existing video coding technologies, such as MPEG-2, MPEG-4, AVC, HEVC, and VVC, lack flexibility in determining filter coefficients for chroma blocks, leading to suboptimal coding efficiency.

Method used

A method for video processing that allows for the determination of the number of rows of filter coefficients for a convolution cross-component model (CCCM) based on the color format of the video, providing more flexibility in the conversion process.

Benefits of technology

This approach enhances coding efficiency by adapting filter coefficients to the specific color format of the video, improving the overall coding performance.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119072921A_ABST
    Figure CN119072921A_ABST
Patent Text Reader

Abstract

The embodiment of the invention provides a method for video processing. The method comprises: during a conversion between a current chroma block of a video and a bitstream of the video, obtaining a number of rows for determining at least one filter coefficient for a convolutional cross-component model (CCCM) for the current chroma block; and performing a conversion based on the number of rows. Compared with a conventional scheme, the method provided by the invention can advantageously improve the coding and decoding efficiency.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] Embodiments of the present disclosure relate generally to video coding techniques, and more particularly, to the derivation of intra prediction modes for chroma. Background Art

[0002] Nowadays, digital video functions are being applied to all aspects of people's lives. Various types of video compression technologies, such as MPEG-2, MPEG-4, ITU-TH.263, ITU-TH.264 / MPEG-4 Part 10 Advanced Video Coding (AVC), ITU-TH.265 High Efficiency Video Codec (HEVC) standard, and Versatile Video Codec (VVC) standard, have been proposed for video coding and decoding. However, the coding and decoding efficiency of video coding and decoding technologies is generally expected to be further improved. Summary of the invention

[0003] In a first aspect, a method for video processing is provided. The method includes: during conversion between a current chroma block of a video and a bitstream of the video, obtaining the number of rows of at least one filter coefficient for determining a convolution cross-component model (CCCM) for the current chroma block; and performing conversion based on the number of rows.

[0004] According to the method of the first aspect of the present disclosure, the number of rows used to determine at least one filter coefficient for CCCM is not fixed. Compared with conventional solutions in which the number of rows is fixed, the proposed method can advantageously provide more flexibility and thus improve coding efficiency.

[0005] In a second aspect, another method for video processing is provided. The method includes: during conversion between a current chroma block of a video and a bitstream of the video, determining information about applying a CCCM to the current chroma block based on a color format of the video; and performing conversion based on the information.

[0006] According to the method of the second aspect of the present disclosure, information about applying CCCM to the current chrominance block is determined based on the color format of the video. Therefore, the proposed method can advantageously improve the coding efficiency.

[0007] In a third aspect, a device for processing video data is proposed, which includes a processor and a non-volatile memory having instructions thereon, which instructions, when executed by the processor, cause the processor to execute the method according to the first or second aspect of the present disclosure.

[0008] In a fourth aspect, a non-transitory computer-readable storage medium is provided, wherein the non-transitory computer-readable storage medium stores instructions for causing a processor to execute the method according to the first or second aspect of the present disclosure.

[0009] In a fifth aspect, a non-transitory computer-readable recording medium is provided. The non-transitory computer-readable recording medium stores a bitstream of a video generated by a method performed by a video processing device. The method includes: obtaining the number of rows of at least one filter coefficient for determining a CCCM for a current chroma block of the video; and generating a bitstream based on the number of rows.

[0010] In a sixth aspect, a method for storing a bitstream of a video is provided. The method includes: obtaining the number of rows of at least one filter coefficient for determining the CCCM of a current chrominance block of the video; generating a bitstream based on the number of rows; and storing the bitstream in a non-transitory computer-readable recording medium.

[0011] In a seventh aspect, another non-transitory computer-readable recording medium is provided. The non-transitory computer-readable recording medium stores a bitstream of a video generated by a method performed by a video processing device. The method includes: determining information about applying CCCM to a current chrominance block of the video based on a color format of the video; and generating a bitstream based on the information.

[0012] In an eighth aspect, another method for storing a bitstream of a video is provided, the method comprising: determining information about applying CCCM to a current chrominance block of the video based on a color format of the video; generating a bitstream based on the information; and storing the bitstream in a non-transitory computer-readable recording medium.

[0013] This Summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter. BRIEF DESCRIPTION OF THE DRAWINGS

[0014] The above and other objects, features and advantages of example embodiments of the present disclosure will become more apparent from the following detailed description with reference to the accompanying drawings, in which like reference numerals generally refer to like components throughout the example embodiments of the present disclosure.

[0015] Figure 1 A block diagram showing an example video encoding and decoding system according to some embodiments of the present disclosure is shown;

[0016] Figure 2 A block diagram of an example video encoder according to some embodiments of the present disclosure is shown;

[0017] Figure 3 A block diagram of an example video decoder according to some embodiments of the present disclosure is shown;

[0018] Figure 4is a schematic diagram showing the nominal vertical and horizontal positions of 4:2:2 luma and chroma samples in a picture;

[0019] Figure 5 is a schematic diagram showing an example of an encoder block diagram;

[0020] Figure 6 is a schematic diagram showing 67 intra prediction modes;

[0021] Figure 7 is a schematic diagram showing reference samples for wide-angle intra prediction;

[0022] Figure 8 is a schematic diagram showing the discontinuity problem when the direction exceeds 45°;

[0023] Fig. 9 is a schematic diagram showing the locations of samples used to derive α and β;

[0024] Fig.10 is a schematic diagram showing an example of dividing neighboring samples into two groups;

[0025] Fig.11A is a schematic diagram showing the definition of samples used by PDPC applied to the diagonal upper right mode;

[0026] Fig. 11B is a schematic diagram showing the definition of samples used by PDPC applied to the diagonal lower left mode;

[0027] Fig. 11C is a schematic diagram showing the definition of samples used by PDPC applied to the adjacent diagonal upper right mode;

[0028] Fig.11D is a schematic diagram showing the definition of samples used by PDPC applied to the adjacent diagonal lower left mode;

[0029] Fig.12 is a schematic diagram showing a gradient method for a non-vertical / non-horizontal mode;

[0030] Fig.13 is a diagram showing the value of nScale with respect to nTbH and the number of modes; for all cases where nScale<0, the gradient method is used;

[0031] Fig.14 is a schematic diagram showing a flow chart of the current PDPC and PDPC;

[0032] Fig.15 is a schematic diagram showing neighboring blocks (L, A, BL, AR, AL) used to derive a general MPM list;

[0033] Fig.16 is a schematic diagram showing an example of the proposed intra-frame reference mapping;

[0034] Fig.17 is a schematic diagram showing an example of four reference lines adjacent to a prediction block;

[0035] Fig.18A is a schematic diagram showing an example of sub-partitioning for 4×8 and 8×4 CUs;

[0036] Fig.18B is a diagram showing a sub-partition example for a CU other than 4×8, 8×4, and 4×4;

[0037] Fig.19 is a schematic diagram showing a matrix-weighted intra prediction process;

[0038] Fig. 20 is a schematic diagram showing a target sample, a template sample, and a reference sample of a template used in DIMD;

[0039] Fig.21 is a schematic diagram illustrating the proposed intra-block decoding process;

[0040] Fig. 22 is a schematic diagram showing the calculation of HoG from a template with a width of 3 pixels;

[0041] Fig.23 is a schematic diagram showing prediction fusion by weighted averaging of two HoG modes and a plane;

[0042] Fig.24 is a schematic diagram showing the spatial portion of a convolutional filter;

[0043] Fig.25 is a schematic diagram showing a reference area (with its filling) for deriving filter coefficients;

[0044] Fig.26 is a schematic diagram showing a conventional angle IPM and an extended angle IPM;

[0045] FIG. 27A to FIG. 27J is a schematic diagram showing a template used in deriving an IPM for chrominance;

[0046] Fig.28 A flowchart of a method for video processing according to some embodiments of the present disclosure is shown;

[0047] Fig.29 A flowchart showing another method for video processing according to some embodiments of the present disclosure; and

[0048] Fig.30A block diagram of a computing device is shown in which various embodiments of the present disclosure may be implemented.

[0049] Throughout the drawings, same or similar reference numbers generally refer to same or similar elements. DETAILED DESCRIPTION

[0050] The principle of the present disclosure will now be described with reference to some embodiments. It should be understood that these embodiments are described only for the purpose of illustrating and helping those skilled in the art to understand and implement the present disclosure, without implying any limitation on the scope of the present disclosure. In addition to the methods described below, the disclosure described herein can also be implemented in various ways.

[0051] In the following description and claims, unless defined otherwise, all scientific and technical terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which the present disclosure belongs.

[0052] References in this disclosure to "one embodiment," "an embodiment," "an example embodiment," etc. indicate that the described embodiment may include a particular feature, structure, or characteristic, but not every embodiment must include the particular feature, structure, or characteristic. Furthermore, these phrases do not necessarily refer to the same embodiment. Furthermore, when a particular feature, structure, or characteristic is described in conjunction with an example embodiment, whether or not explicitly described, it is considered to be within the knowledge of those skilled in the art to affect such feature, structure, or characteristic in relation to other embodiments.

[0053] It should be understood that although the terms "first" and "second" etc. can be used to describe various elements, these elements should not be limited to these terms. These terms are only used to distinguish one element from another element. For example, a first element can be referred to as a second element, and similarly, a second element can be referred to as a first element without departing from the scope of the exemplary embodiments. As used herein, the term "and / or" includes any and all combinations of one or more of the listed terms.

[0054] The terms used herein are only used for the purpose of describing specific embodiments and are not intended to limit the exemplary embodiments. As used herein, the singular forms "a", "an", and "the" are also intended to include the plural forms unless the context clearly indicates otherwise. It should also be understood that the terms "including", "comprising", and / or "having" when used herein indicate the presence of the features, elements, and / or components, etc., but do not exclude the presence or addition of one or more other features, elements, components, and / or combinations thereof. Example Environment

[0055] Figure 11 is a block diagram illustrating an example video codec system 100 that may utilize the techniques of the present disclosure. As shown, the video codec system 100 may include a source device 110 and a destination device 120. The source device 110 may also be referred to as a video encoding device, and the destination device 120 may also be referred to as a video decoding device. In operation, the source device 110 may be configured to generate encoded video data, and the destination device 120 may be configured to decode the encoded video data generated by the source device 110. The source device 110 may include a video source 112, a video encoder 114, and an input / output (I / O) interface 116.

[0056] Video source 112 may include a source such as a video capture device. Examples of a video capture device include, but are not limited to, an interface that receives video data from a video content provider, a computer graphics system for generating video data, and / or combinations thereof.

[0057] The video data may include one or more pictures. The video encoder 114 encodes the video data from the video source 112 to generate a bitstream. The bitstream may include a bit sequence that forms a coded representation of the video data. The bitstream may include coded pictures and associated data. The coded pictures are coded representations of pictures. The associated data may include sequence parameter sets, picture parameter sets, and other grammatical structures. The I / O interface 116 may include a modulator / demodulator and / or a transmitter. The coded video data may be directly transmitted to the destination device 120 via the network 130A via the I / O interface 116. The coded video data may also be stored on a storage medium / server 130B for access by the destination device 120.

[0058] The destination device 120 may include an I / O interface 126, a video decoder 124, and a display device 122. The I / O interface 126 may include a receiver and / or a modem. The I / O interface 126 may obtain encoded video data from the source device 110 or the storage medium / server 130B. The video decoder 124 may decode the encoded video data. The display device 122 may display the decoded video data to the user. The display device 122 may be integrated with the destination device 120, or may be outside the destination device 120, which is configured to be connected to an external display device interface.

[0059] The video encoder 114 and the video decoder 124 may operate according to a video compression standard, such as the High Efficiency Video Codec (HEVC) standard, the Versatile Video Codec (VVC) standard, and other existing and / or further standards.

[0060] Figure 2is a block diagram showing an example of a video encoder 200 according to some embodiments of the present disclosure, which may be Figure 1 An example of a video encoder 114 in the system 100 is shown.

[0061] Video encoder 200 may be configured to implement any or all of the techniques of this disclosure. Figure 2 In the example of , video encoder 200 includes multiple functional components. The techniques described in this disclosure can be shared between the various components of video encoder 200. In some examples, a processor can be configured to perform any or all of the techniques described in this disclosure.

[0062] In some embodiments, the video encoder 200 may include a partitioning unit 201, a prediction unit 202, a residual generation unit 207, a transformation unit 208, a quantization unit 209, an inverse quantization unit 210, an inverse transformation unit 211, a reconstruction unit 212, a buffer 213 and an entropy coding and decoding unit 214, and the prediction unit 202 may include a mode selection unit 203, a motion estimation unit 204, a motion compensation unit 205 and an intra-frame prediction unit 206.

[0063] In other examples, the video encoder 200 may include more, fewer, or different functional components. In one example, the prediction unit 202 may include an intra-block copy (IBC) unit. The IBC unit may perform prediction in an IBC mode, where at least one reference picture is a picture where the current video block is located.

[0064] Furthermore, although some components (such as the motion estimation unit 204 and the motion compensation unit 205) may be integrated, for the purpose of explanation, these components are described in detail below. Figure 2 are shown separately in the example.

[0065] The partitioning unit 201 may partition a picture into one or more video blocks. The video encoder 200 and the video decoder 300 may support various video block sizes.

[0066] The mode selection unit 203 may select one of a plurality of codec modes (intra-frame coding or inter-frame coding), for example, based on the error result, and provide the generated intra-frame codec block or inter-frame codec block to the residual generation unit 207 to generate residual block data, and to the reconstruction unit 212 to reconstruct the codec block for use as a reference picture. In some examples, the mode selection unit 203 may select a combination of intra-frame and inter-frame prediction (CIIP) modes, where the prediction is based on an inter-frame prediction signal and an intra-frame prediction signal. In the case of inter-frame prediction, the mode selection unit 203 may also select a resolution for the motion vector (e.g., sub-pixel precision or integer pixel precision) for the block.

[0067] To perform inter-frame prediction on the current video block, the motion estimation unit 204 may generate motion information for the current video block by comparing the current video block with one or more reference frames from the buffer 213. The motion compensation unit 205 may determine a predicted video block for the current video block based on the motion information and decoded samples of pictures from the buffer 213 other than the picture associated with the current video block.

[0068] The motion estimation unit 204 and the motion compensation unit 205 may perform different operations on the current video block, for example, depending on whether the current video block is in an I slice, a P slice, or a B slice. As used herein, an "I slice" may refer to a portion of a picture consisting of macroblocks, all of which are based on macroblocks within the same picture. Furthermore, as used herein, in some aspects, a "P slice" and a "B slice" may refer to a portion of a picture consisting of macroblocks that are independent of macroblocks in the same picture.

[0069] In some examples, the motion estimation unit 204 may perform unidirectional prediction on the current video block, and the motion estimation unit 204 may search the reference pictures of list 0 or list 1 to find the reference video block for the current video block. The motion estimation unit 204 may then generate a reference index and a motion vector, the reference index indicating the reference picture in list 0 or list 1 containing the reference video block, and the motion vector indicating the spatial displacement between the current video block and the reference video block. The motion estimation unit 204 may output the reference index, the prediction direction indicator, and the motion vector as the motion information of the current video block. The motion compensation unit 205 may generate a predicted video block for the current video block based on the reference video block indicated by the motion information of the current video block.

[0070] Alternatively, in other examples, the motion estimation unit 204 may perform bidirectional prediction on the current video block. The motion estimation unit 204 may search the reference pictures in list 0 for a reference video block for the current video block, and may also search the reference pictures in list 1 for another reference video block for the current video block. The motion estimation unit 204 may then generate a plurality of reference indexes and a plurality of motion vectors, the plurality of reference indexes indicating a plurality of reference pictures in list 0 and list 1 containing a plurality of reference video blocks, and the plurality of motion vectors indicating a plurality of spatial displacements between the plurality of reference video blocks and the current video block. The motion estimation unit 204 may output the plurality of reference indexes and the plurality of motion vectors of the current video block as motion information of the current video block. The motion compensation unit 205 may generate a predicted video block for the current video block based on the plurality of reference video blocks indicated by the motion information of the current video block.

[0071] In some examples, motion estimation unit 204 may output a complete set of motion information for use in a decoding process by a decoder. Alternatively, in some embodiments, motion estimation unit 204 may signal motion information of a current video block with reference to motion information of another video block. For example, motion estimation unit 204 may determine that motion information of a current video block is sufficiently similar to motion information of a neighboring video block.

[0072] In one example, motion estimation unit 204 may indicate to video decoder 300 a value in a syntax structure associated with the current video block that indicates that the current video block has the same motion information as another video block.

[0073] In another example, the motion estimation unit 204 may identify another video block and a motion vector difference (MVD) in a syntax structure associated with the current video block. The motion vector difference indicates the difference between the motion vector of the current video block and the motion vector of the indicated video block. The video decoder 300 may use the motion vector of the indicated video block and the motion vector difference to determine the motion vector of the current video block.

[0074] As discussed above, the video encoder 200 may signal motion vectors in a predictive manner.Two examples of prediction signaling techniques that may be implemented by the video encoder 200 include Advanced Motion Vector Prediction (AMVP) and merge mode signaling.

[0075] The intra prediction unit 206 may perform intra prediction on the current video block. When the intra prediction unit 206 performs intra prediction on the current video block, the intra prediction unit 206 may generate prediction data for the current video block based on decoded samples of other video blocks in the same picture. The prediction data for the current video block may include a prediction video block and various syntax elements.

[0076] The residual generation unit 207 may generate residual data for the current video block by subtracting (e.g., indicated by a minus sign) the prediction video block(s) of the current video block from the current video block. The residual data of the current video block may include residual video blocks corresponding to different sample portions of samples in the current video block.

[0077] In other examples, such as in skip mode, there may be no residual data for the current video block, and the residual generation unit 207 may not perform a subtraction operation.

[0078] Transform processing unit 208 may generate one or more transform coefficient video blocks for a current video block by applying one or more transforms to the residual video block associated with the current video block.

[0079] After transform processing unit 208 generates a transform coefficient video block associated with the current video block, quantization unit 209 may quantize the transform coefficient video block associated with the current video block based on one or more quantization parameter (QP) values ​​associated with the current video block.

[0080] The inverse quantization unit 210 and the inverse transform unit 211 may apply inverse quantization and inverse transform to the transform coefficient video block, respectively, to reconstruct a residual video block from the transform coefficient video block. The reconstruction unit 212 may add the reconstructed residual video block to corresponding samples from one or more prediction video blocks generated by the prediction unit 202 to generate a reconstructed video block associated with the current video block for storage in the buffer 213.

[0081] After reconstruction unit 212 reconstructs the video block, a loop filtering operation may be performed to reduce video blocking artifacts in the video block.

[0082] The entropy coding unit 214 may receive data from other functional components of the video encoder 200. When the entropy coding unit 214 receives data, the entropy coding unit 214 may perform one or more entropy coding operations to generate entropy coded data and output a bitstream including the entropy coded data.

[0083] Figure 3 is a block diagram showing an example of a video decoder 300 according to some embodiments of the present disclosure, which may be Figure 1 An example of a video decoder 124 in the system 100 is shown.

[0084] Video decoder 300 may be configured to perform any or all of the techniques of this disclosure. Figure 3 In the example of , video decoder 300 includes multiple functional components. The techniques described in this disclosure can be shared between the various components of video decoder 300. In some examples, a processor can be configured to perform any or all of the techniques described in this disclosure.

[0085] exist Figure 3 In the example of , the video decoder 300 includes an entropy decoding unit 301, a motion compensation unit 302, an intra prediction unit 303, an inverse quantization unit 304, an inverse transform unit 305, and a reconstruction unit 306 and a buffer 307. In some examples, the video decoder 300 can perform a decoding process that is generally opposite to the encoding process described with respect to the video encoder 200.

[0086] The entropy decoding unit 301 can retrieve the encoded bitstream. The encoded bitstream may include entropy encoded video data (e.g., encoded video data blocks). The entropy decoding unit 301 can decode the entropy encoded video data, and the motion compensation unit 302 can determine motion information from the entropy decoded video data, the motion information including motion vectors, motion vector precision, reference picture list indexes, and other motion information. The motion compensation unit 302 can determine the information, for example, by performing AMVP and merge mode. AMVP is used, including deriving several most likely candidates based on data and reference pictures of adjacent PBs. The motion information typically includes horizontal and vertical motion vector displacement values, one or two reference picture indexes, and in the case of prediction areas in B strips, also includes an identification of which reference picture list is associated with each index. As used herein, in some aspects, "merge mode" may refer to deriving motion information from blocks that are adjacent in space or time.

[0087] The motion compensation unit 302 may generate motion compensated blocks, possibly performing interpolation based on interpolation filters.Identifiers for the interpolation filters used with sub-pixel precision may be included in the syntax elements.

[0088] The motion compensation unit 302 may calculate interpolated values ​​for sub-integer pixels of a reference block using interpolation filters used by the video encoder 200 during encoding of the video block. The motion compensation unit 302 may determine the interpolation filters used by the video encoder 200 based on received syntax information, and the motion compensation unit 302 may use the interpolation filters to generate a prediction block.

[0089] The motion compensation unit 302 may use at least part of the syntax information to determine the size of blocks used to encode (multiple) frames and / or (multiple) slices of the encoded video sequence, partition information describing how each macroblock of a picture of the encoded video sequence is partitioned, a mode indicating how each partition is encoded, one or more reference frames (and reference frame lists) for each inter-frame coding block, and other information for decoding the encoded video sequence. As used herein, in some aspects, a "slice" may refer to a data structure that can be decoded independently of other slices of the same picture in terms of entropy coding, signal prediction, and residual signal reconstruction. A slice may be an entire picture, or it may be a region of a picture.

[0090] The intra prediction unit 303 may use, for example, an intra prediction mode received in the bitstream to form a prediction block from spatially neighboring blocks. The inverse quantization unit 304 inverse quantizes (i.e., dequantizes) the quantized video block coefficients provided in the bitstream and decoded by the entropy decoding unit 301. The inverse transform unit 305 applies an inverse transform.

[0091] The reconstruction unit 306 may obtain the decoded block, for example, by adding the residual block to the corresponding prediction block generated by the motion compensation unit 302 or the intra prediction unit 303. If necessary, a deblocking filter may also be applied to filter the decoded block to remove blocking artifacts. The decoded video block is then stored in a buffer 307, which provides reference blocks for subsequent motion compensation / intra prediction, and the buffer 307 also generates the decoded video for presentation on a display device.

[0092] Some example embodiments of the present disclosure will be described in detail below. It should be noted that the section titles used in this document are for ease of understanding, and the embodiments disclosed in the section are not limited to that section. In addition, although some embodiments are described with reference to general video codecs or other specific video codecs, the disclosed technology is also applicable to other video coding and decoding technologies. In addition, although some embodiments describe the video encoding steps in detail, it should be understood that the corresponding decoding steps of canceling the encoding will be implemented by the decoder. In addition, the term video processing includes video coding or compression, video decoding or decompression, and video transcoding, in which video pixels are represented from one compression format to another compression format or at different compression bit rates. 1. Overview The present disclosure relates to video coding techniques. Specifically, the present disclosure relates to a coding tool for deriving intra-frame prediction modes of chrominance components using previously decoded blocks, how to transmit the derived intra-frame prediction modes with signals, and coding and decoding of intra-frame prediction modes for chrominance components and other coding tools in image / video coding. It can be applied to existing video coding standards, such as HEVC or Universal Video Codec (VVC). It may also be applicable to future video coding standards or video codecs. 2. Background Video codec standards have evolved primarily through the development of the well-known ITU-T and ISO / IEC standards. ITU-T produced H.261 and H.263, ISO / IEC produced MPEG-1 and MPEG-4 Visual, and the two organizations jointly produced the H.264 / MPEG-2 Video and H.264 / MPEG-4 Advanced Video Codec (AVC) and H.264 / HEVC standards. Since H.262, video codec standards have been based on a hybrid video codec structure that utilizes temporal prediction plus transform codecs. To explore future video codec technologies beyond HEVC, VCEG and MPEG jointly established the Joint Video Exploration Team (JVET) in 2015. Since then, JVET has adopted many new methods and put them into reference software called the Joint Exploration Model (JEM). In April 2018, the Joint Video Experts Group (JVET) between VCEG (Q6 / 16) and ISO / IEC JTC1 SC29 / WG11 (MPEG) was created to work on the VVC standard with the goal of a 50% bitrate reduction compared to HEVC. 2.1. Color Space and Chroma Subsampling A color space, also known as a color model (or color system), is an abstract mathematical model that simply describes the range of colors as a tuple of numbers, usually 3 or 4 values ​​or color components (such as RGB). Basically, a color space is an explanation of coordinate systems and subspaces. For video compression, the most commonly used color spaces are YCbCr and RGB. YCbCr, Y'CbCr or Y Pb / Cb Pr / Cr (also written as YCBCR or Y'CBCR) is a family of color spaces used as part of the color image pipeline in video and digital photography systems. Y' is the luma component, CB and CR are the chroma components of blue difference and red difference. Y' (with a prime) is distinguished from Y, which is luminance, meaning that the light intensity is encoded non-linearly based on the gamma-corrected RGB primaries. Chroma subsampling is the practice of encoding an image by achieving a lower resolution for chroma information than for luminance information, taking advantage of the fact that the human visual system is less sensitive to color differences than to luminance. 2.1.1 4:4:4 Each of the three Y'CbCr components has the same sample rate, so there is no chroma subsampling. This scheme is sometimes used in high-end film scanners and film post-production. 2.1.2 4:2:2 The two chroma components are sampled at half the luma sampling rate: the horizontal chroma resolution is halved, while the vertical chroma resolution remains unchanged. This reduces the bandwidth of the uncompressed video signal by one third with little visual difference. An example of nominal vertical and horizontal positions for a 4:2:2 color format is shown in the VVC working scheme. Figure 4 Depicted. Figure 4 is a schematic diagram showing the nominal vertical and horizontal positions of 4:2:2 luma and chroma samples in a picture. 2.1.3 4:2:0 In 4:2:0, the horizontal sampling is doubled compared to 4:1:1, but the vertical resolution is halved since in this scheme the Cb and Cr channels are sampled only on every alternating line. Therefore, the data rate is the same. Cb and Cr are subsampled by a factor of 2 both horizontally and vertically. There are three variants of the 4:2:0 scheme with different horizontal and vertical positioning. In MPEG-2, Cb and Cr are co-located in the horizontal direction. In the vertical direction, Cb and Cr are located between pixels (at intervals). In JPEG / JFIF, H.261, and MPEG-1, Cb and Cr are positioned halfway between alternate luminance samples. In 4:2:0 DV, Cb and Cr are co-located horizontally. In the vertical direction, they are co-located on alternate lines. Table 2-1 SubWidthC and SubHeightC values ​​derived from chroma_format_idc and separate_colour_plane_flag 2.2. Encoding and decoding process of typical video codecs Figure 5 is a schematic diagram 500 showing a block diagram of an encoder. Figure 5 An example of an encoder block diagram for VVC is shown, which contains three in-loop filtering blocks: deblocking filter (DF), sample adaptive offset (SAO) and ALF. Unlike DF, which uses a predefined filter, SAO and ALF use the original samples of the current picture to reduce the mean square error between the original and reconstructed samples by adding an offset and applying a finite impulse response (FIR) filter, respectively, where the coding side information transmits the offset and filter coefficients through the signal. ALF is located at the last processing stage of each picture and can be seen as a tool that tries to obtain and repair artifacts produced by previous stages. 2.3. Intra-mode codec with 67 intra-prediction modes To capture arbitrary edge directions present in natural videos, the number of directional intra modes is expanded from 33 used in HEVC to 65, as shown in Figure 6 As shown, the planar mode and DC mode remain unchanged. Figure 6 is a schematic diagram showing 67 intra prediction modes 600. These dense directional intra prediction modes are applicable to all block sizes and to both luma intra prediction and chroma intra prediction. In HEVC, each intra-coded block has a square shape, and the length of each of its sides is a power of 2. Therefore, no division operation is required to generate the intra predictor using the DC mode. In VVC, blocks can have a rectangular shape, which in general requires the use of a division operation for each block. To avoid division operations for DC prediction, only the longer sides are used to calculate the average value for non-square blocks. 2.3.1 Wide-angle intra prediction Although 67 modes are defined in VVC, the precise prediction direction for a given intra prediction mode index further depends on the block shape. The traditional angular intra prediction direction is defined as from 45 degrees to -135 degrees in a clockwise direction. In VVC, several traditional angular intra prediction modes are adaptively replaced with wide-angle intra prediction modes for non-square blocks. The replaced mode is notified using the original mode index, which is remapped to the index of the wide-angle mode after parsing. The total number of intra prediction modes remains unchanged, i.e. 67, and the intra mode encoding and decoding method remains unchanged. To support these prediction directions, a top reference of length 2W+1 and a left reference of length 2H+1 are defined, as Figure 7 shown. Figure 7 is a schematic diagram 700 showing reference samples for wide-angle intra prediction. The number of modes replaced in the wide angle direction mode depends on the aspect ratio of the block. The replaced intra prediction modes are shown in Table 2-2. Table 2-2 Intra-frame prediction modes replaced by wide-angle mode Figure 8 8 is a block diagram 800 illustrating the problem of discontinuity when the orientation exceeds 45°. Figure 8As shown, in the case of wide-angle intra prediction, two vertically adjacent prediction samples can use two non-adjacent reference samples. Therefore, a low-pass reference sample filter and side smoothing are applied to wide-angle prediction to reduce the negative impact of the increased gap Δpα. If the wide-angle mode represents a non-fractional offset. In the wide-angle mode, there are 8 modes that meet this condition, which are [-14, -12, -10, -6, 72, 76, 78, 80]. When predicting blocks through these modes, the samples in the reference buffer are directly copied without applying any interpolation. With this modification, the number of samples that need to be smoothed is reduced. In addition, it will align the design of non-fractional modes in the traditional prediction mode and the wide-angle mode. In VVC, 4:2:2 and 4:4:4 chroma formats are supported, as well as the 4:2:0 chroma format. The chroma derivation mode (DM) derivation table for the 4:2:2 chroma format was originally ported from HEVC, expanding the number of entries from 35 to 67 to align with the expansion of intra prediction modes. Since the HEVC specification does not support prediction angles below -135 degrees and above 45 degrees, the luma intra prediction modes ranging from 2 to 5 are mapped to 2. Therefore, the chroma DM derivation table for the 4:2:2 chroma format is updated by replacing some values ​​of the entries of the mapping table to more accurately convert the prediction angles of the chroma blocks. 2.4. Intra-frame prediction mode encoding and decoding for chrominance components For the chroma component of the intra PU, the encoder selects the best chroma prediction mode from five modes: planar, DC, horizontal, vertical, and direct copy of the intra prediction mode for the luminance component. The mapping between the intra prediction direction and the intra prediction mode number for chroma is shown in Table 2-3. When the intra prediction mode number for the chroma component is 4, the intra prediction direction for the luma component is used for intra prediction sample generation for the chroma component. When the intra prediction mode number for the chroma component is not 4 and is consistent with the intra prediction mode number for the luma component, the intra prediction direction 66 is used for intra prediction sample generation for the chroma component. 2.5. Inter-frame prediction For each inter-frame prediction CU, the motion parameters include motion vectors, reference picture indices, and reference picture list usage indices, as well as additional information required for the new coding features of VVC that will be used for inter-frame prediction sample generation. Motion parameters can be signaled in an explicit or implicit manner. When a CU is encoded in skip mode, the CU is associated with one PU and has no significant residual coefficients, no coded motion vector differences (delta) or reference picture indices. A merge mode is specified in which the motion parameters of the current CU are obtained from neighboring CUs, including spatial candidates and temporal candidates, as well as additional scheduling introduced in VVC. Merge mode can be applied to any inter-frame prediction CU, not just skip mode. An alternative to merge mode is explicit transmission of motion parameters, where motion vectors, corresponding reference picture indices for each reference picture list, and reference picture list usage flags, as well as other required information, are explicitly signaled per CU. 2.6. Intra-Block Replication (IBC) Intra-block copy (IBC) is a tool adopted in the HEVC extension on SCC. It is well known that it significantly improves the coding efficiency of screen content materials. Since the IBC mode is implemented as a block-level coding mode, block matching (BM) is performed at the encoder to find the best block vector (or motion vector) for each CU. Here, the block vector is used to indicate the displacement from the current block to the reference block, which has been reconstructed within the current picture. The luminance block vector of the CU encoded and decoded by IBC has integer precision. The chrominance block vector is also rounded to integer precision. When used in conjunction with AMVR, the IBC mode can switch between 1-pixel and 4-pixel motion vector precision. The CU encoded and decoded by IBC is regarded as a third prediction mode in addition to the intra or inter prediction mode. The IBC mode is applicable to CUs whose width and height are both less than or equal to 64 luminance samples. On the encoder side, hash-based motion estimation is performed for IBC. The encoder performs RD checks on blocks with width or height no greater than 16 luma samples. For non-merge mode, a block vector search is first performed using a hash-based search. If the hash search does not return a valid candidate, a local search based on block matching is performed. In hash-based search, the hash key matching (32-bit CRC) between the current block and the reference blocks is extended to all allowed block sizes. The hash key calculation for each position in the current picture is based on 4×4 sub-blocks. For current blocks of larger size, the hash key is determined to match the hash key of the reference block when all hash keys in all 4×4 sub-blocks match the hash keys in the corresponding reference positions. If multiple reference blocks are found whose hash keys match the hash key of the current block, the block vector cost of each matching reference is calculated and the one with the smallest cost is selected. In the block matching search, the search range is set to cover the previous CTU and the current CTU. At the CU level, the IBC mode is signaled through a flag, which can be signaled as IBC AMVP mode or IBC Skip / Merge mode as shown below: -IBC skip / merge mode: The merge candidate index is used to indicate which block vector from the list of neighboring candidate IBC codec blocks is used to predict the current block. The merge list includes spatial candidates, HMVP candidates and pairwise candidates. - IBC AMVP mode: Block vector differences are encoded in the same way as motion vector differences. The block vector prediction method uses two candidates as predictors, one from the left neighbor and one from the top neighbor (in case of IBC codec). When either neighbor is not available, the default block vector is used as predictor. A flag is signaled to indicate the block vector predictor index. 2.7. Cross-component linear model prediction In order to reduce cross-component redundancy, a cross-component linear model (CCLM) prediction mode is used in VVC. For this CCLM prediction mode, chroma samples are predicted based on the reconstructed luma samples of the same CU by using the following linear model: pred C (i,j)=α·rec L ′(i,j)+ β (2-1) where pred C (i,j) represents the predicted chroma sample in the CU, and rec L ′(i,j) represents the downsampled reconstructed luma sample of the same CU. The CCLM parameters (α and β) are derived using up to four neighboring chroma samples and their corresponding downsampled luma samples. Assuming the current chroma block size is W×H, W' and H' are set to - When LM mode is applied, W'=W, H'=H; -When using LM-T mode, W'=W+H; - When LM-L mode is applied, H'=H+W. The upper neighboring position is represented as S[0, -1] ... S[W'-1, -1], and the left neighboring position is represented as S[-1, 0] ... S[-1, H'-1]. Then, four samples are selected as - When LM mode is applied and both the upper and left neighboring samples are available, S[W' / 4,-1], S[3*W' / 4,-1], S[-1,H' / 4], S[-1,3*H' / 4]; - When the LMT mode is applied or only upper neighbor samples are available, S[W' / 8,-1], S[3*W' / 8,-1], S[5*W' / 8,-1], S[7*W' / 8,-1]; -S[-1,H' / 8],S[-1,3*H' / 8],S[-1,5*H' / 8],S[-1,7*H' / 8] when LM-L mode is applied or only left neighbor samples are available. The four neighboring brightness samples at the chosen position are downsampled and compared four times to find the two larger values: x 0 A and x 1 A , and two smaller values: x 0 B and x 1 B Their corresponding chrominance sample values ​​are represented by y 0 A ,y 1 A ,y 0 B and 1 B Then x A 、x B ,y A and B Export as: X a =(x 0 A +x 1 A +1)>>1;X b =(x 0 B +x 1 B +1)>>1;Y a =(y 0 A +y 1 A +1)>>1;Y b =(y 0 B +y 1 B +1)>>1 (2-2) Finally, the parameters α and β of the linear model are obtained according to the following formula. Β=Y b -α·X b (2-4) Fig. 9is a schematic diagram 900 showing the locations of samples used to derive α and β. Fig. 9 Examples of the positions of the left and upper samples and the samples of the current block involved in CCLM mode are shown. The division operation is implemented using a lookup table to calculate the parameter. In order to reduce the memory required to store the table, the diff value (the difference between the maximum and minimum values) and the parameter α are expressed as exponents. For example, diff is approximated by a 4-bit significant part and an exponent. Therefore, the table for 1 / diff is reduced to 16 elements for 16 values ​​of the significant bit, as shown below: DivTable[]={0,7,6,5,5,4,4,3,3,2,2,1,1,0} (2-5) This will help reduce the complexity of the calculations and the memory size required to store the required tables. In addition to the upper template and the left template being used together to calculate the linear model coefficients, they can also be used alternately in two other LM modes, called LM_T mode and LM_L mode. In LM_T mode, only the upper template is used to calculate the linear model coefficients. To obtain more samples, the upper template is expanded to (W+H) samples. In LM_L mode, only the left template is used to calculate the linear model coefficients. To obtain more samples, the left template is expanded to (H+W) samples. In LM mode, the left template and the upper template are used to calculate the linear model coefficients. To match the chroma sampling positions for 4:2:0 video sequences, two types of downsampling filters are applied to luma samples to achieve a 2:1 downsampling ratio in both horizontal and vertical directions. The choice of downsampling filter is specified by the SPS level flag. The two downsampling filters are as follows, corresponding to "type-0" and "type-2" content, respectively. Note that when the upper reference line is at a CTU boundary, only one luma line (normal line buffer in intra prediction) is used for downsampling luma samples. This parameter calculation is performed as part of the decoding process, not just as an encoder search operation. Therefore, no syntax is used to communicate the α and β values ​​to the decoder. For chroma intra mode coding and decoding, a total of 8 intra modes are allowed for chroma intra mode coding and decoding. These modes include five traditional intra modes and three cross-component linear model modes (LM, LM_T and LM_L). The chroma mode signaling and derivation process are shown in Table 2-3. Chroma mode coding and decoding depends directly on the intra prediction mode of the corresponding luminance block. Since separate block partitioning structures for luminance and chrominance components are enabled in the I stripe, one chroma block can correspond to multiple luminance blocks. Therefore, for the chroma DM mode, the intra prediction mode of the corresponding luminance block covering the center position of the current chroma block is directly inherited. Table 2-3 Chroma prediction modes derived from luma mode when CCLM is enabled As shown in Table 2-4, a single binarization table is used regardless of the value of sps_cclm_enabled_flag. Table 2-4 Unified binarization table for chroma prediction mode In Table 2-4, the first binary value indicates whether it is normal mode (0) or LM mode (1). If it is LM mode, the next binary value indicates whether it is LM_CHROMA (0). If it is not LM_CHROMA, the next 1 binary value indicates whether it is LM_L (0) or LM_T (1). For this case, when sps_cclm_enabled_flag is 0, the first binary value of the corresponding intra_chroma_pred_mode binarization table can be discarded before entropy encoding and decoding. Or, in other words, the first binary value is inferred to be 0 and therefore not encoded and decoded. This single binarization table is used for both cases where sps_cclm_enabled_flag is equal to 0 and 1. The first two binary values ​​in Table 2-4 are context encoded and decoded with their own context models, and the remaining binary values ​​are bypass encoded and decoded. Additionally, to reduce luma-chroma latency in dual trees, when a 64×64 luma codec tree node is split with NotSplit (and ISP is not used for 64×64 CUs) or QT, chroma CUs in 32×32 / 32×16 chroma codec tree nodes are allowed to use CCLM in the following manner: — If a 32×32 chroma node is not split or split-QT split, all chroma CUs in the 32×32 node can use CCLM. If a 32x32 chroma node is split with horizontal BT and the 32x16 child nodes are not split or use vertical BT split, all chroma CUs in the 32x16 chroma node can use CCLM. Under all other luma and chroma codec tree partitioning conditions, CCLM is not allowed for chroma CUs. 2.8. Multi-model linear model (MMLM) With MMLM, there can be more than one linear model between luma samples and chroma samples in a CU. In this method, the neighboring luma samples and neighboring chroma samples of the current block are classified into several groups, each of which is used as a training set to derive a linear model (i.e., specific α and β are derived for a specific group). In addition, the samples of the current luma block are also classified based on the same rules for the classification of neighboring luma samples. Neighboring samples can be classified into M groups, where M is 2 or 3. The MMLM method is designed as two additional chroma prediction modes in addition to the original LM mode in the case of M=2 and M=3, which are called MMLM2 and MMLM3. The encoder selects the best mode in the RDO process and transmits it with a signal. When M is equal to 2, Fig.10 An example of classifying neighboring samples into two groups is shown. The threshold is calculated as the average of neighboring reconstructed brightness samples. Neighboring samples with Rec'L[x, y] <= threshold are classified into group 1; while neighboring samples with Rec'L[x, y]> threshold are classified into group 2. Similar to CCLM, there are 3 modes in MMLM, namely MMLM, MMLM_T and MMLM_L. The two models are derived as: The threshold is the average of neighboring samples of the luminance reconstruction. A linear model for each class is derived by using the Least Mean Square (LMS) method (if enabled) or the Min / Max method of VVC. 2.9. Position-dependent intra prediction combination In VVC, the intra prediction results for DC, planar, and several angular modes are further modified by the Position Dependent Intra Prediction Combination (PDPC) method. PDPC is an intra prediction method that calls for a combination of boundary reference samples and HEVC-style intra prediction with filtered boundary reference samples. PDPC is applied to the following intra modes without signaling: planar, DC, intra angles less than or equal to horizontal, and intra angles greater than or equal to vertical and less than or equal to 80. PDPC is not applied if the current block is in BDPCM mode or the MRL index is greater than 0. The prediction sample pred(x',y') is predicted using a linear combination of the intra prediction mode (DC, planar, angular) and the reference sample according to the following equation 2-8: pred(x',y')=Clip(0,(1< <BitDepth)–1,(wL×R -1,y’ +wT×R x’,-1+(64-wL-wT)×pred(x',y')+32)>>6)(2-9) Where R x,-1 ,R -1,y Respectively represent the reference samples located at the top and left boundaries of the current sample (x, y). If PDPC is applied to DC, planar, horizontal and vertical intra modes, no additional boundary filtering is required, as required in the case of HEVC DC mode boundary filtering or horizontal / vertical mode edge filtering. The PDPC process is identical for DC mode and planar mode. For angular modes, if the current angular mode is HOR_IDX or VER_IDX, the left or top reference samples are not used, respectively. The PDPC weights and scaling factors depend on the prediction mode and block size. PDPC is applied to blocks with width and height both greater than or equal to 4. Figures 11A to 11D The reference samples (R x,-1 and R -1,y ). The prediction sample pred(x',y') is located at (x',y') in the prediction block. For example, the reference sample R x,-1 The coordinate x of is given by: x = x' + y' + 1, with reference to sample R -1,y The coordinate y of is similarly given by: y = x' + y' + 1. For other angular modes, the reference sample R x,-1 and R -1,y Can be at a fractional sample position. In this case, the sample value at the nearest integer sample position will be used. 2.10. Gradient PDPC like Fig.12 As shown, the gradient-based approach is extended to non-vertical / non-horizontal modes. Fig.12 shows the gradient method for non-vertical / non-horizontal modes. Here, the gradient is calculated as r(-1,y)–r(-1+d,-1), where d is the horizontal displacement depending on the angular direction. A few points to note here: The gradient term r(-1,y)–r(-1+d,-1) needs to be calculated once per row because it does not depend on the x position. The calculation of d is already part of the original intra prediction process which can be reused, so there is no need to calculate d separately. Therefore, the accuracy of d is 1 / 32 pixel. When d is in fractional position, two-tap (linear) filtering is used, i.e., if dPos is the displacement with 1 / 32 pixel precision, dInt is the (rounded down) integer part (dPos>>5), and dFract is the fractional part with 1 / 32 pixel precision (dPos&31), then r(-1+d) is calculated as: r(-1+d)=(32–dFrac)*r(-1+dInt)+dFrac*r(-1+dInt+1) As described in a, 2-tap filtering is performed once per row (if necessary). Finally, the prediction signal is calculated p(x,y)=Clip(((64–wL(x))*p(x,y)+wL(x)*(r(-1,y)-r(-1+d,-1))+32)>>6)where wL(x)=32>>((x<<1)>>nScale2), nScale2=(log2(nTbH)+log2(nTbW)–2)>>2, which are the same as the vertical / horizontal mode. In short, the same process is applied compared to the vertical / horizontal mode (in fact, d=0 indicates the vertical / horizontal mode). Second, in non-vertical / non-horizontal mode, when (nScale < 0) or when PDPC cannot be applied due to unavailability of sub-reference samples, the gradient-based method is activated. Fig.13 The values ​​of nScale are shown in Figure 2 with respect to TB size and angular mode to better visualize the use of the gradient method. Fig.13 is a diagram showing the value of nScale with respect to nTbH and the number of modes; for all cases where nScale<0, the gradient method is used. In addition, Fig.14 In FIG. 5 , the flow charts of the current PDPC (left) and the proposed PDPC (right) have been shown. 2.11. Secondary MPM JVET-D0114 introduces the secondary MPM list. The existing primary MPM (PMPM) list includes 6 entries, while the secondary MPM (SMPM) list includes 16 entries. First, a general MPM list with 22 entries is constructed, and then the first 6 entries in the general MPM list are included in the PMPM list, and the remaining entries form the SMPM list. The first entry in the general MPM list is the flat mode. Fig.15 As shown, the remaining entries consist of the intra modes of the left (L), above (A), lower left (BL), upper right (AR), and upper left (AL) neighboring blocks, directional modes with additional offsets from the first two available directional modes of the neighboring blocks, and a default mode. Fig.15 is a schematic diagram showing neighboring blocks (L, A, BL, AR, AL) used to derive a general MPM list. If the CU block is vertically oriented, the order of neighboring blocks is A, L, BL, AR, AL; otherwise, it is L, A, BL, AR, AL. First parse the PMPM flag, if it is equal to 1, parse the PMPM index to determine which entry of the PMPM list is selected, otherwise parse the SPMPM flag to determine whether to parse the SMPM index or parse the remaining modes. 2.12.6 Tapped Intra-frame Interpolation Filter In order to improve the prediction accuracy, it is proposed to replace the 4-tap cubic interpolation filter with a 6-tap interpolation filter, and the filter coefficients are derived based on the same polynomial regression model (whose polynomial order is 6). The filter coefficients are shown below, {0, 0, 256, 0, 0, 0}, / / 0 / 32 position {0, -4, 253, 9, -2, 0}, / / 1 / 32 position {1, -7, 249, 17, -4, 0}, / / 2 / 32 position {1, -10, 245, 25, -6, 1}, / / 3 / 32 position {1, -13, 241, 34, -8, 1}, / / 4 / 32 position {2, -16, 235, 44, -10, 1}, / / 5 / 32 position {2, -18, 229, 53, -12, 2}, / / 6 / 32 position {2, -20, 223, 63, -14, 2}, / / 7 / 32 position {2, -22, 217, 72, -15, 2}, / / 8 / 32 position {3, -23, 209, 82, -17, 2}, / / 9 / 32 position {3, -24, 202, 92, -19, 2}, / / 10 / 32 position {3, -25, 194, 101, -20, 3}, / / 11 / 32 position {3, -25, 185, 111, -21, 3}, / / 12 / 32 position {3, -26, 178, 121, -23, 3}, / / 13 / 32 position {3, -25, 168, 131, -24, 3}, / / 14 / 32 position {3, -25, 159, 141, -25, 3}, / / 15 / 32 position {3, -25, 150, 150, -25, 3}, / / half pixel position The reference samples used for interpolation come from the reconstructed samples or the padding samples in HEVC, so no conditional check on the reference sample availability is required. It is proposed to use a 4-tap cubic interpolation filter instead of using a round-to-nearest operation to derive extended intra reference samples. Fig.16 1600 is a diagram showing an example of the proposed intra-frame reference mapping. Fig.16 As shown in the example in , a four-tap interpolation filter is used to derive the value of the reference sample P, while in JEM-3.0 or HM, P is directly set to X1. 2.13. Multiple Reference Line (MRL) Intra Prediction Multiple reference line (MRL) intra prediction uses more reference lines for intra prediction. Fig.17 1700 is a diagram showing an example of four reference lines adjacent to a prediction block. Fig.17 In Figure 1, an example of 4 reference lines is depicted, where the samples of segments A and F are not extracted from the reconstructed neighboring samples, but are filled with the closest samples from segments B and E, respectively. HEVC intra picture prediction uses the nearest reference line (i.e., reference line 0). In MRL, 2 additional lines are used (reference line 1 and reference line 2). The index of the selected reference row (mrl_idx) is signaled and used to generate intra predictions. For reference row indices greater than 0, only additional reference row modes are included in the MPM list, and only the MPM index is signaled without the remaining modes. The reference row index is signaled before the intra prediction mode, and if the reference row index is non-zero, the intra prediction mode does not include the planar mode. MRL is disabled for the first row of a block within a CTU to prevent the use of extended reference samples outside the current CTU row. In addition, PDPC will be disabled when additional rows are used. For MRL mode, the derivation of DC values ​​in DC intra-frame prediction mode for non-zero reference row index is aligned with the derivation of reference row index 0. MRL requires storage of 3 neighboring luma reference rows with a CTU to generate predictions. The downsampling filtering of the Cross Component Linear Model (CCLM) tool also requires 3 neighboring luma reference rows. The definition of MRL using the same 3 rows is consistent with CCLM to reduce the storage requirements of the decoder. 2.14. Intra-frame sub-partitioning (ISP) Intra sub-partitioning (ISP) divides the luma intra prediction block into 2 or 4 sub-partitions vertically or horizontally depending on the block size. For example, the minimum block size of ISP is 4×8 (or 8×4). If the block size is larger than 4×8, the corresponding block will be divided into four sub-partitions. We note that M×128 (M≤64) ISP blocks and 128×N (N≤64) ISP blocks may cause potential problems for 64×64 VDPU. For example, an M×128 CU in the single-tree case has one M×128 luma TB and two corresponding Chroma TB. If the CU uses ISP, then the luma TB will be divided into 4 M×32TBs (can only be split horizontally), each of which is smaller than a 64×64 block. However, in the current ISP design, the chroma blocks are indivisible. Therefore, the size of both chroma components will be larger than a 32×32 block. Similarly, a 128×nCU using ISP can also create a similar situation. Therefore, these two situations are problems for the 64×64 decoder pipeline. Therefore, the CU size that can use ISP is limited to a maximum value of 64×64. Fig.18A is a diagram 1802 showing examples of sub-partitioning for 4x8 and 8x4 CUs. Fig.18B 1804 is a diagram showing sub-partitioning examples for CUs other than 4×8, 8×4, and 4×4. All sub-partitions satisfy the condition of having at least 16 samples. In ISP, 1×N / 2×N sub-block prediction allows to rely on the reconstructed values ​​of previously decoded 1×N / 2×N sub-blocks of the codec block, making the minimum prediction width of the sub-block become four samples. For example, an 8×N (N>4) codec block, when using ISP vertical partitioning codec, is split into two prediction regions, each of size 4×N, and four transforms of size 2×N. Similarly, a 4×N codec block using vertical partitioning ISP codec uses the full 4×N block for prediction; four transforms are used, each of size 1×N. Although 1×N and 2×N transform sizes are allowed, it can be asserted that the transforms of these blocks within the 4×N region can be performed in parallel. For example, when a 4×N prediction region contains four 1×N transforms, there is no transform in the horizontal direction; the transform in the vertical direction can be performed as a single 4×N transform in the vertical direction. Similarly, when a 4×N prediction region contains two 2×N transform blocks, the transform operations of the two 2×N blocks in each direction (horizontally and vertically) can be performed in parallel. Therefore, there is no added latency when processing these smaller blocks compared to processing intra blocks for a 4x4 regular codec. Table 2-5 Entropy encoding and decoding coefficient group size Block size Coefficient group size 1×N,N≥16 1×16 N×1,N≥16 16×1 2×N,N≥8 2×8 N×2,N≥8 8×2 All other possible N×N cases 4×4 For each sub-partition, the reconstructed samples are obtained by adding the residual signal to the prediction signal. Here, the residual signal is generated by processes such as entropy decoding, inverse quantization, and inverse transformation. Therefore, the reconstructed sample values ​​of each sub-partition can be used to generate the prediction of the next sub-partition, and each sub-partition is processed repeatedly. In addition, the first sub-partition to be processed is the sub-partition containing the samples at the top left of the CU, and then continues down (horizontal partitioning) or to the right (vertical partitioning). Therefore, the reference samples used to generate the sub-partition prediction signal are only located to the left and above the line. All sub-partitions share the same intra-frame mode. The following is a summary of the interaction of ISP with other codec tools. – Multiple Reference Lines (MRL): If the MRL index of a block is not 0, the ISP codec mode will be inferred to be 0, so the ISP mode information will not be sent to the decoder. – Entropy Codec Coefficient Group Size: As shown in Table 2-5, the size of the entropy codec sub-blocks has been modified to have 16 samples in all possible cases. It is worth noting that the new size only affects blocks where one of the ISP dimensions is less than 4 samples. In all other cases, the coefficient group maintains 4×4 dimensions. – CBF codec: It is assumed that at least one subpartition has a non-zero CBF. Thus, if n is the number of subpartitions, and the first n-1 subpartitions already yield zero CBF, the CBF of the nth subpartition is inferred to be 1. – Transform size restriction: All ISP transforms with length greater than 16 points use DCT-II. –MTS flag: If the CU uses ISP codec mode, the MTS CU flag will be set to 0 and will not be sent to the decoder. Therefore, the encoder will not perform RD tests on the different available transforms for each result sub-partition. The transform selection for ISP mode will instead be fixed and will be chosen based on the intra mode used, the processing order and the block size. Therefore, no signaling is required. For example, let t H and t V and are the levels selected for the w×h sub-partitions respectively Transform and vertical transform, where w is the width and h is the height. The transform is then selected according to the following rules: - If w=1 or h=1, there is no horizontal transform or vertical transform, respectively. – If w ≥ 4 and w ≤ 16, t H =DST-VII, otherwise t H =DCT-II – If h≥4 and h≤16, t V =DST-VII, otherwise t V =DCT-II In ISP mode, all 67 intra prediction modes are allowed. PDPC is also applied if the corresponding width and height are at least 4 samples long. In addition, the conditions for the reference sample filtering process (reference smoothing) and intra interpolation filter selection no longer exist, and in ISP mode, fractional position interpolation always applies a cubic (DCT-IF) filter. 2.15. Matrix Weighted Intra Prediction (MIP) The matrix weighted intra prediction (MIP) method is a new intra prediction technique added in VVC. In order to predict the samples of a rectangular block of width W and height H, the matrix weighted intra prediction (MIP) takes a row of H reconstructed adjacent boundary samples on the left side of the block and a row of W reconstructed adjacent edge samples above the block as input. If the reconstructed samples are not available, they are generated as in traditional intra prediction. The generation of the prediction signal is based on the following three steps, namely averaging, matrix-vector multiplication and linear interpolation, as shown in Fig.19 shown. Fig.19 is a schematic diagram 1900 illustrating a matrix-weighted intra prediction process. 2.15.1 Average Neighboring Samples Among the boundary samples, four samples or eight samples are selected by averaging based on the block size and shape. Specifically, input boundary bdry top and bdry left It is reduced to a smaller size by averaging the neighboring boundary samples according to a predefined rule that depends on the size of the block. and Then, the two reduced boundaries and Connect to the reduced boundary vector bdry red , so for blocks of shape, the size of the reduced boundary vector is 4×4, while for blocks of all other shapes, the size of the reduced edge vector is 8. If mode refers to a MIP mode, then this cascade is defined as follows: 2.15.2 Matrix Multiplication Taking the average sample as input, a matrix-vector multiplication is performed and then an offset is added. The result is a downscaled prediction signal generated on a subsampled set of samples in the original block. red Generate a reduced prediction signal pred red , the reduced prediction is of width W red and height H red Here, H red and H red Defined as: The reduced prediction signal pred is calculated by computing the matrix-vector product and adding an offset red : pred red =A.bdry red +b (2-13) Here, A is a matrix, and if W = H = 4, then it has W red ·H red rows and 4 columns, in all other cases there are 8 columns. b is W red ·H red The matrix A and the offset vector b are taken from S0, S1, S 2. One of the sets. The index idx=idx(W,H) is defined as follows: Here, each coefficient of matrix A is represented with 8 bits of precision. Set S0 consists of 16 matrices Each matrix has 16 rows and 4 columns, and 16 offset vectors Each offset vector has a size of 16. This set of matrices and offset vectors is used for blocks of size 4×4. Set S1 consists of 8 matrices Each matrix has 8 rows and 8 columns, and 8 offset vectors Each offset vector has a size of 16. Set S2 consists of 6 matrices Each matrix has 64 rows and 8 columns, and 6 offset vectors Each offset vector has a size of 64. 2.15.3 Interpolation The prediction signals at the remaining positions are generated from the prediction signals on the subsampled set by linear interpolation, which is a single-step linear interpolation in each direction. The interpolation is performed first in the horizontal direction and then in the vertical direction, regardless of the shape of the block or the size of the block. 2.15.4 Signaling of MIP Mode and Coordination with Other Codec Tools For each codec unit (CU) in intra mode, a flag is sent to indicate whether the MIP mode is to be applied. If the MIP mode is to be applied, the MIP mode (predModeIntra) is signaled. For the MIP mode, the transposed flag (isTransposed) is used to determine whether the mode is transposed, and the MIP mode identifier (modeId) is used to determine the matrix used for a given MIP mode, which is derived as follows: isTransposed=predModeIntra&1 modeId=predModeIntra>>1 (2-15) The MIP codec mode is coordinated with other codecs by taking into account the following aspects: – Enable LFNST on MIPs on large blocks. Here the LFNST transform in planar mode is used. – The reference sample derivation of MIP is exactly the same as that of the conventional intra prediction mode. – For the upsampling step used in MIP prediction, the original reference samples are used instead of the downsampled samples. – Perform clipping before upsampling instead of after. – Regardless of the maximum transform size, MIP is allowed to be up to 64×64. The number of MIP modes is 32 for sizeld=0, 16 for sizeld=1, and 12 for sizeld=2. 2.16. Decoder-side intra-frame mode export In JEM-2.0, intra modes are extended to 67 modes from 35 in HEVC, and they are derived at the encoder and explicitly signaled to the decoder. In JEM-2.0, a lot of overhead is spent on intra mode encoding and decoding. For example, in all intra codec configurations, the intra mode signaling overhead can be as high as 5-10% of the total bitrate. This contribution proposes an intra mode derivation method on the decoder side to reduce the intra mode encoding and decoding overhead while maintaining prediction accuracy. In order to reduce the overhead of intra mode signaling, this paper proposes a decoder-side intra mode derivation (DIMD) method. In the proposed method, instead of explicitly signaling the intra mode, the encoder and decoder derive the information from the neighboring reconstructed samples of the current block. The intra mode derived by DIMD can be used in two ways: 1) For a 2N×2N CU, when the corresponding CU-level DIMD flag is turned on, the DIMD mode is used as the intra mode for intra prediction; 2) For an N×N CU, the DIMD mode is used to replace a candidate mode in the existing MPM list to improve the efficiency of intra-mode encoding and decoding. 2.16.1 Template-based Intra-mode Export Fig. 20 FIG. 2000 is a schematic diagram showing a target sample, a template sample, and a reference sample of a template used in DIMD. Fig. 20 As shown, the target represents the current block (block size is N) whose intra prediction mode is to be estimated. The template (composed of Fig. 20 The pattern area in the frame specifies a set of reconstructed samples that are used to derive the intra mode. The template size is expressed as the number of samples in the template that extend above and to the left of the target block, i.e., L. In the current implementation, the template size for 4×4 and 8×8 blocks is 2 (i.e., L=2), and the template size for 16×16 and larger blocks is 4 (i.e., L=4). According to the definition of JEM-2.0, the template reference (represented by Fig. 20The dotted area in the figure refers to a set of neighboring samples above and to the left of the template. Unlike template samples that are always from the reconstructed area, the reference samples of the template may not have been reconstructed when encoding / decoding the target block. In this case, the existing reference sample replacement algorithm of JEM-2.0 is used to replace the unavailable reference samples with available reference samples. For each intra prediction mode, DIMD calculates the absolute difference (SAD) between the reconstructed template samples and its predicted samples obtained from the reference samples of the template. The intra prediction mode that produces the smallest SAD is selected as the final intra prediction model for the target block. 2.16.2 DIMD within a 2N×2N CU For intra 2N×2N CUs, DIMD is used as an additional intra mode, which is adaptively selected by comparing the DIMD intra mode with the best normal intra mode (i.e., explicitly signaled). Each intra 2N×2N CU has a flag to indicate the use of DIMD. If the flag is 1, the intra mode derived by DIMD is used to predict the CU; otherwise, DIMD is not applied and the intra mode explicitly signaled in the bitstream is used to predict the CU. When DIMD is enabled, chroma components always reuse the same intra mode derived for luma components, i.e., DM mode. In addition, for each DIMD-encoded CU, blocks in the CU can be adaptively selected to derive their intra modes at the PU level or the TU level. Specifically, when the DIMD flag is 1, another CU-level DIMD control flag signals the level at which DIMD is performed. If the flag is 0, it means that DIMD is performed at the PU level, and all TUs in the PU use the same derived intra mode for intra prediction; otherwise (i.e., the DIMD control flag is 1), it means that DIMD is performed at the TU level, and each TU in the PU derives its own intra mode. In addition, when DIMD is enabled, the number of angular directions increases to 129, and DC mode and planar mode remain unchanged. To accommodate the increased granularity of angular intra modes, the accuracy of frame interpolation value filtering for DIMD-coded CUs is increased from 1 / 32 pixel to 1 / 64 pixel. In addition, in order to use the derived intra mode of a DIMD-coded CU as an MPM candidate mode for neighboring intra blocks, the 129 directions of the DIMD-coded CU are converted to "normal" intra modes (i.e., 65 angular intra directions) before being used as MPMs. 2.16.3 DIMD of Intra-frame N×N CU In the proposed method, the intra modes of an N×N intra CU are always signaled. However, to improve the efficiency of intra mode encoding and decoding, the intra modes derived from DIMD are used as MPM candidates for predicting the intra modes of the four PUs in the CU. In order not to increase the overhead of MPM index signaling, the DIMD candidate is always placed first in the MPM list and the last existing MPM candidate mode is deleted. In addition, a pruning operation is performed so that if a DIMD candidate is redundant, it will not be added to the MPM list. 2.16.4 DIMD Intra-frame Pattern Search Algorithm To reduce the encoding / decoding complexity, a straightforward fast intra mode search algorithm is used for DIMD. First, an initial estimation process is performed to provide a good starting point for the intra mode search. Specifically, an initial candidate list is created by selecting N fixed modes from the allowed intra modes. Then, the SAD is calculated for all candidate intra modes and the one that minimizes the SAD is selected as the starting intra mode. To achieve a good complexity / performance trade-off, the initial candidate list consists of 11 intra modes, including DC, planar, and every 4 modes of the 33 angular intra directions defined by HEVC, i.e., intra modes 0, 1, 2, 6, 10…30, 34. If the starting intra mode is DC or planar, it is used as the DIMD mode. Otherwise, based on the starting intra mode, a refinement process is then applied where the best intra mode is determined with a single iterative search. It works by comparing the SAD values ​​of three intra modes separated by a given search interval in each iteration and keeping the intra mode that minimizes the SAD. Then, the search interval is reduced to half and the intra mode selected from the previous iteration is used as the center intra mode for the current iteration. For the current DIMD implementation with 129 angular intra directions, a maximum of 4 iterations are used in the refinement process to find the best DIMD intra mode. 2.17. Decoder-side intra-mode derivation by calculating gradients of neighboring samples Three angular modes are selected from the Histogram of Gradients (HoG) calculated from the neighboring pixels of the current block. Once these three modes are selected, their predictions are calculated normally and then their weighted average is used as the final prediction for the block. To determine the weights, the corresponding magnitude in the HoG is used for each of the three modes. The DIMD mode is used as an alternative prediction mode and is always checked in FullRD mode. The current version of DIMD has some modifications in signaling, HoG calculation, and prediction fusion. The purpose of this modification is to improve the codec performance and address the complexity issues raised during the last meeting (i.e., throughput of 4×4 blocks). The following sections describe the modifications in each area. 2.17.1 Signaling Fig.21 is a schematic diagram 2100 illustrating the proposed intra-block decoding process. Fig.21 The order of parsing flags / indexes integrated with the proposed DIMD in VTM5 is shown. It can be seen that the DIMD flag of the block is first parsed using a single CABAC context, which is initialized to a default value of 154. If flag == 0, parsing will continue normally. Otherwise (if flag == 1), only the ISP index is parsed, and the following flags / indexes are inferred to be zero: BDPCM flag, MIP flag, MRL index. In this case, the entire IPM parsing is also skipped. During the parsing phase, when a regular non-DIMD block queries its DIMD neighbor's IPM, the pattern PLANAR_IDX is used as a virtual IPM for the DIMD block. 2.17.2 Texture Analysis DIMD's texture analysis includes the calculation of the Histogram of Gradients (HoG) ( Fig. 22 ). The gradient histogram is calculated by applying horizontal and vertical Sobel filtering to the pixels in a template of width 3 around the block. However, if the above template pixels belong to different CTUs, they will not be used for texture analysis. Once calculated, the IPMs corresponding to the two highest histogram bins are selected for the block. In previous versions, all pixels in the template centerline participated in the HoG calculation. However, the current version improves the throughput of this process by applying the Sobel filter more sparsely over 4x4 blocks. For this purpose, only one pixel from the left and one sub-pixel from the top are used. Fig. 22 shown. Fig. 22 is a schematic diagram 2200 showing the calculation of HoG based on a template with a width of 3 pixels. Besides reducing the number of operations for gradient computation, this feature also simplifies the selection of the best 2 patterns from the HoG, since the resulting HoG cannot have more than two non-zero magnitudes. 2.17.3 Prediction Fusion The current approach uses a fusion of three predictions for each block. However, the choice of prediction mode is different and a combined hypothetical intra prediction approach is used, where planar mode is considered to be used in combination with other modes when computing intra prediction candidates. In the current version, the two IPMs corresponding to the two highest HoG stripes are combined with planar mode. Prediction fusion is applied as a weighted average of the three predictions above. For this purpose, the weight of the plane is fixed to 21 / 64 (~1 / 3). The remaining 43 / 64 (~2 / 3) weight is shared between the two HoG IPMs in proportion to the amplitude of their HoG stripes. Fig.23 Shows this process. Fig.23 is a schematic diagram 2300 showing prediction fusion by weighted averaging of two HoG modes and planes. 2.18. Template-based Intra Mode Derivation (TIMD) This contribution proposes a Template-Based Intra Mode Derivation (TIMD) method using MPM, where the TIMD mode is derived from the MPM using neighboring templates. The TIMD mode is used as an additional intra prediction method for a CU. 2.18.1 TIMD mode export For each intra prediction mode in the MPM, the SATD between the prediction sample and the reconstructed sample of the template is calculated. The intra prediction mode with the smallest SATD is selected as the TIMD mode and used for intra prediction of the current CU. Position-dependent intra prediction combination (PDPC) is included in the derivation of the TIMD mode. 2.18.2TIMD Signaling A flag is issued in the sequence parameter set (SPS) to enable / disable the proposed method. When the flag is true, a CU level flag is issued to indicate whether the proposed TIMD method is used. The TIMD flag follows the MIP flag. If the TIMD flag is equal to true, the remaining syntax elements related to the luma intra prediction mode (including MRL, ISP, and normal parsing stage for luma intra prediction mode) will be skipped. 2.18.3 Interaction with new codec tools A DIMD method using planes for prediction fusion is integrated in EE2. When the EE2 DIMD flag is equal to true, the proposed TIMD flag is not signaled and is set to false. Similar to PDPC, gradient PDPC is also included in the derivation of TIMD mode. When the secondary MPM is enabled, both the primary and secondary MPMs are used to derive the TIMD mode. The 6-tap interpolation filter is not used in the export of TIMD mode. 2.18.4 Modification of MPM list construction in TIMD mode export During the construction of the MPM list, when the neighboring block is inter-coded, the intra prediction mode of the neighboring block is derived as a plane. In order to improve the accuracy of the MPM list, when the neighboring block is inter-coded, the propagated intra prediction mode is derived using the motion vector and the reference picture and used for the construction of the MPM list. This modification is only applicable to the export of TIMD mode. 2.18.5 TIMD with Fusion This paper proposes that, for the intra-frame modes derived using the TIMD method, instead of selecting only one mode with the smallest SATD cost, the first two modes with the smallest SATD cost are selected, and then they are fused through weights, and this weighted intra-frame prediction is used to encode and decode the current CU. The costs of the two selected modes are compared to the threshold, applying a cost factor of 2 in the test as follows: costMode2<2×costMode 1. If this condition is true, then blending is applied, otherwise just mode1 is used. The weight of a mode is calculated based on its SATD cost as follows: weight1=costMode2 / (costMode 1+costMode2) weight 2 = 1 - weight 1 2.19. Convolutional Cross-Component Model (CCCM) for Intra Prediction It is proposed to apply a convolutional cross-component model (CCCM) to predict chroma samples from reconstructed luma samples in a similar spirit as done by the current CCLM mode. As in CCLM, when chroma subsampling is used, the reconstructed luma samples are downsampled to match the lower resolution chroma grid. Again, similar to CCLM, there is an option to use a single model or a multi-model variant of CCCM. The multi-model variant uses two models, one derived for samples above the average luminance reference value and the other derived for the remaining samples (following the spirit of the CCLM design). The multi-model CCCM mode can be selected for PUs with at least 128 available reference samples. 2.19.1 Convolutional Filters The proposed convolutional 7-tap filter consists of a 5-tap plus-shaped spatial component, a nonlinear term, and a bias term. The input to the spatial 5-tap component of the filter consists of the following center (C) luma sample, which is co-located with the chroma sample to be predicted and its upper / north (N), lower / south (S), left / west (W), and right / east (E) neighbors, as shown below Fig.24 As shown in . Fig.24is a schematic diagram 2400 showing the spatial portion of a convolution filter. The nonlinear term P is expressed as a power of 2 of the center luminance sample C, and scaled to the sample value range of the content: P=(C*C+midVal)>>bitDepth That is, for 10-bit content, P is calculated as: P=(C*C+512)>>10 The bias term B represents a scalar compensation between input and output (similar to the compensation term in CCLM) and is set to the intermediate chrominance value (512 for 10-bit content). The output of the filter is calculated as the filter coefficient c i Convolution with the input value, clipped to the range of valid chroma samples: predChromaVal=c0C+c1N+c2S+c3E+c4W+c5P+c6B 2.19.2 Calculation of filter coefficients The filter coefficients c are calculated by minimizing the MSE between the predicted chroma samples and the reconstructed chroma samples in the reference region i . Fig.25 is a schematic diagram 2500 showing a reference area (with its filling) for deriving filter coefficients. Fig.25 A reference region consisting of 6 rows of chroma samples above and to the left of the PU is shown. The reference region extends one PU width to the right and one PU height below the PU boundary. The region is adjusted to include only available samples. The extension of the region shown in blue is required to support the "side samples" of the positive shape spatial domain filter and is filled when in an unavailable region. MSE minimization is performed by computing the autocorrelation matrix of the luma input and the cross-correlation vector between the luma input and the chroma output. The autocorrelation matrix is ​​LDL decomposed and the final filter coefficients are computed using back substitution. The process roughly follows the calculation of the ALF filter coefficients in ECM, however, LDL decomposition is chosen instead of Cholesky decomposition to avoid the use of square root operations. The proposed method uses only integer operations. 2.19.3 Bitstream Signaling The use of PU-level flag mode for CABAC codec is signaled. A new CABAC context is included to support this. CCCM is considered a sub-mode of CCLM when it comes to signaling. That is, the CCCM flag is signaled only if the intra prediction mode is LM_CHROMA_IDX (to enable single-mode CCCM) or MMLM_CHROMA_IDX (to enable multi-model CCCM). 3. Question 1. In the above design for intra prediction of chrominance components, the indication of the intra prediction mode is signaled in the bitstream. However, the signaling of the indication may limit the compression efficiency, especially in low bit rate scenarios. 2. In the above design that integrates DIMD and TIMD, division operations and floating points are used to derive the weight of each intra prediction mode, which is not hardware-friendly. 3. In the above design of CCCM, division is used to derive filter coefficients during LDL decomposition, which is not hardware-friendly. 4. Example Embodiments The embodiments described in detail below should be considered as examples for explaining the general concept. These embodiments should not be interpreted in a narrow sense, and furthermore, these embodiments can be combined in any way. In this disclosure, the term decoder-side derivation of intra prediction modes (DDIPM) refers to a codec tool that uses previously decoded blocks / samples to derive intra prediction modes. In one example, DDIPM can also be interpreted as a decoder-side intra mode derivation (DIMD) method or a template-based intra prediction mode (TIMD) method. Fusion means using multiple prediction signals to obtain a final prediction signal for a video unit, where each prediction signal is generated using one intra prediction mode. The term "block" may refer to a codec block (CB), a codec unit (CU), a prediction block (PB), a prediction unit (PU), a transform block (TB), a transform unit (TU), a codec tree block (CTB), a codec tree unit (CTU), or a rectangular area of ​​samples / pixels. In the following discussion, SatShift(x,n) is defined as Shift(x,n) is defined as Shift(x,n)=(x+offset0)>>n. In one example, offset0 and / or offset1 are set to (1 <<n)> >1 or (1<<(n-1)). In another example, offset0 and / or offset1 are set to 0. In another example, offset0=offset1=((1<<n)> >1)-1 or ((1<<(n-1)))-1. Clip3(min, max, x) is defined as About Chroma DM Mode and Chroma Intra Prediction Mode Candidate List 1. When DDIPM is applied to luma and chroma DM mode is applied, the final chroma intra prediction mode depends on the derived IPM mode in DDIPM for luma. a. In one example, the derived IPM for luma may be used as the final chroma intra prediction mode. b. In one example, when the derived IPM for luma and the conventional IPM for chroma are not in the same angular range (for example, the pattern range of the derived IPM for luma is [0,130], while the pattern range of the conventional IPM for chroma is [0,66]), the range of the derived IPM for luma can be modified to be the same range as the conventional IPM for chroma. i. In one example, the modification can be defined as a mapping function, such as MAP131TO67 (x)=(x<2?x:((x>>1)+1)), where x is in the range of [0,130]. c. In one example, when DDIPM is applied to luma, one or more derived IPMs may be added to the chroma intra prediction mode candidate list as additional and / or alternative modes. 2. When DDIPM is applied to chroma, it is proposed that the derived intra prediction mode (IPM) for the chroma component at the decoder can be used to construct the chroma intra prediction mode candidate list. a. In one example, the derived IPM may be added to the chroma intra prediction mode candidate list as an additional mode. i. In one example, the derived IPM may be added at the first position or the last position of the candidate list. ii. In one example, the derived IPM can be added before or after the existing chroma mode. 1) In one example, the existing chroma mode may refer to one of the CCLM modes, or one of the MMLM modes, or a chroma DM mode, or one of the predefined traditional intra prediction modes (eg, planar, DC, horizontal mode, vertical mode). b. In one example, the derived IPM may be added to the chroma intra prediction mode candidate list as an alternative mode. i. In one example, the chroma DM mode is replaced by the derived IPM. ii. In one example, one of the predefined IPMs may be replaced by a derived IPM. 1) For example, planar mode, or DC mode, or horizontal mode, or vertical mode, Either the diagonal mode or the vertical diagonal mode can be replaced by the derived IPM. iii. In one example, one of the CCLM or MMLM modes may be replaced by a derived IPM. c. In one example, when more than one IPM is derived for the chroma component, one or more of the derived IPMs may be added as additional / alternative modes in the chroma intra prediction mode candidate list. d. In one example, how to construct the chroma intra prediction mode candidate lists may be different for the two chroma components. e. In one example, the order of modes in the chroma IPM candidate list other than the derived IPM with the derived IPM may be different from the order of modes in the chroma candidate list without the derived IPM. i. Alternatively, the order of modes in the chroma IPM candidate list other than the derived IPM with the derived IPM may be the same as the order of modes in the chroma candidate list without the derived IPM. Indication of intra prediction mode derivation for chroma components 3. The indication of DDIPM_CHROMA mode can be derived on the fly. a. In one example, if the current chroma block is not encoded using a linear model mode (eg, including CCLM, MMLM), it can be inferred that the DDIPM_CHROMA mode will be used. 4. The indication of DDIPM_CHROMA mode may be signaled conditionally, where the conditions may include: a. Whether DDIPM_CHROMA for brightness is allowed b. Block size and / or block size c. Block Depth d. Strip / picture type and / or partition tree type (single tree, dual tree, or local dual tree) e. Block location f. Color component 5. Whether the current block is coded using DDIPM_CHROMA mode may be signaled using one or more syntax elements. a. In one example, the indication of DDIPM_CHROMA for two chroma components such as Cb and Cr may be signaled as one syntax element, or may be signaled as two syntax elements. i. In one example, whether to apply DDIPM_CHROMA to two chroma components such as Cb and Cr can be controlled together, or can be controlled in a separate manner. b. In one example, the syntax element can be binarized using fixed length codec, or truncated unary codec, or unary codec, or EG codec, or a coded flag. c. In one example, the syntax element may be bypass coded or context coded. i. The context may depend on coded information, such as block size, and / or block size, and / or slice / picture type, and / or information of neighboring blocks (adjacent or non-adjacent), and / or information of other codec tools used for the current block, and / or information of the temporal layer. d. In one example, the syntax element may be signaled before or after the indication of color space conversion, or the indication of CCLM and / or MMLM, or the indication of normal intra prediction mode, or the chroma DM mode. e. In one example, one of the current syntax elements may be replaced to indicate whether DDIPM_CHROMA mode is used for the current block. i. In one example, one of the syntax elements indicating the traditional intra prediction mode may be replaced. 1) In one example, the syntax indicates that plane, or horizontal mode, or vertical mode, or DC mode, or chroma DM may be replaced. 2) In one example, the syntax indicates that one of the CCLM or MMLM modes may be replaced. f. In one example, whether a block is allowed to be coded in DDIPM_CHROMA mode may depend on one or more syntax elements. i. In one example, one or more syntax elements may be signaled as general constraint information. 1) In one example, when the syntax element indicating a general constraint of DDIPM_CHROMA (eg, gci_no_ddipm_chroma_constraint_flag) is equal to X (eg, X=0 or X=1), DDIPM_CHROMA is not allowed. 2) In one example, when any syntax element indicating a general constraint on DDIPM for luma (eg, gci_no_ddipm_constraint_flag or gci_no_ddipm_constraint_flag) is equal to X1 (eg, X1=0 or X1=1). ii. In one example, one or more syntax elements may be signaled at a sequence header / picture header / SPS / VPS / DPS / DCI / PPS / APS / slice header / tile group header. Determine intra prediction mode for chrominance components when the co-located luma block is DDIPM 6. It is proposed that the IPM used in intra prediction for chrominance components may depend on whether its co-located luminance block is coded using DDIPM. a. In one example, when a co-located luma block is encoded with DDIPM and the luma IPM is in the range of extended angle mode (e.g., mode index in [0,130]), the luma IPM can be mapped to the regular IPM range (e.g., mode index in [0,66]) and used as the derived mode for chroma. Fig.26 is a schematic diagram 2600 showing a conventional angle IPM and an extended angle IPM. i. Alternatively, the IPM of luminance is used as the derived pattern without mapping to a conventional range. b. In one example, when a co-located luma block is encoded with DDIPM, the chroma derivation mode is always used for intra prediction for chroma. i. In one example, skipping color space conversion, and / or CCLM, and / or MMLM, and / or signaling of traditional IPM. ii. Alternatively, when the co-located luma block is coded with DDIPM, intra prediction for chroma may use color space conversion, or CCLM, or MMLM, or chroma DM. 1) In one example, in this case, the signaling of the traditional IPM is skipped. Removal of division and floating point operations in TIMD fusion method 7. Instead of using a constant cost factor (ie, 2) in the current design with fused TIMD, it is proposed to use an adaptive cost factor, where the cost factor can depend on codec information. a. In one example, the coding information may refer to a quantization parameter, and / or a slice type, and / or a block size, etc. 8. In the fusion process for intra prediction of luma or chroma, the final prediction can be derived in the fusion process as P = W1×P1+W2×P2+…+Wk×Pk, where W1+W2+…+Wk=1. P1, P2,…Pk represent the prediction values ​​generated by k IPMs. a. In integer form, P = Shift(W1×P1+W2×P2+…+Wk×Pk,s), where W1, W2, ..., Wk are integers, and W1+W2+...+Wk=1< <s。 b. In one example, W1, W2, ..., Wk may depend on the sample position. c. In one example, W1, W2, ..., Wk may depend on at least one of the k IPMs. d. In one example, W1, W2, ..., Wk may depend on at least one cost for k IPMs. 9. In current designs with fused TIMD, the weights of two IPMs are derived using division operations and floating point. Instead, it is proposed to use a look-up table or one or more equations to derive the weights for the two IPMs. a. In one example, the costs of the two IPMs can be modified before deriving the weights using a look-up table. i. In one example, a shift operation with / without compensation can be used in the modification. b. Alternatively, the weights can be derived in the same way as the linear parameters in CCLM and / or MMLM are derived. i. An example of deriving the weights is shown as Example 1. 10. In the above examples, the adaptive cost factor and / or how to remove the division operation can be applied to DDIPM (e.g., DIMD). Remove division and / or floating point operations when deriving coefficients in CCCM 11. It is proposed to remove the division operation from CCCM when deriving the filter coefficients. The current division operation is expressed as y = (a << s) / b, where a, b, and s are integers. a. In one example, the division operation can be replaced by using at least one look-up table. An example is shown in Example 5. i. In one example, at least one lookup table may be provided by the CCCM and at least one other codec tool such as CCLM) sharing to replace the division operation. b. In one example, the same or similar method or Modules or logic can be shared by CCCMs, and at least one indivual other codec tools (such as CCLM) can be used to replace the division operation. c. In one example, a scaling factor s1 can be used to scale (a << s), where s1 is a positive integer. d. In one example, b can be quantized to c, where c is in the form of 2 N ^N, where N is a positive integer, and the division operation is replaced by a shift operation. i. In one example, y = ((a << s) << s1) >> c. ii. Alternatively, b may be required to be c. e. In one example, the division operation can be replaced by a set of shift operations. i. In one example, y = (((a << s) << s1) >> b0)+(a1 >> b1)+(a2 >> b2)+…, where, b0, b1, and b2 are positive integers, and a1, a2 are integers. 12. The derivation of the filter coefficients or in CCCM The solution of the equation usedIt can be used for other codec tools, such as ALF, and / or CC-ALF, and / or SAO, and / or CC-SAO, and / or BIF, and / or BIF chroma, and / or deblocking effect, and / or CCLM, and / or MMLM, and / or MIP. CCCM Signaling 13. It is proposed that the syntax element indicating whether CCCM is enabled (eg, cu_cccm_flag / pu_cccm_flag) may be independent of one or more syntax elements of CCLM and / or MMLM. a. In one example, syntax elements may be signaled prior to signaling of CCLM and / or MMLM. i. Alternatively, the syntax elements may be signaled after the signaling of CCLM and / or MMLM. b. In one example, syntax elements may be signaled prior to DM mode. i. In one example, syntax elements may be signaled after the DM pattern. c. In one example, syntax elements may be signaled prior to DDIPM_CHROMA mode. i. In one example, syntax elements may be signaled after DDIPM_CHROMA mode. d. In one example, the syntax element may be signaled at the beginning of the signaling of the chroma intra prediction mode. e. In one example, the syntax element may be signaled at the end of the signaling of the chroma intra prediction mode. f. In one example, more than one additional syntax element may be signaled to indicate which CCCM is used. 14. Syntax elements indicating whether and / or how CCCM is applied may be in VPS / SPS / PPS / APS / sequence header / picture It is transmitted using signals in slice header / slice header / CTU / CU / PU, etc. 15. CCCM may be controlled and / or signaled separately for different components (eg, Cb and Cr). 16. It is proposed to use more than one context to signal the syntax element (eg, cu_cccm_flag / pu_cccm_flag) indicating whether CCCM is enabled. a. In one example, the context may depend on codec information. i. In one example, the codec information may refer to block size / dimension, and / or codec mode of neighboring blocks, and / or whether one or more neighboring blocks are CCCM coded. ii. In one example, the context may depend on whether the current block is one of the CCLM modes and / or Or one of the MMLM modes. Derivation of filter coefficients in CCCM 17. It is proposed that the number of rows used to derive the filter coefficients in CCCM may not be fixed. a. In one example, the number of rows may be signaled in the bitstream or depend on codec information. i. In one example, the codec information may be block size / dimensions and / or neighboring blocks and / or color format. ii. In one example, different numbers of rows may be used for different block sizes. 1) In one example, when the block height is greater than the block width, the number of rows on the left may be greater than the number of rows above. 2) In one example, when the block width is greater than the block height, the number of rows above may be greater than the number of rows on the left. iii. In one example, the codec information may refer to a gradient of a reference sample. Different color formats for CCCM 18. It is proposed that whether to apply CCCM and / or how to apply CCCM may depend on the color format. A first method of CCCM is applied to a first color format, and a second method of CCCM is applied to a second color format, wherein the second color format is different from the first color format. a. In one example, the color format may refer to a YCbCr color space with different formats such as YUV420, YUV422, YUV444. b. In one example, the color format may refer to the GBR color space. c. In one example, the first method of CCCM may be the same as the second method of CCCM. d. In one example, the first method of CCCM may be different from the second method of CCCM. i. In one example, the number of rows / samples used to derive the filter coefficients may be different in the first method than in the second method. ii. In one example, whether and / or how CCCM is applied using CCLM / MMLM may be different in the first method than in the second method. iii. In one example, the threshold used with the MMLM in CCCM to classify the luma samples into two categories may be different in the first method than in the second method. iv. In one example, the filter shape of the CCCM may be different in the first method than in the second method. v. In one example, the number of taps of the filter and / or the location of the taps may be different in the first method than in the second method. vi. In one example, the downsampling method and / or interpolation filter used to derive the downsampled luma samples in the CCCM may be different in the first method than in the second method. 19. Whether and / or how to apply the method disclosed above can be signaled at the sequence level / picture group level / picture level / slice level / tile group level, for example in the sequence header / picture header / SPS / VPS / DPS / DCI / PPS / APS / slice header / tile group header. 20. Whether and / or how the methods disclosed above may be applied to signal in PB / TB / CB / PU / TU / CU / VPDU / CTU / CTU row / slice / tile / sub-picture / other kinds of regions containing more than one sample or pixel. 21. Whether and / or how to apply the methods disclosed above may depend on the coded information, such as block size, color format, single / dual tree partitioning, color component, slice / picture type. 22. The proposed method disclosed in this document can be used to generate intra prediction in other codecs that require an intra prediction signal (eg CIIP mode). 5. Other embodiments Intra prediction mode derivation for chroma components 1. Instead of signaling an intra prediction mode (IPM) for a block of at least one chroma component, it is proposed to derive an IPM at the decoder, which is used to obtain a prediction / reconstruction of a block for at least one chroma component, where the coded mode of the block is indicated as DDIPM_CHROMA. a. In one example, the template used to derive the IPM for the chroma components may consist of adjacent adjacent reconstructed samples / pixels and / or adjacent non-adjacent reconstructed samples / pixels. i. FIG. 27A to FIG. 27J is a schematic diagram showing a template used in deriving an IPM for chrominance. In one example, if FIG. 27A to FIG. 27J As shown, "Template-LA" consists of the adjacent upper left reconstructed samples, "Template-L" consists of the adjacent left reconstructed samples, "Template-A" consists of the adjacent upper reconstructed samples, "Template-LB" consists of the adjacent lower left reconstructed samples, and "Template-RA" consists of the adjacent upper right reconstructed samples. ii. In one example, the template may consist of (adjacent and / or non-adjacent) adjacent left sides, and / or Or above, and / or upper left, and / or lower left, and / or upper right reconstructed samples. 1) In one example, the template may consist only of adjacent upper left reconstructed samples, or left reconstructed samples, or upper reconstructed samples, or lower left reconstructed samples, or upper right reconstructed samples. For example, "Template-LA" (e.g., Fig.27A ), "Template-L" (e.g. Fig.27D ), "Template-A" (e.g., Fig.27C ), one of "Template-LB" and "Template-RA". 2) In one example, the template may be composed of neighboring reconstructed samples based on a combination of upper left, and / or left side, and / or upper, and / or lower left, and / or upper right reconstructed samples. a) In one example, a template may consist of "Template-L" and "Template-A" Composition, e.g. Fig.27B Example shown. b) In one example, a template may consist of "Template-L" and "Template- LB”, e.g. Fig.27E Example shown. c) In one example, a template may consist of "Template-A" and "Template- RA” composition, e.g. Fig.27F The example shown in . d) In one example, the template may be composed of "Template-A", "Template- L", "Template-LB" and "Template-RA", e.g. Figure 27G The example shown in . e) In one example, the template can be composed of "Template-LA", "Template- A", "Template-L", "Template-LB" and "Template-RA", e.g. Fig.27H The example shown in . 3) In one example, the templates may be non-adjacent, e.g. Fig.27I and Fig.27J The example shown in . iii. In one example, the template consists of samples of component A, which can be used to derive IPM of A (for example, A can be Cb or Cr). iv. In one example, the template consists of samples of component A, which can be used to derive IPM of B. (For example, A can be Cb and B can be Cr; for example, A can be Y and B can be Cr). 1) In one example, A may consist of more than one component, and B may consist of more than one component, for example, A may be Cb and Cr, and B may be Cb and Cr. b. In one example, during the derivation of the IPM for the chroma component, the template is intra-predicted using one of the IPMs from the IPM candidate list, and the IPM with the minimum cost is determined as the derived IPM. i. In one example, the derivation of the IPM for the chroma components may be the same as the derivation of the IPM for the luma component. 1) In one example, the template (eg, shape / size) used to derive the IPM for chroma may be the same as that for luma. 2) In one example, the IPM candidate list used to derive the IPM for chrominance may be the same as that for luma. 3) In one example, how to calculate the cost for deriving the IPM for chrominance can be the same as that for luma. ii. In one example, the shape / size / dimension of the template used to derive the IPM for chroma may be different from that for luma. 1) In one example, the template shape / size / width / height for chrominance may depend on the template shape / size / width / height for luma. The template size / width / height for chrominance is represented as S1 / W1 / H1, and the template size / width / height for luma is represented as Width / height are expressed as S2 / W2 / H2. SubWidthC and SubHeightC are defined in Table 2-1. a) In one example, S1 = S2 / (SubWidth x SubHeight). b) In one example, W1 = W2 / SubWidth. c) In one example, H1 = H2 / SubHeight. iii. In one example, the IPM candidate list used to derive the IPM for chrominance may be different from the IPM candidate list used to derive the IPM for luma. 1) In one example, the IPM candidate list for chroma may consist of one or more IPMs that may be explicitly signaled in conventional intra prediction modes (e.g., 35 IPMs in HEVC, or 67 IPMs in VVC), and / or one or more extended angle IPMs (e.g., Fig.26 ). 2) In one example, the number of IPMs in the IPM candidate list for chrominance may be smaller than the number of IPMs in the IPM candidate list for luma. 3) In one example, the IPM candidate list for chroma may consist of cross-component prediction modes, such as LM and / or LM_T, and / or LM_L, and / or MMLM, and / or MMLM_T, and / or MMLM_L. iv. In one example, how to derive the best IPM from the IPM candidate list for chrominance may be different than that for luma. 1) In one example, during the derivation of IPMs for chroma, some or all of the IPMs may be used or checked during intra prediction for a template. 2) In one example, during derivation of IPM for chroma, early termination may be used. a) In one example, when the cost of an IPM is less than T1, the IPM is determined to be a derived IPM and all remaining unchecked IPMs in the IPM candidate list are skipped, where T1 is a threshold, which may be predefined, or signaled in the bitstream, or depend on codec information. i. In one example, T1 may depend on the number of IPMs checked. ii. In one example, T1 may depend on the cost of the examined IPM. 3) In one example, the IPMs in the IPM candidate list may be reordered during the derivation of the IPM for chroma. 4) In one example, whether and / or how to check the next one or more IPMs may depend on the cost of the already checked IPMs. v. In one example, the sum of absolute transformed differences (SATD) between the predicted samples and the reconstructed samples of the template may be calculated and used to derive the cost (eg, the SATD may be used as the cost). vi. Alternatively, the sum of squared errors (SSE), or the sum of absolute differences (SAD), or the mean removed sum of absolute differences (MRSAD), or a subjective quality metric (e.g., structural similarity index metric (SSIM)) may be calculated and used as the cost (e.g., SSE, SAD, MRSAD, SSIM can be used as cost). 1) Alternatively, the cost can be calculated in the form of D+lambda×R, where D is the distortion metric, such as SAD, SATD, SSE, etc., R represents the number of bits considered, and lambda is a predefined factor or derived on the fly. 2) In one example, some or all samples of the template may be used to calculate the cost. 3) In one example, two chrominance components (e.g., Cb and Cr in the YCbCr color format, or B and R in the RGB color format) can be used to calculate the cost. The cost of the first chrominance component is denoted as C1, the cost of the second chrominance component is denoted as C2, and the total cost is denoted as C. a) In one example, C=C1+C2. b) In one example, C = w1×C1+w2×C2, where w1 and w2 is the weighting factor. i. In one example, w1=1-w2. c) In one example, C = (w1×C1+w2× C2+offset)>>shift, where w1, w2, offset and shift are integers. d) In the above example, w1, w2, offset and shift can be signaled in the bitstream, or predefined, or derived on the fly, Or depends on the codec information. vii. In one example, during derivation of IPMs for chroma, reference samples used in intra prediction for the template may be unfiltered. 1) Alternatively, the reference samples used in intra prediction for the template during IPM derivation can be filtered in the same way as intra prediction for chroma, or intra prediction for luma, or derivation of IPM for luma. viii. In one example, the filtering method (e.g., PDPC or gradient PDPC) used to refine the prediction signal for intra prediction of the block can be used during IPM derivation for chroma. 1) Alternatively, whether or how to apply the prediction signal for refining intra prediction for a template during IPM derivation may be in the same manner as intra prediction for chroma, or intra prediction for luma, or derivation of IPM for luma. ix. In one example, the interpolation filter used in intra-frame prediction for the template during IPM derivation for chroma can be the same as the interpolation filter used in intra-frame prediction for chroma, or the same as the interpolation filter used in intra-frame prediction for luma, or the same as the interpolation filter used in intra-frame prediction during IPM derivation for luma. 1) Alternatively, the interpolation filter used in intra-frame prediction for the template during IPM derivation for chroma may be different from the interpolation filter used in intra-frame prediction for chroma, and / or different from the interpolation filter used in intra-frame prediction for luma, and / or different from the interpolation filter used in intra-frame prediction for the template during IPM derivation for luma. x. In one example, the mode conversion process for the extended IPM in the derivation of the IPM for chroma or luma may be the same as or different from the mode conversion process for the extended IPM used in intra prediction for chroma or luma. c. In one example, a Histogram of Gradients (HoG) is constructed using the samples / pixels in the template, where each bin is mapped to an IPM, and the IPM with the highest magnitude can be used as the derived IPM. i. In one example, IPM derivation for chrominance (e.g., how to construct HoG, or The number of bins in the HoG, or how the bins are mapped to the IPM) can be the same as luma. ii. In one example, the shape / size / dimension of the template for the chroma components can be different from that used in the gradient calculation for the luma component. 1) Alternatively, the ratio of template size for chrominance compared to luma may follow the ratio due to the color format. iii. In one example, the calculation of the gradient for chroma may be different from the calculation of the gradient for luma. 1) In one example, the Sobel operator, or the isotropic Sobel operator, or the Roberts operator, or the Prewitt operator, the Laplace operator, or the Canny operator may be used. operator to calculate the gradient. iv. In one example, the number of bars in the HoG may be equal to or less than the number of conventional IPMs that may be explicitly signaled. v. In one example, the two chrominance components can be used to compute the gradient. d. In the above examples, only one of the chrominance components (eg, Cb or Cr in a YCbCr color format, or B or R in an RGB color format) may be used to derive an IPM (eg, compute a cost or compute a gradient). i. In one example, which chroma component to use can be signaled in the bitstream, or predefined, or determined on the fly, or depend on codec information. ii. In one example, the derived IPM may be used in intra prediction of blocks for two chroma components. 2. In one example, the IPM is derived separately for each chroma component using the method described above. a. In one example, the derivation of IPM may be different for different chroma components. b. In one example, the derived IPM may be different for different chroma components. c. In one example, the derived IPMs may be the same for different chroma components. 3. In the above examples, more than one IPM may be derived and which IPM to use in intra prediction for chroma components may be signaled in the bitstream, and / or determined on the fly, and / or depend on codec information. 4. In one example, a fusion of prediction signals generated by more than one IPM may be used as the final prediction for a block of chroma components. a. In one example, the IPM used in the fusion may consist of one or more derived IPMs and / or one or more predefined patterns or patterns of signal transmission. i. In one example, the predefined mode or the signaled mode may be a cross-component prediction mode, such as LM, and / or LM_T, and / or LM_L, and / or MMLM, and / or MMLM_T, and / or MMLM_L. ii. In one example, the predefined mode or signal transmission mode may be a planar mode, and / or DC mode, and / or horizontal mode, and / or vertical mode, and / or diagonal mode, and / or vertical diagonal patterns. b. In one example, different fusion methods may be applied, where different fusion methods may refer to using different IPMs and / or different weighting factors in the fusion. i. In one example, the weighting factor may depend on the cost or magnitude during the derivation of the IPM. c. In the above examples, whether and / or how to fuse the prediction signal, and / or the number of IPMs used in the fusion, and / or an indication of the fusion method may be signaled in the bitstream, and / or determined on the fly, and / or depend on codec information. i. In one example, whether and / or how to apply a fusion method may depend on the cost or magnitude of the derived IPM. 1) In one example, the cost of the best derived IPM is represented as Cost1, and the cost of the second best derived IPM is represented as Cost2; when Cost2 is less than T× Cost1, a fusion method can be applied, where T is the cost factor. 5. Whether and / or how to apply the method disclosed above may be signaled at the sequence level / picture group level / picture level / slice level / tile group level, for example in a sequence header / picture header / SPS / VPS / DPS / DCI / PPS / APS / slice header / tile group header. 6. Whether and / or how to apply the method disclosed above can signal transmission in a PB / TB / CB / PU / TU / CU / VPDU / CTU / CTU row / strip / tile / sub-picture / other type of region containing more than one sample or pixel. 7. Whether and / or how to apply the method disclosed above can depend on the encoded and decoded information, such as block size, color format, single / double tree partitioning, color component, strip / picture type. 8. The proposed method disclosed in this document can be used to generate intra prediction in other encoding and decoding tools that require intra prediction signals (such as CIIP mode). 6. Embodiment 6.1. Embodiment 1 Example of deriving weights in a TIMD with fusion. x = Floor(Log2(costMode1 + costMode2)) normDiff = (((costMode1 + costMode2) << 4) >> x) & t x += (normDiff!= 0)? 1 : 0 y = Abs(costMode2) > 0? Floor(Log2(Abs(costMode2))) + 1 : 0 weight1 = (costMode2 * (divSigTable[normDiff] | 8) + 2y - 1) >> y k = ((3 + x - y) < 1)? 1 : 3 + x - y weight1 = ((3 + x - y) < 1)? Sign(weight1) * t : weight1 where divSigTable[] is specified as follows: divSigTable[] = {d0, d1, d2, d3, d4, d5, d6, d7, d8, d9, d10, d11, d12, d13, d14, d15} In one example, t = 15, divSigTable[] = {0, 7, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 0} 6.2. Embodiment 2 The cost factor for determining whether to use the fusion method in the intra prediction of the current block may depend on the block size and / or block dimensions. When costMode2 < s × costMode1, the fusion method is used; otherwise, the first derived IPM is used. Represent the block width and block height as W and H. In one example, when W×H is greater than T1, s is equal to S1; otherwise, s is equal to S2, where S1 and S2 are different. For example, S1 = 3 and S2 = 2, or S1 = 2 and S2 = 3, or S1 = 1.8 and S2 = 2, or S1 = 2.2 and S2 = 1.8. In one example, when W is greater than T1, s is equal to S1; otherwise, s is equal to S2, where S1 and S2 are different. For example, S1 = 3 and S2 = 2, or S1 = 2 and S2 = 3, or S1 = 1.8 and S2 = 2, or S1 = 2.2 and S2 = 1.8. In one example, when H is greater than T1, s is equal to S1; otherwise, s is equal to S2, where S1 and S2 are different. For example, S1 = 3 and S2 = 2, or S1 = 2 and S2 = 3, or S1 = 1.8 and S2 = 2, or S1 = 2.2 and S2 = 1.8. In one example, when W / H (or H / W) is greater than T1, s is equal to S1; otherwise, s is equal to S2, where S1 and S2 are different. For example, S1 = 3 and S2 = 2, or S1 = 2 and S2 = 3, or S1 = 1.8 and S2 = 2, or S1 = 2.2 and S2 = 1.8. In one example, when Min(W, H) or Max(W, H) is greater than T1, s is equal to S1; otherwise, s is equal to S2, where S1 and S2 are different. For example, S1 = 3 and S2 = 2, or S1 = 2 and S2 = 3, or S1 = 1.8 and S2 = 2, or S1 = 2.2 and S2 = 1.8. 6.3. Embodiment 3 The cost factor used to determine whether to use the fusion method in the intra prediction of the current block may depend on the quantization parameter (QP). When costMode2 < s×costMode1, the fusion method is used; otherwise, the first derived IPM is used. In one example, when QP is greater than T1, s is equal to S1; otherwise, s is equal to S2, where S1 and S2 are different. For example, T1 = 30, S1 = 3 and S2 = 2, or S1 = 2 and S2 = 3, or S1 = 1.8 and S2 = 2, or S1 = 2.2 and S2 = 1.8. 6.4. Embodiment 4 The cost factor used to determine whether to use the fusion method in the intra prediction of the current block may depend on the slice type. When CostMode2 < s×CostMode1, the fusion method is used; otherwise, the first derived IPM is used. In one example, when the current stripe is an I-stripe, s is equal to S1; when the current stripe is a P / B stripe, s is equal to S2, where S1 and S2 are not the same, such as S1=3 and S2=2, or S1=2 and S2=3, or S1=1.8 and S2=2, or S1=2.2 and S2=1.8. 6.5. Example 5 x = Floor(Log2(a)) normDiff=((a<<s1)> >x)&shift1 x+=(m+(normDiff!=0)?1:0) y=(b*(DivSigTable[normDiff]|n)+(1<<(x-1)))>>x Among them, s1, shift1, m and n are integers. An example of DivSigTable is DivSigTable

[16] ={0,7,6,5,5,4,4,3,3,2,2,1,1,1,1,0} 6.6. Example 6 x = Floor(Log2(a+b)) normDiff=(((a+b)<<s1)> >x)&t x+=(normDiff!=0)? 1:0 w=Abs(b)>0? Floor(Log2(Abs(b)))+1:0 weight1=(b*(divSigTable[normDiff]|h)+2 w-1 )>>w y=((m+xw)<1)? 1:n+xw y=((p+xw)<1)?Sign(y)*t:y Among them, s1, t, h, and w are integers. where divSigTable[] is specified as follows: divSigTable[]={d0,d1,d2,d3,d4,d5,d6,d7,d8,d9,d10,d11,d12,d13,d14,d15}

[0093] Embodiments of the present disclosure relate to the derivation of intra prediction modes for chrominance. As used herein, the term "decoder-side derivation of intra prediction modes (DDIPM)" refers to a codec tool that uses previously decoded blocks or samples to derive intra prediction modes. In one example, DDIPM can be a decoder-side intra mode derivation (DIMD) method. Alternatively, DDIPM can be a template-based intra prediction mode (TIMD) method. The term "fusion" refers to the use of multiple prediction signals to obtain a final prediction signal for a video block, wherein each prediction signal is generated by using an intra prediction mode. The term "block" can represent a codec tree block (CTB), a codec tree unit (CTU), a codec block (CB), a codec unit (CU), a prediction unit (PU), a transform unit (TU), a prediction block (PB), a transform block (TB), a video processing unit including multiple samples / pixels, etc. A block can be rectangular or non-rectangular.

[0094] Fig.28 2800 is a flowchart of a method 2800 for video processing according to some embodiments of the present disclosure. The method 2800 may be implemented during the conversion between the current chrominance block of the video and the bitstream of the video. Fig.28 As shown, method 2800 starts at 2802 and obtains the number of rows of at least one filter coefficient for determining a convolution cross-component model (CCCM) for a current chroma block. In some embodiments, the CCCM can be used in a codec tool that determines the chroma block of a video based on reconstructed samples of a co-located luminance block of the chroma block using a convolution filter (such as a convolution 7-tap filter). In one example, the number of rows can be indicated as a syntax element in the bitstream. Alternatively, the number of rows can be determined based on the codec information of the current chroma block, which will be discussed below. It should be understood that the number of rows can be obtained in any other suitable manner. The scope of the present disclosure is not limited in this regard.

[0095] At 2804, conversion is performed based on the number of rows obtained. For example, at least one filter coefficient for CCCM can be determined based on a group of rows adjacent to the current chroma block. The number of rows in a group of rows is equal to the number of rows obtained. Conversion can be performed based on at least one filter coefficient. In one example, conversion can include encoding the current chroma block into a bitstream. Alternatively or additionally, conversion can include decoding the current chroma block from the bitstream.

[0096] According to the method 2800, the number of rows used to determine at least one filter coefficient for CCCM is not fixed. Compared to conventional solutions where the number of rows is fixed, the proposed method can advantageously provide more flexibility and thus improve coding efficiency.

[0097] In some embodiments, the number of rows may be indicated in the bitstream. Alternatively, the number of rows may depend on the codec information of the current chroma block. For example, the codec information may include the size of the current chroma block, the size of the current chroma block, at least one neighboring block of the current chroma block, the color format of the video, the gradient of the reference sample of the current chroma block, etc.

[0098] In some embodiments, the number of rows used for the current chroma block may be different from the number of rows used for another block having a different size than the current chroma block. In other words, different numbers of rows may be used for different block sizes. In one example, if the height of the current chroma block is greater than the width of the current chroma block, the number of rows to the left of the current chroma block may be greater than the number of rows above the current chroma block. Alternatively, if the width of the current chroma block is greater than the height of the current chroma block, the number of rows above the current chroma block may be greater than the number of rows to the left of the current chroma block.

[0099] In some embodiments, the bitstream of the video may be stored in a non-transitory computer-readable recording medium. The bitstream of the video may be generated by a method performed by a video processing device. According to the method, the number of rows of at least one filter coefficient for determining the CCCM for the current chrominance block may be obtained. In addition, the bitstream may be generated based on the number of rows.

[0100] In some embodiments, the number of rows of at least one filter coefficient for determining the CCCM for the current chrominance block is obtained. In addition, the bitstream can be generated based on the number of rows. The bitstream can be stored in a non-transitory computer-readable recording medium.

[0101] Fig.29 2900 is a flowchart of a method 2900 for video processing according to some embodiments of the present disclosure. The method 2900 may be implemented during the conversion between the current chrominance block of the video and the bitstream of the video. Fig.29 As shown, method 2900 starts at 2902, where information about the application of CCCM to the current chroma block is determined based on the color format of the video. In some embodiments, CCCM can be used in a codec tool that determines the chroma block of the video based on reconstructed samples of the co-located luminance block of the chroma block using a convolution filter (such as a convolution 7-tap filter). For example, the information may include whether CCCM is applied to the current chroma block. Additionally or alternatively, the information may include how to apply CCCM to the current chroma block. In one example, if the color format of the video is YUV420, CCCM can be applied to the current chroma block using MMLM. It should be understood that the above description is described for descriptive purposes only. The scope of the present disclosure is not limited in this regard.

[0102] At 2904, conversion is performed based on the information. In some embodiments, conversion may include encoding the current chrominance block into a bitstream. Alternatively or additionally, conversion may include decoding the current chrominance block from a bitstream.

[0103] According to the method 2900, information about applying CCCM to the current chrominance block is determined based on the color format of the video. Therefore, the proposed method can advantageously improve the coding efficiency.

[0104] In some embodiments, the color format may be a format in a YCbCr color space, such as YUV420, YUV422, or YUV444. Alternatively, the color format may be a format in an RGB color space. It should be understood that the possible implementations of the color formats described herein are merely illustrative and should not be construed as limiting the present disclosure in any way.

[0105] In some embodiments, a first process for a CCCM of a first color format may be the same as a second process for a CCCM of a second color format different from the first color format. Alternatively, the first process for a CCCM of a first color format may be different from the second process for a CCCM of a second color format different from the first color format. In one example, the number of rows used to determine the filter coefficients for the CCCM may be different in the first process than in the second process. In another example, the number of samples used to determine the filter coefficients for the CCCM may be different in the first process than in the second process. In another example, the CCCM may be applied in the first process together with a cross-component linear model (CCLM) or a multi-model linear model (MMLM), and the CCCM may be applied in the second process without the CCLM and the MMLM.

[0106] In yet another example, the threshold used to classify luma samples into a set of categories in a CCCM utilizing an MMLM may be different in the first process than in the second process. In another example, the filter shape of the CCCM may be different in the first process than in the second process. In another example, the number of taps and / or the location of the taps of the filter used for the CCCM may be different in the first process than in the second process. In another example, the downsampling process used to downsample luma samples in the CCCM may be different in the first process than in the second process. Additionally or alternatively, the interpolation filter used to downsample luma samples in the CCCM may be different in the first process than in the second process.

[0107] In some embodiments, the CCCM may be applied to the current chrominance block. The method 2900 may also include determining at least one filter coefficient for the CCCM without using a division operation. Therefore, the proposed method may advantageously avoid a division operation and be more hardware friendly.

[0108] In one example, the division operation for determining at least one filter coefficient can be replaced by a set of lookup tables. The example is shown in Example 5. Additionally, the set of lookup tables can be used by at least one coding and decoding tool other than CCCM, such as CCLM, to replace the division operation. In another example, the division operation for determining at least one filter coefficient can be replaced based on a process, which can also be used by at least one coding and decoding tool (e.g., CCLM) other than CCCM to replace the division operation. In another example, the division operation can be replaced by a module. The module can be used by at least one coding and decoding tool (e.g., CCLM) other than CCCM to replace the division operation. Alternatively, the division operation can be replaced by a logic. The logic can be used by at least one coding and decoding tool (e.g., CCLM) other than CCCM to replace the division operation.

[0109] In some embodiments, the numerator of the division operation for determining at least one filter coefficient can be adjusted by a positive scaling factor. In some embodiments, the denominator of the division operation for determining at least one filter coefficient can be quantized to a predetermined value, and the division operation can be replaced by a group of shift operations. In one example, the predetermined value can be a power of 2. Additionally, a group of shift operations can include multiple shift operations. It should be understood that the above illustrations and / or examples are described only for the purpose of description. The scope of the present disclosure is not limited in this regard.

[0110] In some embodiments, a target syntax element indicating whether to apply CCCM to the current chroma block may be independent of at least one syntax element for CCLM or MMLM.

[0111] In some embodiments, the target syntax element may be indicated in the bitstream before the indication of CCLM and / or the indication of MMLM. Alternatively, the target syntax element may be indicated in the bitstream after the indication of CCLM and / or the indication of MMLM. In some further embodiments, the target syntax element may be indicated in the bitstream before the indication of chroma direct copy of intra-prediction mode for luma component. Alternatively, the target syntax element may be indicated in the bitstream after the indication of chroma direct copy of intra-prediction mode for luma component. In some further embodiments, the target syntax element may be indicated in the bitstream before the indication of decoder-side derivation (DDIPM) of intra-prediction mode for chroma. Alternatively, the target syntax element may be indicated in the bitstream after the indication of decoder-side derivation (DDIPM) of intra-prediction mode for chroma.

[0112] In some embodiments, the target syntax element may be indicated at the beginning of the indication of the chroma intra prediction mode in the bitstream. In some alternative embodiments, the target syntax element may be indicated at the end of the indication of the chroma intra prediction mode in the bitstream.

[0113] In some embodiments, at least one further syntax element indicating that a CCCM is used may be indicated in the bitstream. That is, at least one further syntax element may be signaled to indicate which CCCM is used.

[0114] In some embodiments, a syntax element indicating whether and / or how to apply CCCM to the current chroma block may be indicated in the bitstream. The syntax element may be included in a sequence header, a picture header, a sequence parameter set (SPS), a video parameter set (VPS), a dependency parameter set (DPS), decoding capability information (DCI), a picture parameter set (PPS), an adaptation parameter set (APS), a slice header, a codec tree unit (CTU), a codec unit (CU), or a prediction unit (PU).

[0115] In some embodiments, the CCCM may be indicated separately for the chroma component (such as Cb or Cr) of the current chroma block.

[0116] In some embodiments, the syntax element indicating whether CCCM is applied to the current chroma block can be indicated in the bitstream by using multiple contexts. In one example, the multiple contexts can depend on the codec information of the current chroma block. For example, the codec information can include the size of the current chroma block, the size of the current chroma block, the codec mode of the neighboring blocks of the current chroma block, or whether at least one neighboring block of the current chroma block is coded and decoded using CCCM, etc. In some other embodiments, the multiple contexts can depend on whether the current chroma block is coded and decoded using CCLM or MMLM.

[0117] In some embodiments, the determination of filter coefficients for CCCM or the solution of the equation used in CCCM can be used for at least one codec tool other than CCCM, such as ALF, CC-ALF, SAO, CC-SAO, BIF, BIF chroma, deblocking, CCLM, MMLM and / or MIP. It should be understood that the above illustrations and / or examples are described for descriptive purposes only. The scope of the present disclosure is not limited in this regard.

[0118] In some embodiments, the bitstream of the video may be stored in a non-transitory computer-readable recording medium. The bitstream of the video may be generated by a method performed by a video processing device. According to the method, information about applying CCCM to the current chrominance block is determined based on the color format of the video. In addition, the bitstream may be generated based on the information.

[0119] In some embodiments, information about applying CCCM to the current chroma block is determined based on the color format of the video. In addition, a bitstream can be generated based on the information. The bitstream can be stored in a non-transitory computer-readable recording medium.

[0120] Embodiments of the present disclosure may be described according to the following clauses, and the features of the following clauses may be combined in any reasonable way.

[0121] Item 1. A method for video processing, comprising: during conversion between a current chroma block of a video and a bitstream of the video, obtaining the number of rows for determining at least one filter coefficient for a convolution cross-component model (CCCM) for the current chroma block; and performing the conversion based on the number of rows.

[0122] Clause 2. The method of clause 1, wherein the number of rows is indicated in the bitstream, or the number of rows depends on codec information of the current chroma block.

[0123] Clause 3. A method according to clause 2, wherein the codec information includes at least one of the following: the size of the current chroma block, the dimension of the current chroma block, at least one neighboring block of the current chroma block, or the color format of the video.

[0124] Clause 4. A method according to any one of clauses 1 to 3, wherein the number of rows for the current chroma block is different from the number of rows for another block, the other block having a different size than the current chroma block.

[0125] Clause 5. A method according to any one of clauses 1 to 3, wherein if the height of the current chroma block is greater than the width of the current chroma block, the number of rows to the left of the current chroma block is greater than the number of rows above the current chroma block.

[0126] Clause 6. A method according to any one of clauses 1 to 3, wherein if the width of the current chroma block is greater than the height of the current chroma block, the number of rows above the current chroma block is greater than the number of rows to the left of the current chroma block.

[0127] Clause 7. A method according to clause 2 or 3, wherein the codec information comprises a gradient of a reference sample of the current chroma block.

[0128] Item 8. A method for video processing, comprising: during conversion between a current chroma block of a video and a bitstream of the video, determining information about applying a convolutional cross-component model (CCCM) to the current chroma block based on a color format of the video; and performing the conversion based on the information.

[0129] Clause 9. The method according to clause 8, wherein the information comprises at least one of the following: whether to apply CCCM to the current chroma block, or how to apply CCCM to the current chroma block.

[0130] Clause 10. The method of any one of clauses 8 to 9, wherein the color format is a format in a YCbCr color space or a format in an RGB color space.

[0131] Clause 11. The method of clause 10, wherein the format in the YCbCr color space is one of the following: YUV420, YUV422, or YUV444.

[0132] Clause 12. The method of any of clauses 8 to 11, wherein a first process for a CCCM of a first color format is the same as a second process for a CCCM of a second color format different from the first color format.

[0133] Clause 13. The method of any of clauses 8 to 11, wherein a first process for a CCCM of a first color format is different than a second process for a CCCM of a second color format different from the first color format.

[0134] Clause 14. A method according to clause 13, wherein the number of rows used to determine the filter coefficients for CCCM is different in the first process than in the second process, or the number of samples used to determine the filter coefficients for CCCM is different in the first process than in the second process.

[0135] Clause 15. A method according to any one of clauses 13 to 14, wherein CCCM is applied together with a cross-component linear model (CCLM) or a multi-model linear model (MMLM) in the first process, and CCCM is applied without CCLM and MMLM in the second process.

[0136] Clause 16. The method of any of clauses 13 to 15, wherein thresholds used for classifying luma samples into a set of classes in a CCCM utilizing an MMLM are different in the first process than in the second process.

[0137] Clause 17. The method of any one of clauses 13 to 16, wherein a filter shape of the CCCM is different in the first process than in the second process.

[0138] Clause 18. A method according to any of clauses 13 to 17, wherein at least one of the following in the first process is different from the second process: the number of taps of the filter used for CCCM, or the position of the taps.

[0139] Clause 19. A method according to any one of clauses 13 to 18, wherein at least one of the following in the first process is different from the second process: a downsampling process for downsampling luma samples in CCCM, or an interpolation filter for downsampling luma samples in CCCM.

[0140] Clause 20. A method according to any one of clauses 8 to 19, wherein a CCCM is applied to the current chroma block, and the method further comprises: determining at least one filter coefficient for the CCCM without using a division operation.

[0141] Clause 21. The method of clause 20, wherein a division operation used to determine the at least one filter coefficient is replaced by a set of lookup tables.

[0142] Clause 22. The method of clause 21, wherein the set of lookup tables is used by at least one codec tool other than CCCM to replace a division operation.

[0143] Clause 23. A method according to Clause 20, wherein the division operation used to determine the at least one filter coefficient is replaced based on a process, and the process is used by at least one codec tool other than CCCM to replace the division operation, or the division operation is replaced by a module, and the module is used by at least one codec tool other than CCCM to replace the division operation, or the division operation is replaced by a logic, and the logic is used by at least one codec tool other than CCCM to replace the division operation.

[0144] Clause 24. The method of clause 20, wherein a numerator of a division operation used to determine the at least one filter coefficient is adjusted by a positive scaling factor.

[0145] Clause 25. The method of clause 20 or clause 24, wherein a denominator of a division operation used to determine the at least one filter coefficient is quantized to a predetermined value and the division operation is replaced by a set of shift operations.

[0146] Clause 26. The method of clause 25, wherein the predetermined value is a power of 2.

[0147] Clause 27. The method of any one of clauses 25 to 26, wherein the set of shift operations comprises a plurality of shift operations.

[0148] Clause 28. A method according to any of clauses 8 to 27, wherein a target syntax element is independent of at least one syntax element for CCLM or MMLM, the target syntax element indicating whether CCCM is applied to the current chroma block.

[0149] Clause 29. The method of clause 28, wherein the target syntax element is indicated in the bitstream before or after at least one of: an indication of a CCLM, or an indication of a MMLM.

[0150] Clause 30. A method according to any of clauses 28 to 29, wherein the target syntax element is indicated in the bitstream before or after an indication of a chroma direct copy of an intra prediction mode for a luma component.

[0151] Clause 31. A method according to any of clauses 28 to 30, wherein the target syntax element is indicated in the bitstream before or after an indication of a decoder-side derivation of intra-prediction mode (DDIPM) for chroma.

[0152] Clause 32. A method according to any one of clauses 28 to 31, wherein the target syntax element is indicated at the beginning of the indication of the chroma intra-frame prediction mode in the bitstream, or the target syntax element is indicated at the end of the indication of the chroma intra-frame prediction mode in the bitstream.

[0153] Clause 33. A method according to any of clauses 27 to 32, wherein at least one further syntax element indicating that the CCCM is used is indicated in the bitstream.

[0154] Clause 34. A method according to any one of clauses 8 to 32, wherein a syntax element indicating at least one of the following is indicated in the bitstream: whether CCCM is applied to the current chroma block, or how CCCM is applied to the current chroma block, and the syntax element is included in one of the following: a sequence header, a picture header, a sequence parameter set (SPS), a video parameter set (VPS), a dependency parameter set (DPS), decoding capability information (DCI), a picture parameter set (PPS), an adaptation parameter set (APS), a slice header, a codec tree unit (CTU), a codec unit (CU), or a prediction unit (PU).

[0155] Clause 35. A method according to any one of clauses 8 to 34, wherein CCCM is indicated separately for chroma components of the current chroma block.

[0156] Clause 36. A method according to any one of clauses 8 to 35, wherein a syntax element indicating whether CCCM is applied to the current chroma block is indicated in the bitstream by using multiple contexts.

[0157] Clause 37. The method of clause 36, wherein the plurality of contexts depends on codec information of the current chroma block.

[0158] Clause 38. A method according to Clause 37, wherein the coding and decoding information includes at least one of the following: the size of the current chroma block, the dimension of the current chroma block, the coding and decoding mode of the neighboring blocks of the current chroma block, or whether at least one neighboring block of the current chroma block is encoded and decoded using CCCM.

[0159] Clause 39. The method of clause 36, wherein the plurality of contexts depends on whether the current chroma block is encoded using CCLM or MMLM.

[0160] Clause 40. A method according to any of clauses 8 to 39, wherein the determination of filter coefficients for CCCM or the solution of equations used in CCCM is used for at least one codec tool other than CCCM.

[0161] Clause 41. A method according to clause 40, wherein the at least one coding tool includes at least one of the following: adaptive loop filter (ALF), cross-component adaptive loop filter (CC-ALF), sample adaptive offset (SAO), cross-component sample adaptive offset (CC-SAO), bilateral filter (BIF), BIF chroma, deblocking effect, CCLM, MMLM, or matrix weighted intra prediction (MIP).

[0162] Clause 42. A method according to any one of clauses 1 to 41, wherein the CCCM is used in a codec tool that determines the chroma block of the video based on reconstructed samples of a co-located luminance block of the chroma block using a convolution filter.

[0163] Clause 43. A method according to any one of clauses 1 to 42, wherein the converting comprises encoding the current chroma block into the bitstream.

[0164] Clause 44. A method according to any one of clauses 1 to 42, wherein the converting comprises decoding the current chroma block from the bitstream.

[0165] Clause 45. An apparatus for processing video data, comprising a processor and a non-transitory memory having instructions thereon, wherein the instructions, when executed by the processor, cause the processor to perform the method of any one of clauses 1 to 44.

[0166] Clause 46. A non-transitory computer-readable storage medium storing instructions that cause a processor to perform the method of any one of clauses 1 to 44.

[0167] Item 47. A non-transitory computer-readable recording medium storing a bitstream of a video generated by a method performed by a video processing device, wherein the method comprises: obtaining the number of rows of at least one filter coefficient for a convolution cross-component model (CCCM) for determining a current chroma block of the video; and generating the bitstream based on the number of rows.

[0168] Clause 48. A method for storing a bitstream of a video, comprising: obtaining the number of rows of at least one filter coefficient for determining a convolution cross-component model (CCCM) for a current chroma block of the video; generating the bitstream based on the number of rows; and storing the bitstream in a non-transitory computer-readable recording medium.

[0169] Item 49. A non-transitory computer-readable recording medium storing a bitstream of a video generated by a method performed by a video processing device, wherein the method comprises: determining information about applying a convolutional cross-component model (CCCM) to a current chroma block of the video based on a color format of the video; and generating the bitstream based on the information.

[0170] Item 50. A method for storing a bitstream of a video, comprising: determining, based on a color format of the video, information about applying a convolutional cross-component model (CCCM) to a current chroma block of the video; generating the bitstream based on the information; and storing the bitstream in a non-transitory computer-readable recording medium. Example Device

[0171] Fig.30 A block diagram of a computing device 3000 in which various embodiments of the present disclosure may be implemented is shown. The computing device 3000 may be implemented as a source device 110 (or video encoder 114 or 200) or a destination device 120 (or video decoder 124 or 300), or may be included in a source device 110 (or video encoder 114 or 200) or a destination device 120 (or video decoder 124 or 300).

[0172] It should be understood that Fig.30 The computing device 3000 shown in the figure is for illustration purposes only and is not intended to in any way imply any limitation on the functionality and scope of the embodiments of the present disclosure.

[0173] like Fig.30 As shown, computing device 3000 includes a general computing device 3000. Computing device 3000 may include at least one or more processors or processing units 3010, memory 3020, storage unit 3030, one or more communication units 3040, one or more input devices 3050, and one or more output devices 3060.

[0174] In some embodiments, the computing device 3000 can be implemented as any user terminal or server terminal with computing power. The server terminal can be a server provided by a service provider, a large computing device, etc. The user terminal can be, for example, any type of mobile terminal, fixed terminal or portable terminal, including a mobile phone, a station, a unit, a device, a multimedia computer, a multimedia tablet computer, an Internet node, a communicator, a desktop computer, a laptop computer, a notebook computer, a netbook computer, a personal communication system (PCS) device, a personal navigation device, a personal digital assistant (PDA), an audio / video player, a digital camera / camcorder, a positioning device, a television receiver, a radio broadcast receiver, an electronic book device, a gaming device, or any combination thereof, and includes the accessories and peripherals of these devices, or any combination thereof. It is conceivable that the computing device 3000 can support any type of interface to the user (such as a "wearable" circuit device, etc.).

[0175] The processing unit 3010 may be a physical processor or a virtual processor and may implement various processes based on a program stored in the memory 3020. In a multi-processor system, a plurality of processing units execute computer executable instructions in parallel to improve the parallel processing capability of the computing device 3000. The processing unit 3010 may also be referred to as a central processing unit (CPU), a microprocessor, a controller, or a microcontroller.

[0176] The computing device 3000 typically includes various computer storage media. Such media can be any media accessible by the computing device 3000, including but not limited to volatile media and non-volatile media, or removable media and non-removable media. The memory 3020 can be a volatile memory (e.g., a register, a cache, a random access memory (RAM)), a non-volatile memory (such as a read-only memory (ROM), an electrically erasable programmable read-only memory (EEPROM) or flash memory) or any combination thereof. The storage unit 3030 can be any removable or non-removable medium, and can include machine-readable media, such as a memory, a flash drive, a disk or other media that can be used to store information and / or data and can be accessed in the computing device 3000.

[0177] The computing device 3000 may also include additional removable / non-removable storage media, volatile / non-volatile storage media. Fig.30 Although not shown in the figure, a magnetic disk drive for reading from and / or writing to a removable nonvolatile magnetic disk and an optical disk drive for reading from and / or writing to a removable nonvolatile optical disk may be provided. In this case, each drive may be connected to the bus (not shown) via one or more data medium interfaces.

[0178] The communication unit 3040 communicates with another computing device via a communication medium. In addition, the functions of the components in the computing device 3000 can be implemented by a single computing cluster or multiple computing machines that can communicate via a communication connection. Therefore, the computing device 3000 can operate in a networked environment using logical connections to one or more other servers, networked personal computers (PCs), or other general network nodes.

[0179] The input device 3050 may be one or more of various input devices, such as a mouse, keyboard, trackball, voice input device, etc. The output device 3060 may be one or more of various output devices, such as a display, a speaker, a printer, etc. With the aid of the communication unit 3040, the computing device 3000 may also communicate with one or more external devices (not shown), such as storage devices and display devices, and the computing device 3000 may also communicate with one or more devices that enable a user to interact with the computing device 3000, or any device that enables the computing device 3000 to communicate with one or more other computing devices (e.g., a network card, a modem, etc.), if necessary. Such communication may be performed via an input / output (I / O) interface (not shown).

[0180] In some embodiments, some or all components of the computing device 3000 may also be arranged in a cloud computing architecture rather than being integrated in a single device. In a cloud computing architecture, components may be provided remotely and work together to implement the functions described in the present disclosure. In some embodiments, cloud computing provides computing, software, data access and storage services, which will not require the end user to know the physical location or configuration of the system or hardware that provides these services. In various embodiments, cloud computing provides services via a wide area network (e.g., the Internet) using a suitable protocol. For example, a cloud computing provider provides applications via a wide area network, which can be accessed through a web browser or any other computing component. The software or components of the cloud computing architecture and the corresponding data may be stored on a remote server. The computing resources in a cloud computing environment may be merged or distributed at the location of a remote data center. Cloud computing infrastructure may provide services through a shared data center, although they appear as a single access point for users. Therefore, the cloud computing architecture may be used to provide the components and functions described herein from a service provider at a remote location. Alternatively, they may be provided by a conventional server, or installed directly or otherwise on a client device.

[0181] In an embodiment of the present disclosure, the computing device 3000 may be used to implement video encoding / decoding. The memory 3020 may include one or more video encoding / decoding modules 3025 having one or more program instructions. These modules can be accessed and executed by the processing unit 3010 to perform the functions of the various embodiments described herein.

[0182] In an example embodiment performing video encoding, input device 3050 may receive video data as input 3070 to be encoded. The video data may be processed by, for example, video codec module 3025 to generate an encoded bitstream. The encoded bitstream may be provided as output 3080 via output device 3060.

[0183] In an example embodiment performing video decoding, input device 3050 may receive an encoded bitstream as input 3070. The encoded bitstream may be processed by, for example, video codec module 3025 to generate decoded video data. The decoded video data may be provided as output 3080 via output device 3060.

[0184] Although the present disclosure has been specifically shown and described with reference to the preferred embodiments of the present disclosure, it will be understood by those skilled in the art that various changes can be made in form and detail without departing from the spirit and scope of the present application as defined by the appended claims. These changes are intended to be encompassed by the scope of the present application. Therefore, the foregoing description of the embodiments of the present application is not intended to be limiting.

Claims

1. A method for video processing, comprising: During conversion between a current chroma block of a video and a bitstream of the video, obtaining a number of rows used to determine at least one filter coefficient for a convolutional cross-component model (CCCM) for the current chroma block; and The converting is performed based on the number of rows.

2. A method according to claim 1, wherein the number of rows is indicated in the bit stream, or The number of the rows depends on the coding information of the current chrominance block.

3. The method according to claim 2, wherein the codec information includes at least one of the following: The size of the current chroma block, The size of the current chroma block, at least one neighboring block of the current chrominance block, or The color format of the video.

4. The method according to any one of claims 1 to 3, wherein the number of rows for the current chroma block is different from the number of rows for another block, the other block having a different size than the current chroma block.

5. The method according to any one of claims 1 to 3, wherein if the height of the current chroma block is greater than the width of the current chroma block, the number of the rows to the left of the current chroma block is greater than the number of the rows above the current chroma block.

6. The method according to any one of claims 1 to 3, wherein if the width of the current chroma block is greater than the height of the current chroma block, the number of the rows above the current chroma block is greater than the number of the rows to the left of the current chroma block.

7. The method according to claim 2 or 3, wherein the codec information includes a gradient of a reference sample of the current chroma block.

8. A method for video processing, comprising: During conversion between a current chroma block of a video and a bitstream of the video, determining, based on a color format of the video, information regarding application of a convolutional cross-component model (CCCM) to the current chroma block; as well as The converting is performed based on the information.

9. The method according to claim 8, wherein the information includes at least one of the following: whether to apply CCCM to the current chroma block, or How to apply CCCM to the current chroma block.

10. The method according to any one of claims 8 to 9, wherein the color format is a format in a YCbCr color space or a format in an RGB color space.

11. The method of claim 10, wherein the format in the YCbCr color space is one of the following: YUV420, YUV422, or YUV444.

12. The method of any one of claims 8 to 11, wherein a first process for a CCCM of a first color format is the same as a second process for a CCCM of a second color format different from the first color format.

13. The method of any one of claims 8 to 11, wherein a first process for a CCCM of a first color format is different from a second process for a CCCM of a second color format different from the first color format.

14. The method of claim 13, wherein the number of rows used to determine filter coefficients for CCCM is different in the first process than in the second process, or The number of samples used to determine filter coefficients for CCCM is different in the first process than in the second process.

15. The method according to any one of claims 13 to 14, wherein CCCM is applied together with a cross-component linear model (CCLM) or a multiple model linear model (MMLM) in the first process, and CCCM is applied without CCLM and MMLM in the second process.

16. The method according to any one of claims 13 to 15, wherein thresholds used for classifying luma samples into a set of classes in CCCM using MMLM are different in the first process than in the second process.

17. The method according to any one of claims 13 to 16, wherein the filter shape of the CCCM is different in the first process than in the second process.

18. The method according to any one of claims 13 to 17, wherein at least one of the following in the first process is different from the second process: The number of taps of the filter used for CCCM, or The location of the tap.

19. The method according to any one of claims 13 to 18, wherein at least one of the following in the first process is different from the second process: A downsampling process used to downsample luma samples in CCCM, or Interpolation filter used to downsample luma samples in CCCM.

20. The method according to any one of claims 8 to 19, wherein CCCM is applied to the current chrominance block, and the method further comprises: At least one filter coefficient for the CCCM is determined without using a division operation.

21. The method of claim 20, wherein a division operation used to determine the at least one filter coefficient is replaced by a set of lookup tables.

22. The method of claim 21, wherein the set of lookup tables is used by at least one codec tool other than CCCM to replace a division operation.

23. The method of claim 20, wherein a division operation for determining the at least one filter coefficient is replaced based on a process, and the process is used by at least one codec tool other than CCCM to replace the division operation, or The division operation is replaced by a module, and the module is used by at least one codec tool other than CCCM to replace the division operation, or The division operation is replaced by a logic, and the logic is used by at least one codec tool other than CCCM to replace the division operation.

24. The method of claim 20, wherein a numerator of a division operation used to determine the at least one filter coefficient is adjusted by a positive scaling factor.

25. A method according to claim 20 or claim 24, wherein the denominator of a division operation used to determine the at least one filter coefficient is quantized to a predetermined value and the division operation is replaced by a set of shift operations.

26. The method of claim 25, wherein the predetermined value is a power of 2.

27. The method of any one of claims 25 to 26, wherein the set of shift operations comprises a plurality of shift operations.

28. The method according to any one of claims 8 to 27, wherein a target syntax element is independent of at least one syntax element for CCLM or MMLM, the target syntax element indicating whether CCCM is applied to the current chroma block.

29. The method of claim 28, wherein the target syntax element is indicated in the bitstream before or after at least one of: Instructions from CCLM, or Instructions for MMLM.

30. The method of any one of claims 28 to 29, wherein the target syntax element is indicated in the bitstream before or after an indication of a chroma direct copy of an intra prediction mode for a luma component.

31. The method of any one of claims 28 to 30, wherein the target syntax element is indicated in the bitstream before or after an indication of a decoder-side derived intra prediction mode (DDIPM) for chroma.

32. A method according to any one of claims 28 to 31, wherein the target syntax element is indicated at the beginning of an indication of a chroma intra prediction mode in the bitstream, or The target syntax element is indicated at the end of the indication of the chroma intra prediction mode in the bitstream.

33. A method according to any one of claims 27 to 32, wherein at least one further syntax element indicating that the CCCM is used is indicated in the bitstream.

34. A method according to any one of claims 8 to 32, wherein A syntax element indicating at least one of the following is indicated in the bitstream: whether to apply CCCM to the current chroma block, or how to apply the CCCM to the current chroma block, and The syntax element is included in one of the following: Sequence header, Picture header, Sequence Parameter Set (SPS), Video Parameter Set (VPS), Dependency Parameter Set (DPS), Decoding Capability Information (DCI), Picture Parameter Set (PPS), Adaptive Parameter Set (APS), Strip head, Codec Tree Unit (CTU), Codec Unit (CU), or Prediction Unit (PU).

35. The method according to any one of claims 8 to 34, wherein CCCM is indicated separately for the chroma components of the current chroma block.

36. The method according to any one of claims 8 to 35, wherein a syntax element indicating whether CCCM is applied to the current chroma block is indicated in the bitstream by using a plurality of contexts.

37. The method of claim 36, wherein the plurality of contexts depends on codec information of the current chroma block.

38. The method according to claim 37, wherein the codec information comprises at least one of the following: The size of the current chroma block, The size of the current chroma block, The coding mode of the neighboring blocks of the current chrominance block, or Whether at least one neighboring block of the current chrominance block is encoded and decoded using CCCM.

39. The method of claim 36, wherein the plurality of contexts depends on whether the current chroma block is encoded using CCLM or MMLM.

40. The method according to any one of claims 8 to 39, wherein the determination of filter coefficients for CCCM or the solution of equations used in CCCM is used for at least one codec tool other than CCCM.

41. The method of claim 40, wherein the at least one codec tool comprises at least one of: Adaptive loop filter (ALF), Cross-Component Adaptive Loop Filter (CC-ALF), Sample Adaptive Offset (SAO), Cross-Component Sample Adaptive Offset (CC-SAO), Bilateral filter (BIF), BIF Chroma, Deblocking effect, CCLM, MMLM, or Matrix Weighted Intra Prediction (MIP).

42. The method according to any one of claims 1 to 41, wherein the CCCM is used in a codec tool that determines a chroma block of the video based on reconstructed samples of a co-located luminance block of the chroma block using a convolution filter.

43. A method according to any one of claims 1 to 42, wherein the converting comprises encoding the current chroma block into the bitstream.

44. The method of any one of claims 1 to 42, wherein the converting comprises decoding the current chroma block from the bitstream.

45. An apparatus for processing video data, comprising a processor and a non-transitory memory having instructions thereon, wherein the instructions, when executed by the processor, cause the processor to perform the method of any one of claims 1 to 44.

46. ​​A non-transitory computer-readable storage medium storing instructions, the instructions causing a processor to execute the method according to any one of claims 1 to 44.

47. A non-transitory computer-readable recording medium storing a bitstream of a video generated by a method performed by a video processing device, wherein the method comprises: Retrieve a number of rows for determining at least one filter coefficient for a convolutional cross-component model (CCCM) for a current chroma block of the video; as well as The bitstream is generated based on the number of rows.

48. A method for storing a bitstream of a video, comprising: Retrieve a number of rows for determining at least one filter coefficient for a convolutional cross-component model (CCCM) for a current chroma block of the video; generating the bitstream based on the number of rows; as well as The bit stream is stored in a non-transitory computer-readable recording medium.

49. A non-transitory computer-readable recording medium storing a bitstream of a video generated by a method performed by a video processing device, wherein the method comprises: Based on a color format of the video, determining information about applying a convolutional cross-component model (CCCM) to a current chroma block of the video; as well as The bitstream is generated based on the information.

50. A method for storing a bitstream of a video, comprising: Based on a color format of the video, determining information about applying a convolutional cross-component model (CCCM) to a current chroma block of the video; generating the bitstream based on the information; as well as The bit stream is stored in a non-transitory computer-readable recording medium.