Method, apparatus, and medium for video processing

Abstract

Embodiments of the disclosure provide a solution for video processing. A method for video processing is proposed. The method includes: determining, for a conversion between a block of a video and a bitstream of the video, at least one binarized bin of a syntax element (SE) associated with the block based on at least one of a context or a plurality of factors; and performing the conversion based on the at least one binarized bin of the SE.

Description

METHOD, APPARATUS, AND MEDIUM FOR VIDEO PROCESSINGFIEEDS

[0001] Embodiments of the present disclosure relates generally to video processing techniques, and more particularly, to method of entropy coding.BACKGROUND

[0002] In nowadays, digital video capabilities are being applied in various aspects of peoples’ lives. Multiple types of video compression technologies, such as motion picture expert group (MPEG) -2, MPEG-4, international telecommunication union - telecommunication standardization sector (ITU-T) H.263, ITU-T H.264 / MPEG-4 Part 10 advanced video coding (AVC), ITU-T H.265 high efficiency video coding (HEVC) standard, versatile video coding (VVC) standard, have been proposed for video encoding / decoding. However, coding efficiency of video coding techniques is generally expected to be further improved.SUMMARY

[0003] Embodiments of the present disclosure provide a solution for video processing.

[0004] In a first aspect, a method for video processing is proposed. The method comprises: determining, for a conversion between a block of a video and a bitstream of the video, at least one binarized bin of a syntax element (SE) associated with the block based on at least one of a context or a plurality of factors; and performing the conversion based on the at least one binarized bin of the SE. The method in accordance with the first aspect of the present disclosure can advantageously improve coding efficiency and coding quality.

[0005] In a second aspect, an apparatus for video processing is proposed. The apparatus comprises a processor and a non -transitory memory with instructions thereon. The instructions upon execution by the processor, cause the processor to perform a method in accordance with the first aspect of the present disclosure.

[0006] In a third aspect, a non-transitory computer-readable storage medium is proposed. The non- transitory computer-readable storage medium stores instructions that cause a processor to perform a method in accordance with the first aspect of the present disclosure.

[0007] In a fourth aspect, another non-transitory computer-readable recording medium is proposed. The non-transitory computer-readable recording medium stores a bitstream of a video which is generated by a method performed by an apparatus for video processing. The method comprises: determining at least one binarized bin of a syntax element (SE) associated with a block of the video based on at least one of a context or a plurality of factors; and generating the bitstream based on the at least one binarized bin of the SE.

[0008] In a fifth aspect, a method for storing a bitstream of a video is proposed. The method comprises: determining at least one binarized bin of a syntax element (SE) associated with a block of the video based on at least one of a context or a plurality of factors; generating the bitstream based on the at least one binarized bin of the SE; and storing the bitstream in a non-transitory computer-readable recording medium.1 F1255801PCT

[0009] 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

[0010] Through the following detailed description with reference to the accompanying drawings, the above and other objectives, features, and advantages of example embodiments of the present disclosure will become more apparent. In the example embodiments of the present disclosure, the same reference numerals usually refer to the same components.

[0011] Fig. 1 illustrates a block diagram of an example video coding system in accordance with some embodiments of the present disclosure;

[0012] Fig. 2 illustrates a block diagram of an example video encoder in accordance with some embodiments of the present disclosure;

[0013] Fig. 3 illustrates a block diagram of an example video decoder in accordance with some embodiments of the present disclosure;

[0014] Fig. 4 illustrates positions of spatial and temporal neighboring blocks used in AMVP / merge candidate list construction;

[0015] Fig. 5 illustrates positions of non-adjacent candidate in ECM;

[0016] Fig. 6A and Fig. 6B illustrate a control point based affine motion model, respectively;

[0017] Fig. 7 illustrates the affine MVF per subblock;

[0018] Fig. 8 illustrates locations of inherited affine motion predictors;

[0019] Fig. 9 illustrates the control point motion vector inheritance;

[0020] Fig. 10 illustrates locations of candidates position for constructed affine merge mode;

[0021] Fig. 11A and Fig. 11B illustrate spatial neighbors for deriving affine merge candidates, respectively;

[0022] Fig. 12 illustrates from non-adjacent neighbors to constructed affine merge candidates;

[0023] Fig. 13 illustrates an example of generating an HAPC;

[0024] Fig. 14 illustrates an illustration of regression based affine merge candidate derivation;

[0025] Fig. 15 illustrates the template matching performing on a search area around initial MV;

[0026] Fig. 16 illustrates a template and the corresponding reference template;

[0027] Fig. 17 illustrates a template and the reference template for block with sub-block motion using the motion information of the subblocks of current block;

[0028] Fig. 18 illustrates the derivation process of the sub-block level motion field for SbTMVP;

[0029] Fig. 19 illustrates examples of the GPM splits grouped by identical angles;

[0030] Fig. 20 illustrates a uni-prediction MV selection for geometric partitioning mode;

[0031] Fig. 21 illustrates the exemplified generation of a bending weight w0using geometric partitioning mode;

[0032] Fig. 22 illustrates the ramp function for the weights for GPM blending based on the displacement (d) from a predicted sample position to the GPM partitioning boundary and the blending area size (r) ;2 F1255801PCT

[0033] Fig. 23A to Fig. 23D illustrate the GPM with inter and intra prediction, respectively;

[0034] Fig. 24 illustrates the edge on templates;

[0035] Fig. 25 illustrates possible neighbouring block positions;

[0036] Fig. 26 illustrates a flowchart of a method for video processing in accordance with some embodiments of the present disclosure;

[0037] Fig. l ' l illustrates a block diagram of a computing device in which various embodiments of the present disclosure can be implemented.

[0038] Throughout the drawings, the same or similar reference numerals usually refer to the same or similar elements.DETAILED DESCRIPTION

[0039] Principle of the present disclosure will now be described with reference to some embodiments. It is to be understood that these embodiments are described only for the purpose of illustration and help those skilled in the art to understand and implement the present disclosure, without suggesting any limitation as to the scope of the disclosure. The disclosure described herein can be implemented in various manners other than the ones described below.

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

[0041] References in the present disclosure to “one embodiment,” “an embodiment,” “an example embodiment,” and the like indicate that the embodiment described may include a particular feature, structure, or characteristic, but it is not necessary that every embodiment includes the particular feature, structure, or characteristic. Moreover, such phrases are not necessarily referring to the same embodiment. Further, when a particular feature, structure, or characteristic is described in connection with an example embodiment, it is submitted that it is within the knowledge of one skilled in the art to affect such feature, structure, or characteristic in connection with other embodiments whether or not explicitly described.

[0042] It shall be understood that although the terms “first” and “second” etc. may be used herein to describe various elements, these elements should not be limited by these terms. These terms are only used to distinguish one element from another. For example, a first element could be termed a second element, and similarly, a second element could be termed a first element, without departing from the scope of example embodiments. As used herein, the term “and / or” includes any and all combinations of one or more of the listed terms.

[0043] The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of example embodiments. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises”, “comprising”, “has”, “having”, “includes” and / or “including”, when used herein, specify the presence of stated features, elements, and / or components etc., but do not preclude the presence or addition of one or more other features, elements, components and / or combinations thereof.Example Environment3 F1255801PCT

[0044] Fig. 1 is a block diagram that illustrates an example video coding system 100 that may utilize the techniques of this disclosure. As shown, the video coding system 100 may include a source device 110 and a destination device 120. The source device 110 can be also referred to as a video encoding device, and the destination device 120 can be also referred to as a video decoding device. In operation, the source device 110 can be configured to generate encoded video data and the destination device 120 can 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.

[0045] The video source 112 may include a source such as a video capture device. Examples of the video capture device include, but are not limited to, an interface to receive video data from a video content provider, a computer graphics system for generating video data, and / or a combination thereof.

[0046] The video data may comprise 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 sequence of bits that form a coded representation of the video data. The bitstream may include coded pictures and associated data. The coded picture is a coded representation of a picture. The associated data may include sequence parameter sets, picture parameter sets, and other syntax structures. The I / O interface 116 may include a modulator / demodulator and / or a transmitter. The encoded video data may be transmitted directly to destination device 120 via the I / O interface 116 through the network 130A. The encoded video data may also be stored onto a storage medium / server 130B for access by destination device 120.

[0047] 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 acquire 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 a user. The display device 122 may be integrated with the destination device 120, or may be external to the destination device 120 which is configured to interface with an external display device.

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

[0049] Fig. 2 is a block diagram illustrating an example of a video encoder 200, which may be an example of the video encoder 114 in the system 100 illustrated in Fig. 1, in accordance with some embodiments of the present disclosure.

[0050] The video encoder 200 may be configured to implement any or all of the techniques of this disclosure. In the example of Fig. 2, the video encoder 200 includes a plurality of functional components. The techniques described in this disclosure may be shared among the various components of the video encoder 200. In some examples, a processor may be configured to perform any or all of the techniques described in this disclosure.

[0051] In some embodiments, the video encoder 200 may include a partition unit 201, a prediction unit 202 which may include a mode select unit 203, a motion estimation unit 204, a motion compensation unit 205 and an intra-prediction unit 206, a residual generation unit 207, a transform unit 208, a quantization unit 209, an inverse quantization unit 210, an inverse transform unit 211, a reconstruction unit 212, a4 F1255801PCTbuffer 213, and an entropy encoding unit 214.

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

[0053] Furthermore, although some components, such as the motion estimation unit 204 and the motion compensation unit 205, may be integrated, but are represented in the example of Fig. 2 separately for purposes of explanation.

[0054] The partition 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.

[0055] The mode select unit 203 may select one of the coding modes, intra or inter, e.g., based on error results, and provide the resulting intra-coded or inter-coded block to a residual generation unit 207 to generate residual block data and to a reconstruction unit 212 to reconstruct the encoded block for use as a reference picture. In some examples, the mode select unit 203 may select a combined inter and intra prediction (CIIP) mode in which the prediction is based on an inter prediction signal and an intra prediction signal. The mode select unit 203 may also select a resolution for a motion vector (e.g., a sub- pixel or integer pixel precision) for the block in the case of inter -prediction.

[0056] To perform inter prediction on a current video block, the motion estimation unit 204 may generate motion information for the current video block by comparing one or more reference frames from buffer 213 to the current video block. 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.

[0057] The motion estimation unit 204 and the motion compensation unit 205 may perform different operations for a 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 composed of macroblocks, all of which are based upon macroblocks within the same picture. Further, as used herein, in some aspects, “P-slices” and “B-slices” may refer to portions of a picture composed of macroblocks that are not dependent on macroblocks in the same picture.

[0058] In some examples, the motion estimation unit 204 may perform uni -directional prediction for the current video block, and the motion estimation unit 204 may search reference pictures of list 0 or list 1 for a reference video block for the current video block. The motion estimation unit 204 may then generate a reference index that indicates the reference picture in list 0 or list 1 that contains the reference video block and a motion vector that indicates a spatial displacement between the current video block and the reference video block. The motion estimation unit 204 may output the reference index, a prediction direction indicator, and the motion vector as the motion information of the current video block. The motion compensation unit 205 may generate the predicted video block of the current video block based on the reference video block indicated by the motion information of the current video block.

[0059] Alternatively, in other examples, the motion estimation unit 204 may perform bi-directional prediction for the current video block. The motion estimation unit 204 may search the reference pictures5 F1255801PCTin 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 reference indexes that indicate the reference pictures in list 0 and list 1 containing the reference video blocks and motion vectors that indicate spatial displacements between the reference video blocks and the current video block. The motion estimation unit 204 may output the reference indexes and the motion vectors of the current video block as the motion information of the current video block. The motion compensation unit 205 may generate the predicted video block of the current video block based on the reference video blocks indicated by the motion information of the current video block.

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

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

[0062] In another example, the motion estimation unit 204 may identify, in a syntax structure associated with the current video block, another video block and a motion vector difference (MVD). The motion vector difference indicates a 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.

[0063] As discussed above, video encoder 200 may predictively signal the motion vector. Two examples of predictive signaling techniques that may be implemented by video encoder 200 include advanced motion vector prediction (AMVP) and merge mode signaling.

[0064] 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 predicted video block and various syntax elements.

[0065] The residual generation unit 207 may generate residual data for the current video block by subtracting (e.g., indicated by the minus sign) the predicted 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 that correspond to different sample components of the samples in the current video block.

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

[0067] The transform unit 208 may generate one or more transform coefficient video blocks for the current video block by applying one or more transforms to a residual video block associated with the current6 F1255801PCTvideo block.

[0068] After the transform unit 208 generates a transform coefficient video block associated with the current video block, the 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.

[0069] The inverse quantization unit 210 and the inverse transform unit 211 may apply inverse quantization and inverse transforms 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 predicted video blocks generated by the prediction unit 202 to produce a reconstructed video block associated with the current video block for storage in the buffer 213.

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

[0071] The entropy encoding unit 214 may receive data from other functional components of the video encoder 200. When the entropy encoding unit 214 receives the data, the entropy encoding unit 214 may perform one or more entropy encoding operations to generate entropy encoded data and output a bitstream that includes the entropy encoded data.

[0072] Fig. 3 is a block diagram illustrating an example of a video decoder 300, which may be an example of the video decoder 124 in the system 100 illustrated in Fig. 1, in accordance with some embodiments of the present disclosure.

[0073] The video decoder 300 may be configured to perform any or all of the techniques of this disclosure. In the example of Fig. 3, the video decoder 300 includes a plurality of functional components. The techniques described in this disclosure may be shared among the various components of the video decoder 300. In some examples, a processor may be configured to perform any or all of the techniques described in this disclosure.

[0074] In the example of Fig. 3, 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, a reconstruction unit 306 and a buffer 307. The video decoder 300 may, in some examples, perform a decoding pass generally reciprocal to the encoding pass described with respect to video encoder 200.

[0075] The entropy decoding unit 301 may retrieve an encoded bitstream. The encoded bitstream may include entropy coded video data (e.g., encoded blocks of video data). The entropy decoding unit 301 may decode the entropy coded video data, and from the entropy decoded video data, the motion compensation unit 302 may determine motion information including motion vectors, motion vector precision, reference picture list indexes, and other motion information. The motion compensation unit 302 may, for example, determine such information by performing the AMVP and merge mode. AMVP is used, including derivation of several most probable candidates based on data from adjacent PBs and the reference picture. Motion information typically includes the horizontal and vertical motion vector displacement values, one or two reference picture indices, and, in the case of prediction regions in B7 F1255801PCTslices, an identification of which reference picture list is associated with each index. As used herein, in some aspects, a “merge mode” may refer to deriving the motion information from spatially or temporally neighboring blocks.

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

[0077] The motion compensation unit 302 may use the interpolation filters as used by the video encoder 200 during encoding of the video block to calculate interpolated values for sub -integer pixels of a reference block. The motion compensation unit 302 may determine the interpolation filters used by the video encoder 200 according to the received syntax information and use the interpolation filters to produce predictive blocks.

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

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

[0080] The reconstruction unit 306 may obtain the decoded blocks, e.g., by summing the residual blocks with the corresponding prediction blocks generated by the motion compensation unit 302 or intra - prediction unit 303. If desired, a deblocking filter may also be applied to filter the decoded blocks in order to remove blockiness artifacts. The decoded video blocks are then stored in the buffer 307, which provides reference blocks for subsequent motion compensation / intra prediction and also produces decoded video for presentation on a display device.

[0081] Some example embodiments of the present disclosure will be described in detailed hereinafter. It should be understood that section headings are used in the present document to facilitate ease of understanding and do not limit the embodiments disclosed in a section to only that section. Furthermore, while certain embodiments are described with reference to Versatile Video Coding or other specific video codecs, the disclosed techniques are applicable to other video coding technologies also. Furthermore, while some embodiments describe video coding steps in detail, it will be understood that corresponding steps decoding that undo the coding will be implemented by a decoder. Furthermore, the term video processing encompasses video coding or compression, video decoding or decompression and video transcoding in which video pixels are represented from one compressed format into another compressed format or at a different compressed bitrate.8 F1255801PCT1 Brief Summary

[0082] The present disclosure is related to video coding technologies. Specifically, it is about entropy coding in video coding. The ideas may be applied individually or in various combination, to any video coding standard or non-standard video codec.2 Introduction

[0083] The exponential increasing of multimedia data poses a critical challenge for video coding. To satisfy the increasing demands for more efficient compression technology, ITU-T and ISO / IEC have developed a series of video coding standards in the past decades. In particular, the ITU-T produced H.261 and H.263, ISO / IEC produced MPEG-1 and MPEG-4 visual, and the two organizations jointly developed the H.262 / MPEG-2 Video, H.264 / MPEG-4 Advanced Video Coding (AVC), H.265 / HEVC and the latest VVC standards. Since H.262 / MPEG-2, hybrid video coding framework is employed wherein in intra / inter prediction plus transform coding are utilized.2.1 MVP in video coding

[0084] Inter prediction aims to remove the temporal redundancy between adjacent frames, which serves as an indispensable component in the hybrid video coding framework. Specifically, inter prediction makes use of the contents specified by motion vector (MV) as the predicted version of the current to-be- coded block, thus only residual signals and motion information are transmitted in the bitstream. To reduce the cost for MV signaling, motion vector prediction (MVP) came into being as an effective mechanism to convey motion information. Early strategies simply use the MV of a specified neighboring block or the median MV of neighboring blocks as MVP. In H.265 / HEVC competing mechanism was involved where the optimal MVP is selected from multiple candidates through rate distortion optimization (RDO). In particular, advanced MVP (AMVP) mode and merge mode are devised with different motion information signaling strategy. With the AMVP mode, a reference index, a MVP candidate index referring to an AMVP candidate list and motion vector difference (MVD) is signaled. Regarding the merge mode, only a merge index referring to a merge candidate list is signaled, and all the motion information associated with the merge candidate is inherited. Both AMVP mode and merge mode need to construct MVP candidate list, and the details of the construction process for these two modes are described as follows.[OOSSJAAfEP mode: AMVP exploits spatial-temporal correlation of motion vector with neighboring blocks, which is used for explicit transmission of motion parameters. For each reference picture list, a motion vector candidate list is constructed by firstly checking availability of left, above temporally neighboring positions, removing redundant candidates and adding zero vector to make the candidate list to be constant length. For spatial motion vector candidate derivation, two motion vector candidates are eventually derived based on motion vectors of blocks located in five different positions as depicted in Fig. 4. Fig. 4 illustrates positions of spatial and temporal neighboring blocks used in AMVP / merge candidate list construction. The five neighboring blocks located at BO, Bl, B2, and AO, Al are classified into two groups, where Group A includes the three above spatial neighboring blocks and Group B includes the two left spatial neighboring blocks. The two MV candidates are respectively derived with9 F1255801PCTthe first available candidate from Group A and Group B in a predefined order. For temporal motion vector candidate derivation, one motion vector candidate is derived based on two different collocated positions (bottom-right (CO) and central (Cl)) checked in order, as depicted in Fig. 4. To avoid redundant MV candidates, duplicated motion vector candidates in the list are abandoned. If the number of potential candidates is smaller than two, additional zero motion vector candidates are added to the list.

[0086] Afer e mode. Similar to AMVP mode, MVP candidate list for merge mode comprises of spatial and temporal candidates as well. For spatial motion vector candidate derivation, at most four candidates are selected with order Al , Bl , BO, AO and B2 after performing availability and redundant checking. For temporal merge candidate (TMVP) derivation, at most one candidate is selected from two temporal neighboring blocks (CO and Cl). When there are not enough merge candidates with spatial and temporal candidates, combined bi-predictive merge candidates and zero MV candidates are added to MVP candidate list. Once the number of available merge candidates reaches the signaled maximally allowed number, the merge candidate list construction process is terminated.

[0087] In VVC, the construction process for merge mode is further improved by introducing the history - based MVP (HMVP), which incorporates the motion information of previously coded blocks which may be far away from current block. In VVC, HMVP merge candidates are appended to merge list after the spatial MVP and TMVP. In this method, the motion information of a previously coded block is stored in a table and used as MVP for the current CU. The table with multiple HMVP candidates is maintained with first-in-first-out strategy during the encoding / decoding process. Whenever there is a non -subblock inter-coded CU, the associated motion information is added to the last entry of the table as a new HMVP candidate.

[0088] During the standardization of VVC, Non-adjacent MVP was proposed to facilitate better motion information derivation by exploiting the non-adjacent area. In ECM software, Non-adjacent MVP are inserted between TMVP and HMVP, where the distances between non-adjacent spatial candidates and current coding block are based on the width and height of current coding block as depicted in Fig. 5. Fig. 5 illustrates positions of non-adjacent candidate in ECM.2.2 Affine motion compensated prediction

[0089] In HEVC, only translation motion model is applied for motion compensation prediction (MCP). While in the real world, there are many kinds of motion, e.g. zoom in / out, rotation, perspective motions and the other irregular motions. In WC, a block-based affine transform motion compensation prediction is applied. As shown in Fig. 6A and Fig. 6B, the affine motion field of the block is described by motion information of two control point (4-parameter) or three control point motion vectors (6-parameter).

[0090] For 4 -parameter affine motion model, motion vector at sample location (x, y) in a block is derived

[0091] For 6-parameter affine motion model, motion vector at sample location (x, y) in a block is derived10 F1255801PCTWhere (mvOx, mvOy) is motion vector of the top-left comer control point, (jnvlx, mvly) is motion vector of the top-right comer control point, and (mv2x, mv2y) is motion vector of the bottom-left comer control point.

[0092] In order to simplify the motion compensation prediction, block based affine transform prediction is applied. Fig. 7 illustrates the affine MVF per subblock. To derive motion vector of each 4x4 luma subblock, the motion vector of the center sample of each subblock, as shown in Fig. 7, is calculated according to above equations, and rounded to 1 / 16 fraction accuracy. Then the motion compensation interpolation filters are applied to generate the prediction of each subblock with derived motion vector. The subblock size of chroma-components is also set to be 4x4. The MV of a 4x4 chroma subblock is calculated as the average of the MVs of the top-left and bottom-right luma subblocks in the collocated 8x8 luma region.

[0093] As done for translational motion inter prediction, there are also two affine motion inter prediction modes: affine merge mode and affine AMVP mode.2.2.1 Affine merge prediction

[0094] Affine merge mode can be applied for CUs with both width and height larger than or equal to 8. In this mode the CPMVs of the current CU is generated based on the motion information of the spatial neighboring CUs. There can be up to five CPMVP candidates and an index is signalled to indicate the one to be used for the current CU. In VVC, the following three types of CPVM candidate are used to form the affine merge candidate list:- Inherited affine merge candidates that extrapolated from the CPMVs of the neighbour CUs- Constructed affine merge candidates CPMVPs that are derived using the translational MVs of the neighbour CUs- Zero MVs

[0095] In VVC, there are maximum two inherited affine candidates, which are derived from affine motion model of the neighboring blocks, one from left neighboring CUs and one from above neighboring CUs. Fig. 8 illustrates locations of inherited affine motion predictors. The candidate blocks are shown in Fig. 8. For the left predictor, the scan order is AO->A1, and for the above predictor, the scan order is BO->B1->B2. Only the first inherited candidate from each side is selected. No pruning check is performed between two inherited candidates. When a neighboring affine CU is identified, its control point motion vectors are used to derived the CPMVP candidate in the affine merge list of the current CU. Fig. 9 illustrates the control point motion vector inheritance. As shown in Fig. 9, if the neighbour left bottom block A is coded in affine mode, the motion vectors v2, v3and v4of the top left corner, above right comer and left bottom comer of the CU which contains the block A are attained. When block A is coded with 4-parameter affine model, the two CPMVs of the current CU are calculated according to v2, and v3. In case that block A is coded with 6-parameter affine model, the three CPMVs of the current CU are calculated according to v2, v3and v4.

[0096] Constructed affine candidate means the candidate is constructed by combining the neighbor translational motion information of each control point. Fig. 10 illustrates locations of candidates position11 F1255801PCTfor constructed affine merge mode. The motion information for the control points is derived from the specified spatial neighbors and temporal neighbor shown in Fig. 10. CPMVk (k=l, 2, 3, 4) represents the k-th control point. For CPMV1, the B2->B3->A2 blocks are checked and the MV of the first available block is used. For CPMV2, the Bl ->B0 blocks are checked and for CPMV3, the Al ->A0 blocks are checked. For TMVP is used as CPMV4 if it’s available.

[0097] After MVs of four control points are attained, affine merge candidates are constructed based on those motion information. The following combinations of control point MVs are used to construct in order:{CPMV1, CPMV2, CPMV3}, {CPMV1, CPMV2, CPMV4}, {CPMV1, CPMV3, CPMV4},{CPMV2, CPMV3, CPMV4}, { CPMV1, CPMV2}, { CPMV1, CPMV3}

[0098] The combination of 3 CPMVs constructs a 6 -parameter affine merge candidate and the combination of 2 CPMVs constructs a 4-parameter affine merge candidate. To avoid motion scaling process, if the reference indices of control points are different, the related combination of control point MVs is discarded.

[0099] After inherited affine merge candidates and constructed affine merge candidate are checked, if the list is still not full, zero MVs are inserted to the end of the list.2.2.2 Affine AMVP prediction[OlOOJAffine AMVP mode can be applied for CUs with both width and height larger than or equal to 16. An affine flag in CU level is signalled in the bitstream to indicate whether affine AMVP mode is used and then another flag is signalled to indicate whether 4-parameter affine or 6-parameter affine. In this mode, the difference of the CPMVs of current CU and their predictors CPMVPs is signalled in the bitstream. The affine AVMP candidate list size is 2 and it is generated by using the following four types of CPVM candidate in order:- Inherited affine AMVP candidates that extrapolated from the CPMVs of the neighbour CUs- Constructed affine AMVP candidates CPMVPs that are derived using the translational MVs of the neighbour CUs- Translational MVs from neighboring CUs- Zero MVs[OlOlJThe checking order of inherited affine AMVP candidates is same to the checking order of inherited affine merge candidates. The only difference is that, for AVMP candidate, only the affine CU that has the same reference picture as in current block is considered. No pruning process is applied when inserting an inherited affine motion predictor into the candidate list.

[0102] Constructed AMVP candidate is derived from the specified spatial neighbors shown in Fig. 10. The same checking order is used as done in affine merge candidate construction. In addition, reference picture index of the neighboring block is also checked. The first block in the checking order that is inter coded and has the same reference picture as in current CUs is used. There is only one When the current CU is coded with 4-parameter affine mode, and mvO and mvl are both available, they are added as one candidate in the affine AMVP list. When the current CU is coded with 6-parameter affine mode, and all three CPMVs are available, they are added as one candidate in the affine AMVP list. Otherwise,12 F1255801PCTconstructed AMVP candidate is set as unavailable.

[0103] If affine AMVP list candidates is still less than 2 after valid inherited affine AMVP candidates and constructed AMVP candidate are inserted, mvO, mvl and mv2 will be added, in order, as the translational MVs to predict all control point MVs of the current CU, when available. Finally, zero MVs are used to fill the affine AMVP list if it is still not full.2.2.3 New Affine candidates derivation methods in ECM-6.0

[0104] In ECM-6.0, 3 additional Affine merge and AMVP candidate derivation methods are integrated, which are Non-adjacent spatial candidates, History -parameter -based candidates and Regression based affine candidates.2.2.3.1 Non-adjacent spatial candidates

[0105] In ECM-6.0, non-adjacent spatial neighbors are investigated to provided candidates for both Affine merge and Affine AMVP. Fig. 11A and Fig. 11B illustrate spatial neighbors for deriving affine merge candidates, respectively. Fig. 11A illustrates spatial neighbors for deriving affine merge candidates for deriving inherited affine merge candidates. Fig. 11B illustrates spatial neighbors for deriving affine merge candidates for deriving constructed affine merge candidates . The pattern of obtaining non-adjacent spatial candidates is shown in Fig. 11A and Fig. 1 IB. Same as the non-adjacent regular merge candidates, the distances between non-adjacent spatial candidates and current coding block are also defined based on the width and height of current CU.

[0106] The motion information of the non-adjacent spatial neighbors in Fig. 11A and Fig. 11B is utilized to generate additional inherited and constructed affine merge candidates. Specifically, to generate inherited candidates, the non-adjacent spatial neighbors are checked based on their distances to the current block, i.e., from near to far. At a specific distance, only the first available neighbor which is coded with Affine mode from each side (e.g., the left and above) of the current block is included. As indicated in Fig. 11A, the checking of the neighbors on the left and above sides are performed from bottom-to-up and right-to-left, respectively. For constructed candidates, as shown in the Fig. 11B, the positions of one left and above non-adjacent spatial neighbors are firstly determined independently; After that, the location of the top -left neighbor can be determined accordingly to form a rectangular virtual block together with the left and above non-adjacent neighbors. Fig. 12 illustrates from non-adjacent neighbors to constructed affine merge candidates. The motion information of the three non-adjacent neighbors is used to form the CPMVs at the top-left (A), top-right (B) and bottom-left (C) of the virtual block, which is projected to the current CU to generate the corresponding constructed candidates, as shown in Fig. 12.2.2.3.2 History-parameter-based affine candidates

[0107] History-parameter-based affine model inheritance (HAMI) allows the affine model to be inherited from a previously affine-coded block which may not be neighboring to the current block. A historyparameter table (HPT) is established. An entry of HPT stores a set of affine parameters: a, b, c and d, each of which is represented by a 16-bit signed integer. Entries in HPT is categorized by reference list and reference index. Five reference indices are supported for each reference list in HPT. In a formular way, the category of HPT (denoted as HPTCat) is calculated as13 F1255801PCTHPTCat (RefList, Refldx) = 5 x RefList + min (Refldx, 4) (3) wherein RefList and Refldx represents a reference picture list (0 or 1) and a reference index, respectively. For each category, at most seven entries can be stored, resulting in 70 entries totally in HPT. At the beginning of each CTU row, the number of entries for each category is initialized as zero. After decoding an affine-coded CU with reference list RefListcur and Refldxcur, the affine parameters are utilized to update entries in the category HPTCat(RefListcur, Refldxcur) in a way similar to HMVP table updating.

[0108] Fig. 13 illustrates an example of generating an HAPC. A history-affine-parameter-based candidate (HAPC) is derived from a neighbouring 4x4 block denoted as AO, Al, BO, Bl or B2 in Fig. 13 and a set of affine parameters stored in a corresponding entry in HPT. The MV of a neighbouring 4x4 block served as the base MV. In a formulating way, the MV of the current block at position (x, y) is calculated as: mv" (x, y) = a x - x <base) + c y- ybase) + mvbhasemvv(x, y) = b(x - xbase) +d y- ybase) + mvbvase,(4)where (mvhbase, mvvbase) represents the MV of the neighbouring 4x4 block, (xbase, ybase) represents the center position of the neighbouring 4x4 block, (x, y) can be the top-left, top-right and bottom -left comer of the current block to obtain the comer-position MVs (CPMVs) for the current block, or it can be the center of the current block to obtain a regular MV for the current block.

[0109] Fig. 13 shows an example of how to derive an HAPC from block AO. The affine parameters {a0, bO, cO, d0} are directly fetched from one entry of category HPTIdx(RefListAO, refldxOAO) in HPT. The affine parameters from HPT, with the center position of AO as the base position, and the MV of block AO as the base MV, are used together to derive the CPMVs for an affine merge HAPC, or an affine AMVP HAPC. They can also be used to derive MVs located at the center of the current block, as regular merge candidates. A HAPC can be put into the sub-block-based merge candidate list, the affine AMVP candidate list or the regular merge candidate list. As a response to new HAPCs being introduced, the size of sub - block-based merge candidate list is increased from five to ten and twelve for random access and low- delay B configurations, respectively. Besides, the size of regular merge candidate list is increased from ten to eleven for random access configurations to accommodate the newly added regular merge candidates.2.2.3.3 Regression based affine candidate[OllOJIn ECM-6.0, the regression based affine merge candidates are derived and added to the affine merge list. Subblock motion field from a previously coded affine CU and motion information from adjacent subblocks of a current CU are used as the input to the regression process to derive proposed affine candidates.[OlllJThe previously coded affine CU can be identified from scanning through non -adjacent positions and the affine HMVP table. Fig. 14 illustrates an illustration of regression based affine merge candidate derivation. Adjacent subblock information of current CU is fetched from 4x4 sub -blocks represented by the grey zone as depicted in Fig. 14. For each sub-block, given a reference list, the corresponding motion vector and center coordinate of the sub -block may be used.

[0112] For each affine CU, up to 2 affine candidates can be derived. One with adjacent subblock information and one without. All the linear-regression-generated candidates are pruned and collected into one candidate sub-group, TM cost based ARMC process is applied when ARMC is enabled. Afterwards,14 F1255801PCTup to N linear-regression-generated candidates are added to the affine merge list when N affine CUs are found.2.3 Template matching merge / AMVP mode in ECM

[0113] Template matching (TM) merge / AMVP mode is a decoder-side MV derivation method to refine the motion information of the current CU by finding the closest match between a template (i.e., top and / or left neighboring blocks of the current CU) in the current picture and a block (i.e., same size to the template) in a reference picture. Fig. 15 illustrates the template matching performing on a search area around initial MV. As illustrated in Fig. 15, a better MV is to be searched around the initial motion of the current CU within a [- 8, +8] -pel search range.

[0114] In AMVP mode, an MVP candidate is determined based on the template matching error to pick up the one which reaches the minimum difference between the current block and the reference block templates, and then TM performs only for this particular MVP candidate for MV refinement. TM refines this MVP candidate, starting from full-pel MVD precision (or 4-pel for 4-pel AMVR mode) within a [- 8, +8] -pel search range by using iterative diamond search. The AMVP candidate may be further refined by using cross search with full-pel MVD precision (or 4-pel for 4-pel AMVR mode), followed sequentially by half-pel and quarter -pel ones depending on AMVR mode. This search process ensures that the MVP candidate still keeps the same MV precision as indicated by adaptive motion vector resolution (AMVR) mode after TM process.

[0115] In the merge mode, similar search method is applied to the merge candidate indicated by the merge index. TM merge may perform all the way down to 1 / 8 -pel MVD precision or skipping those beyond half-pel MVD precision, depending on whether the alternative interpolation filter (that is used when AMVR is of half-pel mode) is used according to merged motion information. Besides, when TM mode is enabled, template matching may work as an independent process or an extra MV refinement process between block-based and subblock-based bilateral matching (BM) methods, depending on whether BM can be enabled or not according to its enabling condition check. When BM and TM are both enabled for a CU, the search process of TM stops at half-pel MVD precision and the resulted MVs are further refined by using the same model-based MVD derivation method as in DMVR.2.4 Adaptive reorder of merge candidates (ARMC)

[0116] Inspired by the spatial correlation between reconstructed neighboring pixels and the current coding block, adaptive reorder of merge candidates (ARMC) was proposed to refine the candidates order in a given candidate list. The underlying assumption is that the candidates with less template matching cost have higher probability to be chosen through RDO process, hence should be placed in front positions within the list to reduce the signaling cost.

[0117] The reordering method is applied to regular merge mode, template matching (TM) merge mode, and affine merge mode (excluding the SbTMVP candidate). For the TM merge mode, merge candidates are reordered before the refinement process.

[0118] After a merge candidate list is constructed, merge candidates are divided into several subgroups. The subgroup size is set to 5. Merge candidates in each subgroup are reordered ascendingly according to cost values based on template matching. For simplification, merge candidates in the last but not the first15 F1255801PCTsubgroup are not reordered.

[0119] The template matching cost is measured by the sum of absolute differences (SAD) between samples of a template of the current block and their corresponding reference template. Fig. 16 illustrates a template and the corresponding reference template. The template comprises a set of reconstructed samples neighboring to the current block, while reference template is located by the same motion information of the current block, as illustrated in Fig. 16. When a merge candidate utilizes bi-directional prediction, the reference samples of the template of the merge candidate are also generated by bi- prediction.

[0120] For subblock-based merge candidates with subblock size equal to Wsub * Hsub, the above template comprises several sub-templates with the size of Wsub x K, and the left template comprises several sub-templates with the size of K * Hsub. Fig. 17 illustrates a template and the reference template for block with sub-block motion using the motion information of the subblocks of current block. As shown in Fig. 17, the motion information of the subblocks in the first row and the first column of current block is used to derive the reference samples of each sub-template.2.5 Subblock-based temporal motion vector prediction (SbTMVP)[0121JVVC supports the subblock -based temporal motion vector prediction (SbTMVP) method. Similar to the TMVP, SbTMVP takes advantage of the motion field in the collocated picture to facilitate more precise MVP derivation. The same collocated picture used by TMVP is used for SbTVMP. SbTMVP differs from TMVP mainly in two aspects. Firstly, SbTMVP enables sub-CU level.

[0122] motion prediction whereas TMVP predicts motion at CU level; Secondly, compared with TMVP that fetches the temporal MV from the collocated block in the collocated picture (the collocated block is the bottom-right or center block relative to the current CU), SbTMVP applies a motion shift before fetching the temporal motion information from the collocated picture, where the motion shift is obtained by re-using the MV from one of the spatial neighboring blocks of the current CU.

[0123] Fig. 18 illustrates the derivation process of the sub-block level motion field for SbTMVP. In particular, the motion information of left-bottom sub-block Al is firstly fetched, if either of the MVs in reference listO and listl points to the collocated frame, then the corresponding MV will be identified as motion shift. Otherwise, zero mv will be used as motion shift.

[0124] Once the motion shift is determined, the specified regions in the collocated frame is employed to derive sub-block level motion field. Assuming Al’ motion is used as motion shift as depicted in Fig. 18. Then for each sub-CU, the motion information of its corresponding block (the smallest motion grid that covers the center sample) in the collocated picture is fetched to provide motion information, where MV scale operation is firstly performed to align the reference frames of the temporal motion vectors to those of the current CU.

[0125] In VVC and ECM, in addition to CU level MVP candidate list, a sub-CU level MVP candidate list is also constructed to provide more precise motion prediction for the current CU, which comprises the motion fields produced by both SbTMVP and AFFINE methods. In particular, only one SbTMVP candidate is included and is always placed in the first entry of the constructed sub-CU level MVP candidate list, whereas multiple AFFINE candidates are included in the list after performing template16 F1255801PCTmatching-based reordering, where those with smaller costs are placed in fronter positions.2.6 Geometric partitioning mode (GPM)

[0126] In VVC, a geometric partitioning mode is supported for inter prediction. The geometric partitioning mode is signalled using a CU-level flag as one kind of merge mode, with other merge modes including the regular merge mode, the MMVD mode, the CIIP mode and the subblock merge mode . In total 64 partitions are supported by geometric partitioning mode for each possible CU size w x h = 2mx 2nwith m, n 6 {3 ••• 6} excluding 8x64 and 64x8.

[0127] Fig. 19 illustrates examples of the GPM splits grouped by identical angles. When this mode is used, a CU is split into two geometry partitions by a geometrically located straight line (Fig. 19). The location of the splitting line is mathematically derived from the angle and offset parameters of a specific partition. Each part of a geometric partition in the CU is inter-predicted using its own motion; only uniprediction is allowed for each partition, that is, each part has one motion vector and one reference index. The uni-prediction motion constraint is applied to ensure that same as the conventional bi -prediction, only two motion compensated prediction are needed for each CU.

[0128] If geometric partitioning mode is used for the current CU, then a geometric partition index indicating the partition mode of the geometric partition (angle and offset), and two merge indices (one for each partition) are further signalled. The number of maximum GPM candidate size is signalled explicitly in SPS and specifies syntax binarization for GPM merge indices. After predicting each of part of the geometric partition, the sample values along the geometric partition edge are adjusted using a blending processing with adaptive weights. This is the prediction signal for the whole CU, and transform and quantization process will be applied to the whole CU as in other prediction modes. Finally, the motion field of a CU predicted using the geometric partition modes is stored.2.6.1 Uni-prediction candidate list construction

[0129] Fig. 20 illustrates a uni-prediction MV selection for geometric partitioning mode. The uniprediction candidate list is derived directly from the merge candidate list constructed according to the extended merge prediction process. Denote n as the index of the uni -prediction motion in the geometric uni-prediction candidate list. The LX motion vector of the n-th extended merge candidate, with X equal to the parity of n, is used as the n-th uni-prediction motion vector for geometric partitioning mode. These motion vectors are marked with “x” in Fig. 20. In case a corresponding LX motion vector of the n-the extended merge candidate does not exist, the L(1 - X) motion vector of the same candidate is used instead as the uni-prediction motion vector for geometric partitioning mode.2.6.2 Blending along the geometric partitioning edge

[0130] After predicting each part of a geometric partition using its own motion, blending is applied to the two prediction signals to derive samples around geometric partition edge. The blending weight for each position of the CU are derived based on the distance between individual position and the partition edge.

[0131] The distance for a position (x,y) to the partition edge are derived as:17 F1255801PCTwhere i,j are the indices for angle and offset of a geometric partition, which depend on the signaled geometric partition index. The sign of pxand pyj depend on angle index i.

[0132] The weights for each part of a geometric partition are derived as following:

[0133] The partldx depends on the angle index i. One example of weigh w0is illustrated in Fig. 21. Fig.21 illustrates the exemplified generation of a bending weight w0using geometric partitioning mode.2.6.3 Geometric partitioning mode (GPM) with merge motion vector differences (MMVD)[0134JGPM in VVC is extended by applying motion vector refinement on top of the existing GPM unidirectional MVs. A flag is first signalled for a GPM CU, to specify whether this mode is used. If the mode is used, each geometric partition of a GPM CU can further decide whether to signal MVD or not. If MVD is signalled for a geometric partition, after a GPM merge candidate is selected, the motion of the partition is further refined by the signalled MVDs information. All other procedures are kept the same as in GPM.

[0135] The MVD is signaled as a pair of distance and direction, similar as in MMVD. There are nine candidate distances (! -pel, 'T-pel. 1-pel, 2-pel, 3 -pel, 4-pel, 6-pel, 8-pel, 16-pel), and eight candidate directions (four horizontal / vertical directions and four diagonal directions) involved in GPM with MMVD (GPM-MMVD). In addition, when pic fpel mmvd enabled flag is equal to 1, the MVD is left shifted by 2 as in MMVD.2.6.4 Geometric partitioning mode (GPM) with adaptive blending

[0136] In VVC, the final prediction samples are generated with by blending the prediction of the two prediction signals using weighted average. Two integer blending matrices ( To and i) are used. The weights in the GPM blending matrices are derived from the ramp function based on the displacement from a predicted sample position to the GPM partitioning boundary. The blending area size is fixed to two (2 samples on each side of the GPM partition split boundary).

[0137] Fig. 22 illustrates the ramp function for the weights for GPM blending based on the displacement (d) from a predicted sample position to the GPM partitioning boundary and the blending area size (T). The blending process in ECM is improved by adding four extra blending area sizes (quarter, half, double, and quadrupole of the existing area size) as shown in Fig. 22. A CU level flag is coded to signal the selected blending area size is signalled. Furthermore, the extended weighting precision is utilized, in which the maximum value of the weighs is changed from 8 (in VVC) to 32 to accommodate the extended blending area sizes.2.6.5 Geometric partitioning mode (GPM) with template matching (TM)

[0138] Template matching is applied to GPM. When GPM mode is enabled for a CU, a CU -level flag is18 F1255801PCTsignaled to indicate whether TM is applied to both geometric partitions. Motion information for each geometric partition is refined using TM. When TM is chosen, a template is constructed using left, above or left and above neighboring samples according to partition angle, as shown in Table 1. The motion is then refined by minimizing the difference between the current template and the template in the reference picture using the same search pattern of merge mode with half -pel interpolation filter disabled.Table 1. Template for the 1st and 2nd geometric partitions, where A represents using above samples, L represents using left samples, and L+A represents using both left and above samples.

[0139] A GPM candidate list is constructed as follows:1. Interleaved List-0 MV candidates and List- 1 MV candidates are derived directly from the regular merge candidate list, where List-0 MV candidates are higher priority than List-1 MV candidates. A pruning method with an adaptive threshold based on the current CU size is applied to remove redundant MV candidates.2. Interleaved List- 1 MV candidates and List-0 MV candidates are further derived directly from the regular merge candidate list, where List-1 MV candidates are higher priority than List-0 MV candidates. The same pruning method with the adaptive threshold is also applied to remove redundant MV candidates.3. Zero MV candidates are padded until the GPM candidate list is full.

[0140] The GPM-MMVD and GPM-TM are exclusively enabled to one GPM CU. This is done by firstly signaling the GPM-MMVD syntax. When both two GPM-MMVD control flags are equal to false (i.e., the GPM-MMVD are disabled for two GPM partitions), the GPM-TM flag is signaled to indicate whether the template matching is applied to the two GPM partitions. Otherwise (at least one GPM-MMVD flag is equal to true), the value of the GPM-TM flag is inferred to be false.2.6.6 GPM with inter and intra prediction

[0141] In GPM with inter and intra prediction, the final prediction samples are generated by weighting inter predicted samples and intra predicted samples for each GPM -separated region. The inter predicted samples are derived by inter GPM whereas the intra predicted samples are derived by an intra prediction mode (IPM) candidate list and an index signaled from the encoder. The IPM candidate list size is predefined as 3. Fig. 23 A to Fig. 23D illustrate the GPM with inter and intra prediction, respectively. The available IPM candidates are the parallel angular mode against the GPM block boundary (Parallel mode), the perpendicular angular mode against the GPM block boundary (Perpendicular mode), and the Planar mode as shown Fig. 23A to Fig. 23C, respectively. Furthermore, GPM with intra and intra prediction as shown Fig. 23D is restricted to reduce the signalling overhead for IPMs and avoid an increase in the size of the intra prediction circuit on the hardware decoder. In addition, a direct motion vector and IPM storage19 F1255801PCTon the GPM-blending area is introduced to further improve the coding performance.

[0142] In DIMD and neighboring mode based IPM derivation Parallel mode is registered first. Therefore, max two IPM candidates derived from the decoder-side intra mode derivation (DIMD) method and / or the neighboring blocks can be registered if there is not the same IPM candidate in the list. As for the neighboring mode derivation, there are five positions for available neighboring blocks at most, but they are restricted by the angle of GPM block boundary as shown in Table 2, which are already used for GPM with template matching (GPM-TM).Table 2. The position of available neighboring blocks for IPM candidate derivation based on the angle of GPM block boundary. A and L denotes the above and left side of the prediction block

[0143] GPM-intra can be combined with GPM with merge with motion vector difference (GPM-MMVD). TIMD is used for on IPM candidates of GPM-intra to further improve the coding performance. The Parallel mode can be registered first, then IPM candidates of TIMD, DIMD, and neighboring blocks.2.6.7 Template matching based reordering for GPM split modes

[0144] In template matching based reordering for GPM split modes, given the motion information of the current GPM block, the respective TM cost values of GPM split modes are computed. Then, all GPM split modes are reordered in ascending ordering based on the TM cost values. Instead of sending GPM split mode, an index using Golomb -Rice code to indicate where the exact GPM split mode located in the reordering list is signaled.

[0145] The reordering method for GPM split modes is a two-step process performed after the respective reference templates of the two GPM partitions in a coding unit are generated, as follows:• extending GPM partition edge into the reference templates of the two GPM partitions, resulting in 64 reference templates and computing the respective TM cost for each of the 64 reference templates;• reordering GPM split modes based on their TM cost values in ascending order and marking the best 32 split modes as available split modes.

[0146] Fig. 24 illustrates the edge on templates. The edge on the template is extended from that of the current CU, as Fig. 24 illustrates, but GPM blending process is not used in the template area across the edge.

[0147] After ascending reordering using TM cost, an index is signaled.2.6.8 Motion field storage for geometric partitioning mode

[0148] Mvl from the first part of the geometric partition, Mv2 from the second part of the geometric partition and a combined Mv of Mvl and Mv2 are stored in the motion filed of a geometric partitioning mode coded CU.20 F1255801PCT

[0149] The stored motion vector type for each individual position in the motion filed are determined as: sType = abs(motionldx) < 32 ? 2 : ( motionl dx < 0 ? ( 1 — partldx . partldx ) (2-43) where motionldx is equal to d(4x + 2, 4y + 2), which is recalculated from equation (2-36). The partldx depends on the angle index i.

[0150] If sType is equal to 0 or 1, MvO or Mvl are stored in the corresponding motion field, otherwise if sType is equal to 2, a combined Mv from MvO and Mv2 are stored. The combined Mv are generated using the following process:1) If Mvl and Mv2 are from different reference picture lists (one from LO and the other from LI), then Mvl and Mv2 are simply combined to form the bi-prediction motion vectors.2) Otherwise, if Mvl and Mv2 are from the same list, only uni-prediction motion Mv2 is stored.2.7 Multi-hypothesis prediction (MHP)

[0151] In the multi-hypothesis inter prediction mode, one or more additional motion -compensated prediction signals are signaled, in addition to the conventional bi -prediction signal. The resulting overall prediction signal is obtained by sample-wise weighted superposition. With the bi-prediction signal pbiand the first additional inter prediction signal / hypothesis h3, the resulting prediction signal p3is obtained as follows: p3= (1 - a)' phi+ ah3

[0152] The weighting factor a is specified by the new syntax element add_hyp_weight_idx, according to the following mapping:

[0153] Analogously to above, more than one additional prediction signal can be used. The resulting overall prediction signal is accumulated iteratively with each additional prediction signal.

[0154] The resulting overall prediction signal is obtained as the last pn(i.e., the pnhaving the largest index n). Within this EE, up to two additional prediction signals can be used (i.e., n is limited to 2).

[0155] The motion parameters of each additional prediction hypothesis can be signaled either explicitly by specifying the reference index, the motion vector predictor index, and the motion vector difference, or implicitly by specifying a merge index. A separate multi-hypothesis merge flag distinguishes between these two signalling modes.

[0156] For inter AMVP mode, MHP is only applied if non-equal weight in BCW is selected in biprediction mode.

[0157] Combination of MHP and BDOF is possible, however the BDOF is only applied to the bi- prediction signal part of the prediction signal (i.e., the ordinary first two hypotheses).2.8 Affine motion compensation in geometry prediction mode

[0158] It is proposed that sub-block -based motion compensation may be used in the GPM mode. a) In one example, the sub-block-based motion compensation may be affine motion compensation. b) In one example, the sub-block-based motion compensation may be sbTMVP motion compensation.21 F1255801PCTc) In one example, the prediction of at least one geometry partition may be generated with sub-blockbased motion compensation such as affine motion compensation. d) In one example, the final prediction may be generated by a weighted sum of two predictions, where at least one of them is generated with sub-block-based motion compensation such as affine motion compensation. i. In one example, the weighted sum is performed with the weighting values defined by GPM. e) In one example, the two predictions used in GPM mode may be type A and type B, wherein type A and type B may be (type A and type B may be the same type): i. Non-affine inter-prediction; ii. Affine inter-prediction; iii. Intra-prediction; iv. Intra block copy (IBC) prediction; v. sb-TMVP inter-prediction; vi. Any combined or generated prediction.AbbreviationsACT adaptive colour transformALF adaptive loop filterAMVR adaptive motion vector resolutionAPS adaptation parameter setAU access unitAUD access unit delimiterAVC advanced video coding (Rec. ITU-T H.264 | ISO / IEC 14496-10)B bi-predictiveBCW bi-prediction with CU-level weightsBDOF bi-directional optical flowBDPCM block-based delta pulse code modulationBP buffering periodCABAC context-based adaptive binary arithmetic codingCB coding blockCBR constant bit rateCCALF cross-component adaptive loop filterCPB coded picture bufferCRA clean random accessCRC cyclic redundancy checkCTB coding tree blockCTU coding tree unitCU coding unit22 F1255801PCTCVS coded video sequenceDPB decoded picture bufferDCI decoding capability informationDRAP dependent random access pointDU decoding unitDUI decoding unit informationEG exponential-GolombEGk k-th order exponential-GolombEOB end of bitstreamEOS end of sequenceFD filler dataFIFO first-in, first-outFL fixed-lengthGBR green, blue, and redGO general constraints informationGDR gradual decoding refreshGPM geometric partitioning modeHEVC high efficiency video coding (Rec. ITU-T H.265 | ISO / IEC 23008-2)HRD hypothetical reference decoderHSS hypothetical stream schedulerI intraIBC intra block copyIDR instantaneous decoding refreshILRP inter-layer reference pictureIRAP intra random access pointLFNST low frequency non-separable transformLIC Local Illumination CompensationLPS least probable symbolLSB least significant bitLTRP long-term reference pictureLMCS luma mapping with chroma scalingMIP matrix-based intra predictionMPS most probable symbolMSB most significant bitMTS multiple transform selectionMVP motion vector predictionNAL network abstraction layerOBMC overlapped block motion compensationOLS output layer set23 F1255801PCTOP operation pointOPI operating point informationP predictivePH picture headerPOC picture order countPPS picture parameter setPROF prediction refinement with optical flowPT picture timingPU picture unitQP quantization parameterRADL random access decodable leading (picture)RASL random access skipped leading (picture)RBSP raw byte sequence payloadRGB red, green, and blueRPL reference picture listSAO sample adaptive offsetSAR sample aspect ratioSEI supplemental enhancement informationSH slice headerSLI subpicture level informationSODB string of data bitsSPS sequence parameter setSTRP short-term reference pictureSTSA step-wise temporal sublayer accessTR truncated riceVBR variable bit rateVOL video coding layerVPS video parameter setVSEI versatile supplemental enhancement information (Rec. ITU-T H.274 | ISO / IEC 23002-7)VUI video usability informationWC versatile video coding (Rec. ITU-T H.266 | ISO / IEC 23090-3)SE syntax element3 Problems1) In VVC and ECM, a SE may be coded with limited contexts or even without a context, where the entropy coding may be inefficient.4 Detailed solutions

[0159] In this contribution, we disclose several methods of entropy coding.

[0160] The detailed embodiments below should be considered as examples to explain general concepts.24 F1255801PCTThese embodiments should not be interpreted in a narrow way. Furthermore, these embodiments can be combined in any manner.

[0161] The terms ‘video unit’ or ‘coding unit’ or ‘block’ may represent a coding tree block (CTB), a coding tree unit (CTU), a coding block (CB), a CU, a PU, a TU, a PB, a TB.

[0162] The terms ‘Affine block’ may represent a block coded with Affine merge, Affine AMVP or any other Affine variant mode (i.e., Affine MMVD etc), which may be described by motion information of two control point (4-parameter) or three control point motion vectors (6-parameter). The terms ‘CPMV’ may represent the motion information of a Affine block at top -left, top-right and / or bottom-left corners.

[0163] The term ‘template’ may represent a reconstructed region that can be used to refine the CPMV, which may represent either ‘separate template’ or ‘unified template’. Here a ‘separate template’ may represent a reconstructed region that can be used to refine individual CPMV, i.e., specific one(s) of top- left, top-right and / or bottom-left corners, while a ‘unified template’ may represent a reconstructed region that can be used to refine all or arbitrary CPMV(s) for a block. The term ‘template matching cost’ or ‘TM cost’ may represent either matching cost of a separate template or a unified template.

[0164] In the present disclosure, regarding “a block coded with mode N”, here “mode N” may be a prediction mode (e.g., MODE INTRA, MODE INTER, MODE PLT, MODE IBC, and etc.), or a coding technique (e.g., DIMD, TIMD, PDPC, CCLM, CCCM, GLM, intraTMP, AMVP, SMVD, Merge, BDOF, PROF, DMVR, AMVR, TM, Affine, CIIP, GPM, spatial GPM, SGPM, GPM inter-inter, GPM intra-intra, GPM inter-intra, MHP, GEO, TPM, MMVD, BCW, HMVP, SbTMVP, LIC, OBMC, ALF, deblocking, SAO, bilateral filter, LMCS, and the corresponding variants, and etc.).

[0165] It is noted that the terminologies mentioned below are not limited to the specific ones defined in existing standards. Any variance of the coding tool is also applicable.

[0166] In the following discussion, The SE may be binarized as a fixed length code, an EG(x) code, a unary code, a truncated unary code, a truncated binary code, etc. It may be signed or unsigned.

[0167] In the following discussion, the term “context” may refer to a context model used to code / parse a SE in arithmetic coding, such as in context adaptive binarized arithmetic coding (CABAC). Two different context models for one SE may be initialized with different values.1. It is proposed that at least one binarized bin of a SE may be coded with a context determined by color component and / or color format.2. It is proposed that at least one binarized bin of a SE may be coded with a context determined by the splitting tree structure, such as dual-tree or single-tree structure.3. As disclosed in bullet 1 and bullet 2, it is further proposed that at least one binarized bin of a SE may be coded with a first context for a luma component, and with a second context for a chroma component. a) In one example, the proposed method may be applied if dual-tree splitting structure is applied. i. In one example, the SE may indicate whether to and / or how to split a block.1) The SE may indicate whether a CU is split. E.g. split cu flag in WC.2) The SE may indicate whether a first split method, such as qual-tree (QT) split method is applied. E.g. split qt flag in WC.25 F1255801PCT3) The SE may indicate the type of the split mode, such as binary -tree (BT) or ternary -tree (BT). E.g. mtt split cu binary flag in WC.4) The SE may indicate the direction of the split, such as vertical or horizontal split. E.g. mtt split cu vertical flag in VVC. In one example, at least one binarized bin of a SE may be determined by multiple factors. a) For example, at least one factor may be the color component. i. For example, a first context index (denoted as M) may be derived for a SE used to indicate whether to and / or how to split a block.1) The first context index may be derived in a way without considering color format. ii. A second context index (denoted as C) may be derived from the first context index and the color format.1) For example, a first set of M contexts may be used for the luma component when dual tree is applied.2) For example, a second set of M contexts may be used for chroma components when dual tree is applied.3) For example, a third set of M contexts may be used when single tree structure is applied. a) Alternatively, the third set of M contexts may be used when dual tree structure is applied. It is proposed that at least one binarized bin of a SE may be coded with a context determined by at least one neighbouring block. a) In one example, f(NeiA) may be derived for a neighbouring block, denoted as NeiA, where f is a function. i. For example, f(NeiA) = FO when at least one condition (or several of them) below is (are) satisfied.1) NeiA is not available.2) NeiA is in a region inaccessible.3) NeiA is coded with a specific mode. a) NeiA is coded with palette mode. b) NeiA is coded with IBC mode. c) NeiA is coded with transform skip mode. d) NeiA is coded with inter mode. e) NeiA is coded with intra mode. f) NeiA is coded with BDPCM mode.4) NeiA is coded with coded bit flag (CBF) = 0.5) The width and / or height of NeiA is larger than or smaller than a threshold.6) The size of NeiA is larger than or smaller than a threshold. ii. For example, f(NeiA) = Fl if f(NeiA) is not equal to FO and NeiA satisfies at least one additional condition.26 F1255801PCTiii. For example, FO = 0 and Fl = 1. Alternatively, F0=l and Fl=0. b) In one example, at least two neighbouring blocks, denoted as NeiA and NeiB, may be used to derive the context. i. For example, the context index C may be derived as1) C=f(NeiA) + f(NeiB).ii. Alternatively, only one neighbouring block may be used to derive the context. iii. For example, the context index C may be derived as1) C=f(NeiA).2) C= f(NeiB). iv. For example, NeiA is a top neighbouring block and neiB is a neighbouring block. Fig. 25 illustrates possible neighbouring block positions.1) A position in NeiA may be above the current block, such as in AO, Al, A2, A3, A4, A5 as shown in Fig. 25.2) A position in NeiB may be left to the current block, such as in AO, Bl, B2, B3, B4, B5 as shown in Fig. 25. c) In one example, the neighbouring block may be color component dependent. i. For example, if dual-tree is applied and the current block is a luma block, a first set (the set may be empty) of neighbouring blocks may be used for the context; and a second set (the set may be empty) of the neighbouring blocks may be used for the context if the current block is a chroma block. d) In one example, the SE may be transform skip flag, which indicates whether transform skip is applied in a block. i. f(Nei) = Fl if f(Nei) is not equal to FO and Nei is coded with transform skip flag = 1, wherein Nei is a neighbouring block. e) In one example, the SE may be root cbf, which indicates whether there is at least one non-zero coefficient in at least one component. i. f(Nei) = Fl if f(Nei) is not equal to FO and Nei is coded with is at least one non-zero coefficient in at least one component. ii. f(Nei) = Fl if f(Nei) is not equal to FO and Nei is coded without any non-zero coefficient in any component. f) In one example, the SE may be cbf[component_id], which indicates whether there is at least one nonzero coefficient for a component with component id. i. f(Nei) = Fl if f(Nei) is not equal to FO and Nei is coded with is at least one non-zero coefficient in the component with component id. ii. f(Nei) = Fl if f(Nei) is not equal to FO and Nei is coded without any non-zero coefficient in the component with component id.27 F1255801PCTiii. In one example, the proposed context derivation method may be applied only for specific color component such as luma and Cb. iv. In one example, the proposed context derivation method may be applied only if specific mode is not used, such as ISP and BDPCM. g) In one example, the SE may be jeer flag, which indicates whether Joint Cb-Cr residue (JCCR) coding is applied. i. f(Nei) = Fl if f(Nei) is not equal to FO and Nei is coded with JCCR mode. ii. f(Nei) = Fl if f(Nei) is not equal to FO and Nei is coded without JCCR mode. iii. In one example, the context used to code jeer flag may depend on CBF1) For example, cbf mask = ebf eb * 2 + ebf er; and the context index C may be derived as C = cbf mask - 1.2) For example, C = cbf mask - 1+CO * 3, where CO may be derived as: a) C0=f(NeiA) + f(NeiB).h) In one example, the SE may be ccp flag, which indicates whether cross-component prediction such as CCLM and CCCM is applied. i. f(Nei) = Fl if f(Nei) is not equal to FO and Nei is coded with a CCP mode ii. f(Nei) = Fl if f(Nei) is not equal to FO and Nei is coded without a CCP mode. i) In one example, the SE may be non local ccp flag, which indicates whether non-local CCP mode (a.k.a. CCP merge) is applied. i. f(Nei) = Fl if f(Nei) is not equal to FO and Nei is coded with a CCP mode ii. f(Nei) = Fl if f(Nei) is not equal to FO and Nei is coded without a CCP mode. iii. f(Nei) = Fl if f(Nei) is not equal to FO and Nei is coded with a non-local CCP mode iv. f(Nei) = Fl if f(Nei) is not equal to FO and Nei is coded without a non-local CCP mode. j) In one example, the SE may be eip flag, which indicates whether extrapolation fdter-based intra prediction (EIP) is applied. k) In one example, the SE may be mpm flag, which indicates whether the most probable mode (MPM) is applied for intra-prediction. l) In one example, the SE may be isp mode, which indicates whether to and / or how to apply the ISP mode. m) In one example, the SE may be transform skip flag, which indicates whether transform skip is applied in a block. n) In one example, the SE may be root ebf, which indicates whether there is at least one non-zero coefficient in at least one component. o) In one example, the SE may be dd ccp flag, which indicates decoder derived CCP mode is applied. p) For example, The SE may be a SE denoted as cccm flag, which may indicate whether CCCM is applied or not. q) In one example, the SE may be dd ccp flag, which indicates decoder derived CCP mode is applied.28 F1255801PCTr) For example, The SE may be a SE denoted as mts flag, which may indicate whether multiple transform selection (MTS) is applied or not. It is proposed that at least one binarized bin of a SE may be coded with a context determined by the width and / or height of the current block. a) For example, a first context may be used if width > height; other context(s) may be used if width < height; and a third one may be used otherwise. b) For example, a first context may be used if width > T1 and height > T2; other context(s) may be used be used otherwise. For example, T1 = T2 = 8. c) For example, a first context may be used if width <= T1 and height <= T2; other context(s) may be used be used otherwise. For example, T1 = T2 = 8. d) For example, a first context may be used if width <= T1 or height <= T2; other context(s) may be used be used otherwise. For example, T1 = T2 = 8. e) For example, a first context may be used if width * height > T ; other context(s) may be used be used otherwise. For example, T = 64. f) For example, a first context may be used if width * height <= T ; other context(s) may be used be used otherwise. For example, T = 64. g) For example, a first context may be used if width > n* height; other context(s) may be used be used otherwise. For example, n = 2. h) For example, a first context may be used if width < n* height; other context(s) may be used be used otherwise. For example, n = 2. i) For example, a first context may be used if height > n* width; other context(s) may be used be used otherwise. For example, n = 2. j) For example, a first context may be used if height < n* width; other context(s) may be used be used otherwise. For example, n = 2. k) In one example, the SE may be isp mode, which indicates whether to and / or how to apply the ISP mode. i. For example, a first context may be used if width > height; a second context may be used if width < height; and a third one may be used otherwise. l) In one example, the SE may be mpm flag, which indicates whether the most probable mode (MPM) is applied for intra-prediction. m) In one example, the SE may be eip flag, which indicates whether extrapolation filter-based intra prediction (EIP) is applied. n) In one example, the SE may be ccp flag, which indicates whether cross-component prediction such as CCLM and CCCM is applied. o) In one example, the SE may be jeer flag, which indicates whether Joint Cb-Cr residue (JCCR) coding is applied. p) In one example, the SE may be cbf[component_id], which indicates whether there is at least one nonzero coefficient for a component with component id.29 F1255801PCTq) In one example, the SE may be transform skip flag, which indicates whether transform skip is applied in a block. r) In one example, the SE may be root cbf, which indicates whether there is at least one non-zero coefficient in at least one component. s) In one example, the SE may be dd ccp flag, which indicates decoder derived CCP mode is applied. t) For example, The SE may be a SE denoted as mts flag, which may indicate whether multiple transform selection (MTS) is applied or not. It is proposed that at least one binarized bin of a SE may be coded with a context determined by the bin index. a) For example, at least one bin, such as the first bin may be coded with a context. b) For example, each bin may be coded with a context. c) For example, two bins may be coded with two different contexts. d) For example, two bins may share the same context. e) For example, The SE may be a SE denoted as ccp type, which may indicate the type of CCP mode. For example, ccp type with values of 0. . .5 may represent CCP modes {CCP, MM-CCP, CCP-L, CCP- T, MM-CCP-L, MM-CCP-T}. CCP stands for cross component prediction including CCLM and CCCM. MM stands for multi-model. L and T stand for left and top respectively. i. For example, ccp type may be binarized as a truncated unary code. f) For example, The SE may be a SE denoted as chroma intra type, which may indicate the type of chroma intra-prediction mode. For example, chroma intra type with values of 0...3 may represent different chroma intra-prediction mode. i. For example, chroma intra type may be binarized as a truncated unary code. g) For example, The SE may be a SE denoted as hima intra type, which may indicate the type of luma intra-prediction mode. For example, hima intra type with values of 0...3 may represent different luma intra-prediction mode. i. hima intra type may indicate luma intra-prediction mode that cannot be represented by MPMs. ii. For example, hima intra type may be binarized as a truncated unary code. h) For example, The SE may be a SE denoted as sgpm idx, which may indicate the index of the spatial geometric partitioning mode (SGPM). For example, sgpm idx with values of 0...15 may represent different SGPM modes. i. For example, sgpm idx may be binarized as a truncated unary code. i) For example, The SE may be a SE denoted as cclm delta idx, which may indicate the index of the CCLM delta slope. For example, cclm delta idx with values of 0. . .3 may represent different CCLM delta slope. i. For example, cclm delta idx may be binarized as a truncated unary code. j) For example, The SE may be a SE denoted as non local ccp idx, which may indicate the index of the non-local CCP mode (a.k.a. CCP merge). For example, non local ccp idx with values of 0. . . 11 may represent different non local CCP candidates.30 F1255801PCTi. For example, non local ccp idx may be binarized as a truncated unary code. k) For example, The SE may be a SE denoted as dd ccp idx, which may indicate the index of the decoder derived CCP mode. For example, dd ccp idx with values of 0. . . 11 may represent different decoder derived CCP candidates. i. For example, dd ccp idx may be binarized as a truncated unary code. It is proposed that at least one binarized bin of a SE may be coded with a context determined by the coding mode. a) For example, The SE may be a SE denoted as cccm flag, which may indicate whether CCCM is applied or not. i. For example, the context may be determined by ccp type.1) For example, a first context may be used if CCP mode is used.2) For example, a second context may be used if MM-CCP mode is used.3) For example, a third context may be used if CCP-L or CCP-T or MM-CCP-L or MM-CCP- T mode is used. b) For example, The SE may be a SE denoted as mts flag, which may indicate whether multiple transform selection (MTS) is applied or not. i. For example, the context may be determined by whether a coding mode is applied.1) For example, a first context may be used if MIP or EIP mode is used; otherwise, a second context may be used.2) For example, the context may be determined by the sum of absolute values of coefficients. a) For example, M (such as 3) contexts may be selected according to the sum of absolute values of coefficients. b) For example, a first set of M contexts may be used if MIP or EIP mode is used; otherwise, a second set of M contexts may be used. Whether to and / or how to apply a proposed context derivation method may depend on coding information. a) E.g., a proposed context derivation method may only be applied to one or several specific color components such as luma and chroma. b) E.g., a proposed context derivation method may be applied only if a specific coding mode is used or not used. i. For example, it may be applied only if ISP is or is not used. ii. For example, it may be applied only if BDPCM is or is not used. iii. For example, it may be applied only if IBC is or is not used. iv. For example, it may be applied only if GPM is or is not used. v. For example, it may be applied only if SGPM is or is not used. vi. For example, it may be applied only if CCLM or CCCM is or is not used. vii. For example, it may be applied only if Affine is or is not used.31 F1255801PCTc) E.g., a proposed context derivation method may be applied only if the width and / or height of the current block satisfies one or some conditions.General aspects10. Additional operations may be applied to or with the proposed method. a) A syntax element disclosed above may be binarized as a flag, a fixed length code, an EG(x) code, a unary code, a truncated unary code, a truncated binary code, etc. It can be signed or unsigned. b) A syntax element representing a coding tool or a coding method may not be signalled and implicitly determined to be unused, if the coding tool or the coding method is regarded as not applicable or cannot be used. c) A syntax element disclosed above may be coded with at least one context model. Or it may be bypass coded. d) A syntax element disclosed above may be signaled in a conditional way. a. The SE is signaled only if the corresponding function is applicable. b. The SE is signaled only if the dimensions (width and / or height) of the block satisfy a condition. e) A syntax element disclosed above may be signaled at block level / sequence level / group of pictures level / picture level / slice level / tile group level, such as in coding structures of CTU / CU / TU / PU / CTB / CB / TB / PB, or sequence header / picture header / SPS / VPS / DPS / DCI / PPS / APS / slice header / tile group header. f) Whether to and / or how to apply the disclosed methods above may be signalled at block level / sequence level / group of pictures level / picture level / slice level / tile group level, such as in coding structures of CTU / CU / TU / PU / CTB / CB / TB / PB, or sequence header / picture header / SPS / VPS / DPS / DCI / PPS / APS / slice header / tile group header. g) Whether to and / or how to apply the disclosed methods above may be dependent on coded information, such as block size, colour format, single / dual tree partitioning, colour component, slice / picture type. h) The proposed methods disclosed in this document may be used in other coding tools which require chroma fusion.

[0168] Fig. 26 illustrates a flowchart of a method 2600 for video processing in accordance with embodiments of the present disclosure. The method 2600 is implemented during a conversion between a video unit of a video and a bitstream of the video.

[0169] At block 2610, for a conversion between a block of a video and a bitstream of the video, at least one binarized bin of a syntax element (SE) associated with the block is determined based on at least one of a context or a plurality of factors. In some embodiments, the context may include a context model for coding or parsing the SE in an arithmetic coding. As an example, the arithmetic coding may include a context adaptive binarized arithmetic coding (CABAC).

[0170] At block 2620, the conversion is performed based on the at least one binarized bin of the SE. In some embodiments, the conversion may include encoding the block into the bitstream. Alternatively, the conversion may include decoding the block from the bitstream.32 F1255801PCT

[0171] The method 2600 enables coding efficiency and coding quality to be advantageously improved.

[0172] In some embodiments, the at least one binarized bin of the SE may be coded with the context. The context may be determined by at least one of a color component or a color format. In some other embodiments, the at least one binarized bin of the SE may be coded with the context. In this case, the context may be determined by a splitting tree structure. For example, the splitting tree structure may include one of: a dual-tree structure or a single-tree structure.

[0173] In some embodiments, the at least one binarized bin of the SE may be coded with a first context for a luma component and with a second context for a chroma component. In some examples, if a dualtree splitting structure is applied, the at least one binarized bin of the SE may be coded with the first context and the second context.

[0174] In some embodiments, the SE may indicate whether to and / or how to split the block. In some embodiments, the SE may indicate whether a coding unit (CU) is split. For example, the SE may include split cu flag in VVC. In some embodiments, the SE may indicates whether a split approach is applied. For example, the split approach may include a qual-tree (QT) split approach. As an example, the SE may include split qt flag in VVC. In some other embodiments, the SE may indicate a type of a split mode. For example, the type of the split mode may include one of: a binary-tree (BT) or a ternary -tree (BT). As an example, the SE may include mtt split cu binary flag in VVC. In some further embodiments, the SE may indicate a direction of the split. For example, the direction of the split may include one of: a vertical split or a horizontal split. As an example, the SE may include mtt split cu vertical flag in VVC.

[0175] In some embodiments, the at least one binarized bin of the SE may be determined by the plurality of factors. In this case, at least one factor in the plurality of factors may include a color component. In some embodiments, a first context index (denoted as M) may be derived for the SE. The first context index may be used to indicate whether to and / or how to split the block. In some embodiments, the first context index may be derived independently of a color format. In other words, the first context index may be derived without considering the color format.

[0176] In some embodiments, a second context (denoted as C) index may be derived from a first context index and a color format. The first context index may be used to indicate whether to and / or how to split the block. In some embodiments, if a dual tree is applied, a first set of contexts may be used for a luma component. The first set of contexts may correspond to the first context index. In other words, a first set of M contexts may be used for the luma component when dual tree is applied.

[0177] In some other embodiments, if a dual tree is applied, a second set of contexts may be used for a chroma component. The second set of contexts corresponds to the first context index. In other words, a second set of M contexts may be used for chroma components when dual tree is applied. In some embodiments, if a single tree structure is applied, a third set of contexts may be used. The third set of contexts may correspond to the first context index. In other words, a third set of M contexts may be used when single tree structure is applied. Alternatively, if a dual tree structure is applied, the third set of contexts may be used. The third set of contexts may correspond to the first context index. In other words, a third set of M contexts may be used when dual tree structure is applied.

[0178] In some embodiments, the at least one binarized bin of the SE may be coded with the context. The33 F1255801PCTcontext may be determined by at least one neighbouring block. In some embodiments, a first neighbouring block may be used to determine the context. A first parameter may be derived for the first neighbouring block. For example, f(NeiA) may be derived for a neighbouring block, denoted as NeiA, where f may be a function.

[0179] In some embodiments, the first parameter may be equal to a first number if at least one of the following conditions is satisfied: the first neighbouring block is not available, the first neighbouring block is in a region inaccessible, the first neighbouring block is coded with a mode, the first neighbouring block is coded with a coded bit flag (CBF) equal to zero, a width and / or a height of the first neighbouring block is larger than or smaller than a threshold, or a size of the first neighbouring block is larger than or smaller than another threshold. In some embodiments, the mode may include one of: a palette mode, an intra block copy (IBC) mode, a transform skip mode, an inter mode, an intra mode, or a block -based delta pulse code modulation (BDPCM) mode. For example, f(NeiA) = FO when one or more above conditions is satisfied. As an example, the first number may be equal to zero.

[0180] In some embodiments, if the first parameter is not equal to the first number and the first neighbouring block satisfies at least one additional condition, the first parameter may be equal to a second number. For example, f(NeiA) = Fl if f(NeiA) is not equal to FO and NeiA satisfies the at least one additional condition. As an example, the first number may be equal to zero and the second number may be equal to one. Alternatively, the first number may be equal to zero and the second number may be equal to zero.

[0181] In some embodiments, a plurality of neighbouring blocks including a first neighbouring block and a second neighbouring block may be used to determine the context. In this case, a first parameter may be derived for the first neighbouring block and a second parameter may be derived for the second neighbouring block. For example, at least two neighbouring blocks, denoted as NeiA and NeiB, may be used to derive the context.

[0182] In some embodiments, a context index (denoted as C) corresponding to the context may be derived as one of: a sum of the first parameter and the second parameter, a logical disjunction of the first parameter and the second parameter, or a logical conjunction of the first parameter and the second parameter. For example, the context index C may be derived as: C=f(NeiA) + f(NeiB), C=f(NeiA) | f(NeiB), or C=f(NeiA) & f(NeiB). Alternatively, the context index corresponding to the context may be derived as the first parameter or the second parameter. For example, the context index C may be derived as: C=f(NeiA), or C=f(NeiB).

[0183] In some embodiments, the first neighbouring block and / or the second neighbouring block may be a top neighbouring block. For example, NeiA may be a top neighbouring block and NeiB may be a neighbouring block. In some embodiments, a position in the first neighbouring block may be above the block. As an example, a position in NeiA may be above the current block, such as in AO, Al, A2, A3, A4, A5 as shown in Fig. 25. In some other embodiments, a position in the second neighbouring block may be left to the block. As an example, a position in NeiB may be left to the current block, such as in AO, Bl, B2, B3, B4, B5 as shown in Fig. 25.

[0184] In some embodiments, the at least one neighbouring block may be dependent on a color component.34 F1255801PCTIn some example embodiments, if a dual -tree is applied and the block is a luma block, the context may be determined by a first set of neighbouring blocks. In this case, the number of blocks in the first set of neighbouring blocks may be greater than or equal to zero. For example, the first set may be empty. In some other example embodiments, if a dual-tree is applied and the block is a chroma block, the context may be determined by a second set of neighbouring blocks. In this case, the number of blocks in the second set of neighbouring blocks may be greater than or equal to zero. For example, the second set may be empty.

[0185] In some embodiments, the SE may include a flag indicating whether a transform skip is applied in the block. The flag may include transform skip flag. In some embodiments, if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded with the flag equal to 1, the parameter may be equal to a second number. For example, f(Nei) = Fl if f(Nei) is not equal to FO and Nei is coded with transform skip flag = 1.

[0186] In some embodiments, the SE may include an indication indicating whether there is at least one non-zero coefficient in at least one component. The indication may include root cbf. In some embodiments, if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded with the at least one non-zero coefficient in the at least one component, the parameter may be equal to a second number. For example, f(Nei) = Fl if f(Nei) is not equal to FO and Nei is coded with is at least one non-zero coefficient in at least one component. Alternatively, if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded without the at least one non-zero coefficient in the at least one component, the parameter may be equal to a second number. For example, f(Nei) = Fl if f(Nei) is not equal to FO and Nei is coded without any non-zero coefficient in any component.

[0187] In some embodiments, the SE may include an indication indicating whether there is at least one non-zero coefficient in a component with an identifier (such as component id). The indication may include cbf[component_id]. In some embodiments, if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded with the at least one non-zero coefficient in the component with the identifier, the parameter may be equal to a second number. For example, f(Nei) = Fl if f(Nei) is not equal to FO and Nei is coded with is at least one non-zero coefficient in the component with component id. Alternatively, if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded without the at least one non-zero coefficient in the component with the identifier, the parameter may be equal to a second number. For example, f(Nei) = Fl if f(Nei) is not equal to FO and Nei is coded without any non-zero coefficient in the component with component id.

[0188] In some embodiments, the context may be derived by the at least one neighbouring block for a color component. For example, the color component may include a luma component and / or a Cb component. In some other embodiments, the context may be derived by the at least one neighbouring block if a mode is not used. For example, the mode may include an intra sub-partition (ISP) mode and / or a block-based delta pulse code modulation (BDPCM).

[0189] In some embodiments, the SE may include a flag indicating whether a joint Cb-Cr residue (JCCR)35 F1255801PCTcoding mode is applied. The flag may include jccr flag. In some embodiments, if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded with the JCCR coding mode, the parameter may be equal to a second number. For example, f(Nei) = Fl if f(Nei) is not equal to FO and Nei is coded with JCCR mode. Alternatively, if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded without the JCCR coding mode, the parameter may be equal to a second number. For example, f(Nei) = Fl if f(Nei) is not equal to FO and Nei is coded without JCCR mode.

[0190] In some embodiments, the context used to code the flag indicating whether the JCCR coding mode is applied may depend on a coded bit flag (CBF). In some embodiments, a context index (denoted as C) corresponding to the context may be derived as a cbf mask corresponding to the CBF minus 1. The cbf mask is equal to: cbf cb * 2 + cbf cr. For example, C = cbf mask - 1, and cbf mask = cbf cb * 2 + cbf cr. Alternatively, a context index corresponding to the context may be equal to: cbf mask - 1+CO * 3. CO may be equal to one of: a sum of a first parameter derived for a first neighbouring block used to determine the context and a second parameter derived for a second neighbouring block used to determine the context, a logical disjunction of the first parameter and the second parameter, or a logical conjunction of the first parameter and the second parameter. For example, CO may be derived as: C0=f(NeiA) + f(NeiB), C0=f(NeiA) | f(NeiB), or C0=f(NeiA) & f(NeiB).

[0191] In some embodiments, the SE may include a flag indicating whether a cross -component prediction (CCP) mode is applied. The flag may include cep flag. For example, the CCP mode may include CCLM and / or CCCM. In some embodiments, if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded with the CCP mode, the parameter may be equal to a second number. For example, f(Nei) = Fl if f(Nei) is not equal to FO and Nei is coded with a CCP mode. Alternatively, if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded without the CCP mode, the parameter may be equal to a second number. For example, f(Nei) = Fl if f(Nei) is not equal to FO and Nei is coded without a CCP mode.

[0192] In some embodiments, the SE may include a flag indicating whether a non-local CCP mode (that is, CCP merge) is applied. The flag may include non local ccp flag. In some embodiments, if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded with a CCP mode, the parameter may be equal to a second number. For example, f(Nei) = Fl if f(Nei) is not equal to FO and Nei is coded with a CCP mode. Alternatively, if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded without a CCP mode, the parameter may be equal to a second number. For example, f(Nei) = Fl if f(Nei) is not equal to FO and Nei is coded without a CCP mode.

[0193] In some other embodiments, if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded with the non-local CCP mode, the parameter may be equal to a second number. For example, f(Nei) = Fl if f(Nei) is not equal to FO and Nei is coded with a non-local CCP mode. Alternatively, if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded without36 F1255801PCTthe non-local CCP mode, the parameter may be equal to a second number. For example, f(Nei) = Fl if f(Nei) is not equal to FO and Nei is coded without a non-local CCP mode.

[0194] In some embodiments, the SE may include a flag indicating whether an extrapolation filter-based intra prediction (EIP) is applied. The flag may include eip flag. In some other embodiments, the SE may include a flag indicating whether the most probable mode (MPM) is applied for an intra -prediction. The flag may include mpm flag. In some further embodiments, the SE may include an indication indicating whether to and / or how to apply an ISP mode. The indication may include isp mode.

[0195] In some embodiments, the SE may include a flag indicating whether transform skip is applied in the block. The flag may include transform skip flag. In some other embodiments, the SE may include an indication indicating whether there is at least one non-zero coefficient in at least one component. The indication may include root cbf. In some further embodiments, the SE may include a flag indicating whether decoder derived CCP mode is applied. The flag may include dd ccp flag.

[0196] In some embodiments, the SE may include a flag indicating whether a convolutional crosscomponent model (CCCM) is applied. The flag may include cccm flag. In some other embodiments, the SE may include a flag indicating whether a multiple transform selection (MTS) is applied. The flag may include mts flag.

[0197] In some embodiments, the at least one binarized bin of the SE may be coded with the context. In this case, the context may be determined by at least one of: a width of the block, or a height of the block. In some embodiments, a first context may be used if the width is greater than the height. In some other embodiments, a second context may be used if the width is less than the height. Alternatively, a third context may be used if the width is equal to the height. For example, a first context may be used if width > height; other context(s) may be used if width < height; and a third one may be used otherwise.

[0198] In some embodiments, a first context may be used if the width is greater than a first number and the height is greater than a second number. Alternatively, a second context may be used if the width is less than or equal to the first number or the height is less than or equal to the second number. As an example, a first context may be used if width > T1 and height > T2; other context(s) may be used be used otherwise. For example, T1 = T2 = 8.

[0199] In some embodiments, a first context may be used if the width is less than or equal to a first number and the height is less than or equal to a second number. Alternatively, a second context may be used if the width is greater than the first number or the height is greater than the second number. As an example, a first context may be used if width <= T1 and height <= T2; other context(s) may be used be used otherwise. For example, T1 = T2 = 8.

[0200] In some embodiments, a first context may be used if the width is less than or equal to a first number or the height is less than or equal to a second number. Alternatively, a second context may be used if the width is greater than the first number and the height is greater than the second number. As an example, a first context may be used if width <= T1 or height <= T2; other context(s) may be used otherwise. For example, T1 = T2 = 8.

[0201] In some embodiments, a first context may be used if the width multiplying the height is greater than a number. Alternatively, a second context may be used if the width multiplying the height is less37 F1255801PCTthan or equal to the number. As an example, a first context may be used if width * height > T; other context(s) may be used be used otherwise. For example, T = 64.

[0202] In some embodiments, a first context may be used if the width multiplying the height is less than or equal to a number. Alternatively, a second context may be used if the width multiplying the height is greater than the number. As an example, a first context may be used if width * height <= T ; other context(s) may be used be used otherwise. For example, T = 64.

[0203] In some embodiments, a first context may be used if the width is greater than the height multiplying a number. Alternatively, a second context may be used if the width is less than or equal to the height multiplying the number. As an example, a first context may be used if width > n* height; other context(s) may be used be used otherwise. For example, n = 2.

[0204] In some embodiments, a first context may be used if the width is less than the height multiplying a number. Alternatively, a second context may be used if the width is greater than or equal to the height multiplying the number. As an example, a first context may be used if width < n* height; other context(s) may be used be used otherwise. For example, n = 2.

[0205] In some embodiments, a first context may be used if the height is greater than the width multiplying a number. Alternatively, a second context may be used if the height is less than or equal to the width multiplying the number. As an example, a first context may be used if height > n* width; other context(s) may be used be used otherwise. For example, n = 2.

[0206] In some embodiments, a first context may be used if the height is less than the width multiplying a number. Alternatively, a second context may be used if the height is greater than or equal to the width multiplying the number. As an example, a first context may be used if height < n* width; other context(s) may be used be used otherwise. For example, n = 2.

[0207] In some embodiments, the SE may include an indication indicating whether to and / or how to apply an ISP mode. The indication may include isp mode. In some embodiments, a first context may be used if the width is greater than the height. In some other embodiments, a second context may be used if the width is less than the height. Alternatively, a third context may be used if the width is equal to the height. For example, a first context may be used if width > height; a second context may be used if width < height; and a third one may be used otherwise.

[0208] In some embodiments, the SE may include a flag indicating whether the most probable mode (MPM) is applied for an intra-prediction. The flag may include mpm flag. In some other embodiments, the SE may include a flag indicating whether an extrapolation filter-based intra prediction (EIP) is applied. The flag may include eip flag. In some further embodiments, the SE may include a flag indicating whether a cross-component prediction (CCP) mode is applied. The flag may include ccp flag. For example, the CCP mode may include CCLM and / or CCCM.

[0209] In some embodiments, the SE may include a flag indicating whether a joint Cb-Cr residue (JCCR) coding mode is applied. The flag may include jccr flag. In some other embodiments, the SE may include an indication indicating whether there is at least one non -zero coefficient in a component with an identifier (such as component id). The indication may include cbf[component_id]. In some further embodiments, the SE may include a flag indicating whether a transform skip is applied in the block. The38 F1255801PCTflag may include transform skip flag.

[0210] In some embodiments, the SE may include an indication indicating whether there is at least one non-zero coefficient in at least one component. The indication may include root cbf. In some other embodiments, the SE may include a flag indicating whether decoder derived CCP mode is applied. The flag may include dd ccp flag. In some further embodiments, the SE may include a flag indicating whether a multiple transform selection (MTS) is applied. The flag may include mts flag.

[0211] In some embodiments, the at least one binarized bin of the SE may be coded with the context. The context may be determined by a bin index. In some embodiments, at least one bin may be coded with the context. For example, the at least one bin may include the first bin. As an example, the first bin may be coded with a context.

[0212] In some embodiments, each bin may be coded with a corresponding context. In some other embodiments, two bins may be coded with two different contexts. Alternatively, two bins may be coded with a same context. In other words, wo bins may share the same context.

[0213] In some embodiments, the SE may include an indication indicating a type of a CCP mode. The indication may include ccp type. For example, ccp type with values of 0 to 5 may represent CCP modes of CCP, MM-CCP, CCP-L, CCP-T, MM-CCP-L, MM-CCP-T respectively. CCP represents a cross component prediction including CCLM and CCCM. MM represents a multi-model. L represents left and T represents top. As an example, the ccp type may be binarized as a truncated unary code.

[0214] In some embodiments, the SE may include an indication indicating a type of a chroma intraprediction mode. The indication may include chroma intra type. For example, chroma intra type with values of 0...3 may represent different chroma intra-prediction mode. As an example, chroma intra type may be binarized as a truncated unary code.

[0215] In some embodiments, the SE may include an indication indicating a type of a luma intraprediction mode. The indication may include luma intra type. For example, luma intra type with values of 0 to 3 may represent different luma intra-prediction mode. In some embodiments, the luma intra type may indicate the luma intra-prediction mode not included in a set of most probable modes (MPMs). In other words, luma intra type may indicate luma intra-prediction mode that cannot be represented by MPMs. In some other embodiments, the luma intra type may be binarized as a truncated unary code.

[0216] In some embodiments, the SE may include an indication indicating an index of a spatial geometric partitioning mode (SGPM). The indication may include sgpm idx. For example, sgpm idx with values of 0 to 15 may represent different SGPM modes. In some embodiments, the sgpm idx may be binarized as a truncated unary code.

[0217] In some embodiments, the SE may include an indication indicating an index of a cross -component linear model (CCLM) delta slope. The indication may include cclm delta idx. For example, cclm delta idx with values of 0 to 3 may represent different CCLM delta slopes. In some embodiments, the cclm delta idx may be binarized as a truncated unary code.

[0218] In some embodiments, the SE may include an indication indicating an index of a non-local CCP mode (that is, CCP merge). The indication may include non local ccp idx. For example, non local ccp idx with values of 0 to 11 may represent different non local CCP candidates. In some39 F1255801PCTembodiments, the non local ccp idx may be binarized as a truncated unary code.

[0219] In some embodiments, the SE may include an indication indicating an index of a decoder derived CCP mode. The indication may include dd ccp idx. For example, dd ccp idx with values of 0 to 11 may represent different decoder derived CCP candidates. In some embodiments, the dd ccp idx may be binarized as a truncated unary code.

[0220] In some embodiments, the at least one binarized bin of the SE may be coded with the context. The context may be determined by a coding mode. In some embodiments, the SE may include a flag indicating whether a convolutional cross -component model (CCCM) is applied. The flag may include cccm flag.

[0221] In some embodiments, the context may be determined by an indication indicating a type of a crosscomponent prediction (CCP) mode. The indication may include ccp type. In some embodiments, a first context may be used if a CCP mode is used. In some other embodiments, a second context may be used if a multi-model (MM)-CCP mode is used. In some further embodiments, a third context may be used if one of the following is used: a CCP-left mode, a CCP -top mode, a MM-CCP-left mode, or a MM-CCP- top mode.

[0222] In some embodiments, the SE may include a flag indicating whether a multiple transform selection (MTS) is applied. The flag may include mts flag. In some embodiments, the context may be determined by whether a coding mode is applied. In some embodiments, a first context may be used if a matrix-based intra prediction (MIP) mode or an extrapolation filter-based intra prediction (EIP) mode is used. Alternatively, a second context may be used if the MIP mode and the EIP mode is not used. For example, a first context may be used if MIP or EIP mode is used; otherwise a second context may be used.

[0223] In some embodiments, the context may be determined by a sum of absolute values of coefficients. In some embodiments, one or more contexts may be selected based on the sum of the absolute values of the coefficients. For example, M (such as 3) contexts may be selected according to the sum of absolute values of coefficients.

[0224] In some embodiments, a first set of contexts may be used if a MIP mode or an EIP mode is used. Alternatively, a second set of contexts may be used if the MIP mode and the EIP mode is not used. For example, a first set of M contexts may be used if MIP or EIP mode is used; otherwise a second set of M contexts may be used.

[0225] In some embodiments, whether to and / or how to apply a derivation of the context may depend on coding information. In some embodiments, the derivation of the context may be applied to one or more color components, such as luma and chroma. In some other embodiments, the derivation of the context may be applied if a target coding mode is used. Alternatively, the derivation of the context may be applied if the target coding mode is not used. In some embodiments, the target coding mode may include one of: an intra sub-partition (ISP) mode, a block -based delta pulse code modulation (BDPCM), an intra block copy (IBC) mode, a geometric partitioning mode (GPM), a spatial geometric partitioning mode (SGPM), a cross-component linear model (CCLM), a convolutional cross-component model (CCCM), or an affine mode.

[0226] In some embodiments, the derivation of the context may be applied only if ISP is or is not used. In some embodiments, the derivation of the context may be applied only if BDPCM is or is not used. In40 F1255801PCTsome embodiments, the derivation of the context may be applied only if IBC is or is not used. In some other embodiments, the derivation of the context may be applied only if GPM is or is not used. In some embodiments, the derivation of the context may be applied only if SGPM is or is not used. In some further embodiments, the derivation of the context may be applied only if CCLM or CCCM is or is not used. In some embodiments, the derivation of the context may be applied. In some embodiments, the derivation of the context may be applied only if affine is or is not used.

[0227] In some embodiments, the derivation of the context may be applied if a width of the block and / or a height of the block satisfies one or more conditions. For example, the context derivation may be applied only if the width and / or height of the current block satisfies one or some conditions.

[0228] In some embodiments, the SE may be binarized as one of: a flag, a fixed length code, an exponential-Golomb (EG(x)) code, a unary code, a truncated unary code, or a truncated binary code, or the like. In some embodiments, the binarized SE may be signed or unsigned.

[0229] In some embodiments, the SE representing a coding tool or a coding approach may be determined to be unused without being signalled, if the coding tool or the coding approach is not applicable or not capable of being used. For example, the SE representing a coding tool or a coding approach may not be signalled and implicitly determined to be unused, if the coding tool or the coding approach is regarded as not applicable or cannot be used.

[0230] In some embodiments, the SE may be coded with at least one context model. Alternatively, the SE may be bypass coded. In some embodiments, the SE may be signaled. For example, the SE may be signaled in a conditional way. In some embodiments, the SE may be signaled if a corresponding function is applicable. In some other embodiments, the SE may be signaled if a dimension of the block satisfies a condition. For example, the SE may be signaled if a width and / or a height of the block satisfies the condition.

[0231] In some embodiments, the SE may be signaled at one of the followings: a block level, a sequence level, a group of pictures level, a picture level, a slice level, or a tile group level. In some embodiments, the SE may be signaled in a coding structure of one of the followings: a coding tree unit (CTU), a coding unit (CU), a transform unit (TU), a prediction unit (PU), a coding tree block (CTB), a coding block (CB), a prediction block (PB), or a transform block (TB). In some other embodiments, the SE may be signaled in one of the followings: a sequence header, a picture header, a sequence parameter set (SPS), a video parameter set (VPS), a decoding parameter set (DPS), decoding capability information (DCI), a picture parameter set (PPS), an adaptation parameter set (APS), a slice header, or a tile group header.

[0232] In some embodiments, whether to and / or how to determine the least one binarized bin of the SE may be signaled at one of the following: a block level, a sequence level, a group of pictures level, a picture level, a slice level, or a tile group level. In some embodiments, whether to and / or how to determine the least one binarized bin of the SE may be signaled in one of the following: a coding tree unit (CTU), a coding unit (CU), a transform unit (TU), a prediction unit (PU), a coding tree block (CTB), a coding block (CB), a prediction block (PB), or a transform block (TB). In some other embodiments, whether to and / or how to determine the least one binarized bin of the SE may be signaled in one of the followings: a sequence header, a picture header, a sequence parameter set (SPS), a video parameter set (VPS), a41 F1255801PCTdecoding parameter set (DPS), decoding capability information (DCI), a picture parameter set (PPS), an adaptation parameter set (APS), a slice header, or a tile group header.

[0233] In some embodiments, the method 2600 may further include: determining, based on coded information of the block of the video, whether to and / or how to determine the least one binarized bin of the SE. The coded information may include at least one of: a block size, a colour format, a single and / or dual tree partitioning, a colour component, a slice type, or a picture type. In some other embodiments, the determination of the least one binarized bin of the SE may be applied in a coding tool which requires a chroma fusion.

[0234] According to further embodiments of the present disclosure, a non -transitory computer-readable recording medium is provided. The non -transitory computer-readable recording medium stores a bitstream of a video which is generated by a method performed by an apparatus for video processing. The method comprises: determining at least one binarized bin of a syntax element (SE) associated with a block of the video based on at least one of a context or a plurality of factors; and generating the bitstream based on the at least one binarized bin of the SE.

[0235] According to still further embodiments of the present disclosure, a method for storing bitstream of a video is provided. The method comprises: determining at least one binarized bin of a syntax element (SE) associated with a block of the video based on at least one of a context or a plurality of factors; generating the bitstream based on the at least one binarized bin of the SE; and storing the bitstream in a non-transitory computer-readable recording medium.

[0236] Implementations of the present disclosure can be described in view of the following clauses, the features of which can be combined in any reasonable manner.

[0237] Clause 1. A method for video processing, comprising: determining, for a conversion between a block of a video and a bitstream of the video, at least one binarized bin of a syntax element (SE) associated with the block based on at least one of a context or a plurality of factors; and performing the conversion based on the at least one binarized bin of the SE.

[0238] Clause 2. The method of clause 1, wherein the at least one binarized bin of the SE is coded with the context, wherein the context is determined by at least one of a color component or a color format.

[0239] Clause 3. The method of clause 1, wherein the at least one binarized bin of the SE is coded with the context, wherein the context is determined by a splitting tree structure.

[0240] Clause 4. The method of clause 3, wherein the splitting tree structure comprises one of: a dual- tree structure or a single-tree structure.

[0241] Clause 5. The method of any of clauses 1 to 4, wherein the at least one binarized bin of the SE is coded with a first context for a luma component and with a second context for a chroma component.

[0242] Clause 6. The method of clause 5, wherein if a dual -tree splitting structure is applied, the at least one binarized bin of the SE is coded with the first context and the second context.

[0243] Clause 7. The method of clause 5, wherein the SE indicates whether to and / or how to split the block.

[0244] Clause 8. The method of clause 7, wherein the SE indicates whether a coding unit (CU) is split.

[0245] Clause 9. The method of clause 7, wherein the SE indicates whether a split approach is applied.42 F1255801PCT

[0246] Clause 10. The method of clause 9, wherein the split approach comprises a qual-tree (QT) split approach.

[0247] Clause 11. The method of clause 7, wherein the SE indicates a type of a split mode.

[0248] Clause 12. The method of clause 11, wherein the type of the split mode comprises one of: a binarytree (BT) or a ternary -tree (BT).

[0249] Clause 13. The method of clause 7, wherein the SE indicates a direction of the split.

[0250] Clause 14. The method of clause 13, wherein the direction of the split comprises one of: a vertical split or a horizontal split.

[0251] Clause 15. The method of clause 1, wherein the at least one binarized bin of the SE is determined by the plurality of factors, wherein at least one factor in the plurality of factors comprises a color component.

[0252] Clause 16. The method of clause 15, wherein a first context index is derived for the SE, wherein the first context index is used to indicate whether to and / or how to split the block.

[0253] Clause 17. The method of clause 16, wherein the first context index is derived independently of a color format.

[0254] Clause 18. The method of clause 15, wherein a second context index is derived from a first context index and a color format, wherein the first context index is used to indicate whether to and / or how to split the block.

[0255] Clause 19. The method of clause 18, wherein if a dual tree is applied, a first set of contexts is used for a luma component, wherein the first set of contexts corresponds to the first context index.

[0256] Clause 20. The method of clause 18, wherein if a dual tree is applied, a second set of contexts is used for a chroma component, wherein the second set of contexts corresponds to the first context index.

[0257] Clause 21. The method of clause 18, wherein if a single tree structure is applied, a third set of contexts is used, wherein the third set of contexts corresponds to the first context index.

[0258] Clause 22. The method of clause 18, wherein if a dual tree structure is applied, a third set of contexts is used, wherein the third set of contexts corresponds to the first context index.

[0259] Clause 23. The method of clause 1, wherein the at least one binarized bin of the SE is coded with the context, wherein the context is determined by at least one neighbouring block.

[0260] Clause 24. The method of clause 23, wherein a first neighbouring block is used to determine the context, wherein a first parameter is derived for the first neighbouring block.

[0261] Clause 25. The method of clause 24, wherein the first parameter is equal to a first number if at least one of the following conditions is satisfied: the first neighbouring block is not available, the first neighbouring block is in a region inaccessible, the first neighbouring block is coded with a mode, the first neighbouring block is coded with a coded bit flag (CBF) equal to zero, a width and / or a height of the first neighbouring block is larger than or smaller than a threshold, or a size of the first neighbouring block is larger than or smaller than another threshold.

[0262] Clause 26. The method of clause 25, wherein the mode comprises one of: a palette mode, an intra block copy (IBC) mode, a transform skip mode, an inter mode, an intra mode, or a block -based delta pulse code modulation (BDPCM) mode.43 F1255801PCT

[0263] Clause 27. The method of clause 25 or 26, wherein the first number is equal to zero.

[0264] Clause 28. The method of clause 24, wherein if the first parameter is not equal to the first number and the first neighbouring block satisfies at least one additional condition, the first parameter is equal to a second number.

[0265] Clause 29. The method of clause 28, wherein the first number is equal to zero and the second number is equal to one, or wherein the first number is equal to zero and the second number is equal to zero.

[0266] Clause 30. The method of clause 23, wherein a plurality of neighbouring blocks including a first neighbouring block and a second neighbouring block are used to determine the context, wherein a first parameter is derived for the first neighbouring block and a second parameter is derived for the second neighbouring block.

[0267] Clause 31. The method of clause 30, wherein a context index corresponding to the context is derived as one of: a sum of the first parameter and the second parameter, a logical disjunction of the first parameter and the second parameter, or a logical conjunction of the first parameter and the second parameter.

[0268] Clause 32. The method of clause 30, wherein a context index corresponding to the context is derived as the first parameter or the second parameter.

[0269] Clause 33. The method of clause 30, wherein the first neighbouring block and / or the second neighbouring block is a top neighbouring block.

[0270] Clause 34. The method of clause 33, wherein a position in the first neighbouring block is above the block.

[0271] Clause 35. The method of clause 33, wherein a position in the second neighbouring block is above the block.

[0272] Clause 36. The method of clause 23, wherein the at least one neighbouring block is dependent on a color component.

[0273] Clause 37. The method of clause 36, wherein if a dual-tree is applied and the block is a luma block, the context is determined by a first set of neighbouring blocks, wherein the number of blocks in the first set of neighbouring blocks is greater than or equal to zero, or wherein if a dual -tree is applied and the block is a chroma block, the context is determined by a second set of neighbouring blocks, wherein the number of blocks in the second set of neighbouring blocks is greater than or equal to zero .

[0274] Clause 38. The method of clause 23, wherein the SE comprises a flag indicating whether a transform skip is applied in the block, wherein the flag comprises transform skip flag.

[0275] Clause 39. The method of clause 38, wherein if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded with the flag equal to 1, the parameter is equal to a second number.

[0276] Clause 40. The method of clause 23, wherein the SE comprises an indication indicating whether there is at least one non-zero coefficient in at least one component, wherein the indication comprises root cbf.

[0277] Clause 41. The method of clause 40, wherein if a parameter derived for a neighbouring block used44 F1255801PCTto determine the context is not equal to a first number and the neighbouring block is coded with the at least one non-zero coefficient in the at least one component, the parameter is equal to a second number.

[0278] Clause 42. The method of clause 40, wherein if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded without the at least one non-zero coefficient in the at least one component, the parameter is equal to a second number.

[0279] Clause 43. The method of clause 23, wherein the SE comprises an indication indicating whether there is at least one non-zero coefficient in a component with an identifier, wherein the indication comprises cbf[component_id].

[0280] Clause 44. The method of clause 43, wherein if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded with the at least one non-zero coefficient in the component with the identifier, the parameter is equal to a second number.

[0281] Clause 45. The method of clause 43, wherein if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded without the at least one non-zero coefficient in the component with the identifier, the parameter is equal to a second number.

[0282] Clause 46. The method of clause 43, wherein the context is derived by the at least one neighbouring block for a color component.

[0283] Clause 47. The method of clause 46, wherein the color component comprises a luma component and / or a Cb component.

[0284] Clause 48. The method of clause 43, wherein the context is derived by the at least one neighbouring block if a mode is not used.

[0285] Clause 49. The method of clause 48, wherein the mode comprises an intra sub-partition (ISP) mode and / or a block-based delta pulse code modulation (BDPCM).

[0286] Clause 50. The method of clause 23, wherein the SE comprises a flag indicating whether a joint Cb-Cr residue (JCCR) coding mode is applied, wherein the flag comprises jccr flag.

[0287] Clause 51. The method of clause 50, wherein if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded with the JCCR coding mode, the parameter is equal to a second number.

[0288] Clause 52. The method of clause 50, wherein if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded without the JCCR coding mode, the parameter is equal to a second number.

[0289] Clause 53. The method of clause 50, wherein the context used to code the flag indicating whether the JCCR coding mode is applied depends on a coded bit flag (CBF).

[0290] Clause 54. The method of clause 53, wherein a context index corresponding to the context is derived as a cbf mask corresponding to the CBF minus 1, wherein the cbf mask is equal to: cbf cb * 2 + cbf_cr.

[0291] Clause 55. The method of clause 53, wherein a context index corresponding to the context is equal to: cbf mask - 1+C0 * 3, wherein CO is equal to one of: a sum of a first parameter derived for a first45 F1255801PCTneighbouring block used to determine the context and a second parameter derived for a second neighbouring block used to determine the context, a logical disjunction of the first parameter and the second parameter, or a logical conjunction of the first parameter and the second parameter.

[0292] Clause 56. The method of clause 23, wherein the SE comprises a flag indicating whether a crosscomponent prediction (CCP) mode is applied, wherein the flag comprises cep flag.

[0293] Clause 57. The method of clause 56, wherein if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded with the CCP mode, the parameter is equal to a second number.

[0294] Clause 58. The method of clause 56, wherein if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded without the CCP mode, the parameter is equal to a second number.

[0295] Clause 59. The method of clause 23, wherein the SE comprises a flag indicating whether a nonlocal CCP mode is applied, wherein the flag comprises non local ccp flag.

[0296] Clause 60. The method of clause 59, wherein if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded with a CCP mode, the parameter is equal to a second number.

[0297] Clause 61. The method of clause 59, wherein if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded without a CCP mode, the parameter is equal to a second number.

[0298] Clause 62. The method of clause 59, wherein if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded with the nonlocal CCP mode, the parameter is equal to a second number.

[0299] Clause 63. The method of clause 59, wherein if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded without the non-local CCP mode, the parameter is equal to a second number.

[0300] Clause 64. The method of clause 23, wherein the SE comprises a flag indicating whether an extrapolation filter-based intra prediction (EIP) is applied, wherein the flag comprises eip flag.

[0301] Clause 65. The method of clause 23, wherein the SE comprises a flag indicating whether the most probable mode (MPM) is applied for an intra-prediction, wherein the flag comprises mpm flag.

[0302] Clause 66. The method of clause 23, wherein the SE comprises an indication indicating whether to and / or how to apply an ISP mode, wherein the indication comprises isp mode.

[0303] Clause 67. The method of clause 23, wherein the SE comprises a flag indicating whether transform skip is applied in the block, wherein the flag comprises transform skip flag.

[0304] Clause 68. The method of clause 23, wherein the SE comprises an indication indicating whether there is at least one non-zero coefficient in at least one component, wherein the indication comprises root cbf.

[0305] Clause 69. The method of clause 23, wherein the SE comprises a flag indicating whether decoder derived CCP mode is applied, wherein the flag comprises dd ccp flag.

[0306] Clause 70. The method of clause 23, wherein the SE comprises a flag indicating whether a46 F1255801PCTconvolutional cross-component model (CCCM) is applied, wherein the flag comprises cccm flag.

[0307] Clause 71 . The method of clause 23, wherein the SE comprises a flag indicating whether a multiple transform selection (MTS) is applied, wherein the flag comprises mts flag.

[0308] Clause 72. The method of clause 1, wherein the at least one binarized bin of the SE is coded with the context, wherein the context is determined by at least one of: a width of the block, or a height of the block.

[0309] Clause 73. The method of clause 72, wherein a first context is used if the width is greater than the height, or wherein a second context is used if the width is less than the height, or wherein a third context is used if the width is equal to the height.

[0310] Clause 74. The method of clause 72, wherein a first context is used if the width is greater than a first number and the height is greater than a second number, or wherein a second context is used if the width is less than or equal to the first number or the height is less than or equal to the second number.

[0311] Clause 75. The method of clause 72, wherein a first context is used if the width is less than or equal to a first number and the height is less than or equal to a second number, or wherein a second context is used if the width is greater than the first number or the height is greater than the second number.

[0312] Clause 76. The method of clause 72, wherein a first context is used if the width is less than or equal to a first number or the height is less than or equal to a second number, or wherein a second context is used if the width is greater than the first number and the height is greater than the second number.

[0313] Clause 77. The method of clause 72, wherein a first context is used if the width multiplying the height is greater than a number, or wherein a second context is used if the width multiplying the height is less than or equal to the number.

[0314] Clause 78. The method of clause 72, wherein a first context is used if the width multiplying the height is less than or equal to a number, or wherein a second context is used if the width multiplying the height is greater than the number.

[0315] Clause 79. The method of clause 72, wherein a first context is used if the width is greater than the height multiplying a number, or wherein a second context is used if the width is less than or equal to the height multiplying the number.

[0316] Clause 80. The method of clause 72, wherein a first context is used if the width is less than the height multiplying a number, or wherein a second context is used if the width is greater than or equal to the height multiplying the number.

[0317] Clause 81. The method of clause 72, wherein a first context is used if the height is greater than the width multiplying a number, or wherein a second context is used if the height is less than or equal to the width multiplying the number.

[0318] Clause 82. The method of clause 72, wherein a first context is used if the height is less than the width multiplying a number, or wherein a second context is used if the height is greater than or equal to the width multiplying the number.

[0319] Clause 83. The method of clause 72, wherein the SE comprises an indication indicating whether to and / or how to apply an ISP mode, wherein the indication comprises isp mode.

[0320] Clause 84. The method of clause 83, wherein a first context is used if the width is greater than the47 F1255801PCTheight, or wherein a second context is used if the width is less than the height, or wherein a third context is used if the width is equal to the height.

[0321] Clause 85. The method of clause 72, wherein the SE comprises a flag indicating whether the most probable mode (MPM) is applied for an intra-prediction, wherein the flag comprises mpm flag.

[0322] Clause 86. The method of clause 72, wherein the SE comprises a flag indicating whether an extrapolation filter-based intra prediction (EIP) is applied, wherein the flag comprises eip flag.

[0323] Clause 87. The method of clause 72, wherein the SE comprises a flag indicating whether a cross - component prediction (CCP) mode is applied, wherein the flag comprises cep flag.

[0324] Clause 88. The method of clause 72, wherein the SE comprises a flag indicating whether a joint Cb-Cr residue (JCCR) coding mode is applied, wherein the flag comprises jccr flag.

[0325] Clause 89. The method of clause 72, wherein the SE comprises an indication indicating whether there is at least one non-zero coefficient in a component with an identifier, wherein the indication comprises cbf[component_id].

[0326] Clause 90. The method of clause 72, wherein the SE comprises a flag indicating whether a transform skip is applied in the block, wherein the flag comprises transform skip flag.

[0327] Clause 91. The method of clause 72, wherein the SE comprises an indication indicating whether there is at least one non-zero coefficient in at least one component, wherein the indication comprises root cbf.

[0328] Clause 92. The method of clause 72, wherein the SE comprises a flag indicating whether decoder derived CCP mode is applied, wherein the flag comprises dd ccp flag.

[0329] Clause 93. The method of clause 72, wherein the SE comprises a flag indicating whether a multiple transform selection (MTS) is applied, wherein the flag comprises mts flag.

[0330] Clause 94. The method of clause 1, wherein the at least one binarized bin of the SE is coded with the context, wherein the context is determined by a bin index.

[0331] Clause 95. The method of clause 94, wherein at least one bin is coded with the context.

[0332] Clause 96. The method of clause 95, wherein the at least one bin comprises the first bin.

[0333] Clause 97. The method of clause 94, wherein each bin is coded with a corresponding context.

[0334] Clause 98. The method of clause 94, wherein two bins are coded with two different contexts.

[0335] Clause 99. The method of clause 94, wherein two bins are coded with a same context.

[0336] Clause 100. The method of clause 94, wherein the SE comprises an indication indicating a type of a CCP mode, wherein the indication comprises ccp type.

[0337] Clause 101. The method of clause 100, wherein the ccp type is binarized as a truncated unary code.

[0338] Clause 102. The method of clause 94, wherein the SE comprises an indication indicating a type of a chroma intra-prediction mode, wherein the indication comprises chroma intra type.

[0339] Clause 103. The method of clause 94, wherein the SE comprises an indication indicating a type of a luma intra-prediction mode, wherein the indication comprises luma intra type.

[0340] Clause 104. The method of clause 103, wherein the luma intra type indicates the luma intraprediction mode not included in a set of most probable modes (MPMs).48 F1255801PCT

[0341] Clause 105. The method of clause 103, wherein the luma intra type is binarized as a truncated unary code.

[0342] Clause 106. The method of clause 94, wherein the SE comprises an indication indicating an index of a spatial geometric partitioning mode (SGPM), wherein the indication comprises sgpm idx.

[0343] Clause 107. The method of clause 106, wherein the sgpm idx is binarized as a truncated unary code.

[0344] Clause 108. The method of clause 94, wherein the SE comprises an indication indicating an index of a cross-component linear model (CCLM) delta slope, wherein the indication comprises cclm delta idx.

[0345] Clause 109. The method of clause 108, wherein the cclm delta idx is binarized as a truncated unary code.

[0346] Clause 110. The method of clause 94, wherein the SE comprises an indication indicating an index of a non-local CCP mode, wherein the indication comprises non local ccp idx.

[0347] Clause 111. The method of clause 110, wherein the non local ccp idx is binarized as a truncated unary code.

[0348] Clause 112. The method of clause 94, wherein the SE comprises an indication indicating an index of a decoder derived CCP mode, wherein the indication comprises dd ccp idx.

[0349] Clause 113. The method of clause 112, wherein the dd ccp idx is binarized as a truncated unary code.

[0350] Clause 114. The method of clause 1, wherein the at least one binarized bin of the SE is coded with the context, wherein the context is determined by a coding mode.

[0351] Clause 115. The method of clause 114, wherein the SE comprises a flag indicating whether a convolutional cross-component model (CCCM) is applied, wherein the flag comprises cccm flag.

[0352] Clause 116. The method of clause 115, wherein the context is determined by an indication indicating a type of a cross -component prediction (CCP) mode, wherein the indication comprises ccp type.

[0353] Clause 117. The method of clause 116, wherein a first context is used if a CCP mode is used.

[0354] Clause 118. The method of clause 116, wherein a second context is used if a multi -model (MM)- CCP mode is used.

[0355] Clause 119. The method of clause 116, wherein a third context is used if one of the following is used: a CCP-left mode, a CCP-top mode, a MM-CCP-left mode, or a MM-CCP-top mode.

[0356] Clause 120. The method of clause 114, wherein the SE comprises a flag indicating whether a multiple transform selection (MTS) is applied, wherein the flag comprises mts flag.

[0357] Clause 121. The method of clause 120, wherein the context is determined by whether a coding mode is applied.

[0358] Clause 122. The method of clause 121, wherein a first context is used if a matrix -based intra prediction (MIP) mode or an extrapolation filter-based intra prediction (EIP) mode is used, or wherein a second context is used if the MIP mode and the EIP mode is not used.

[0359] Clause 123. The method of clause 121, wherein the context is determined by a sum of absolute values of coefficients.49 F1255801PCT

[0360] Clause 124. The method of clause 123, wherein one or more contexts is selected based on the sum of the absolute values of the coefficients.

[0361] Clause 125. The method of clause 123, wherein a first set of contexts is used if a MIP mode or an EIP mode is used, or wherein a second set of contexts is used if the MIP mode and the EIP mode is not used.

[0362] Clause 126. The method of clause 1, wherein whether to and / or how to apply a derivation of the context depends on coding information.

[0363] Clause 127. The method of clause 126, wherein the derivation of the context is applied to one or more color components.

[0364] Clause 128. The method of clause 126, wherein the derivation of the context is applied if a target coding mode is used, or wherein the derivation of the context is applied if the target coding mode is not used.

[0365] Clause 129. The method of clause 128, wherein the target coding mode comprises one of: an intra sub-partition (ISP) mode, a block -based delta pulse code modulation (BDPCM), an intra block copy (IBC) mode, a geometric partitioning mode (GPM), a spatial geometric partitioning mode (SGPM), a crosscomponent linear model (CCLM), a convolutional cross -component model (CCCM), or an affine mode.

[0366] Clause 130. The method of clause 126, wherein the derivation of the context is applied if a width of the block and / or a height of the block satisfies one or more conditions.

[0367] Clause 131. The method of any of clauses 1 to 130, wherein the SE is binarized as one of: a flag, a fixed length code, an exponential-Golomb (EG(x)) code, a unary code, a truncated unary code, or a truncated binary code.

[0368] Clause 132. The method of clause 131, wherein the binarized SE is signed or unsigned.

[0369] Clause 133. The method of any of clauses 1 to 130, wherein the SE representing a coding tool or a coding approach is determined to be unused without being signalled, if the coding tool or the coding approach is not applicable or not capable of being used.

[0370] Clause 134. The method of any of clauses 1 to 130, wherein the SE is coded with at least one context model, or wherein the SE is bypass coded.

[0371] Clause 135. The method of any of clauses 1 to 130, wherein the SE is signaled.

[0372] Clause 136. The method of clause 135, wherein the SE is signaled if a corresponding function is applicable.

[0373] Clause 137. The method of clause 135, wherein the SE is signaled if a dimension of the block satisfies a condition.

[0374] Clause 138. The method of any of clauses 1 -130, wherein the SE is signaled at one of the followings: a block level, a sequence level, a group of pictures level, a picture level, a slice level, or a tile group level.

[0375] Clause 139. The method of clause 138, wherein the SE is signaled in a coding structure of one of the followings: a coding tree unit (CTU), a coding unit (CU), a transform unit (TU), a prediction unit (PU), a coding tree block (CTB), a coding block (CB), a prediction block (PB), or a transform block (TB).

[0376] Clause 140. The method of clause 138, wherein the SE is signaled in one of the followings: a50 F1255801PCTsequence header, a picture header, a sequence parameter set (SPS), a video parameter set (VPS), a decoding parameter set (DPS), decoding capability information (DCI), a picture parameter set (PPS), an adaptation parameter set (APS), a slice header, or a tile group header.

[0377] Clause 141. The method of any of clauses 1-130, wherein whether to and / or how to determine the least one binarized bin of the SE is signaled at one of the following: a block level, a sequence level, a group of pictures level, a picture level, a slice level, or a tile group level.

[0378] Clause 142. The method of clause 141, wherein whether to and / or how to determine the least one binarized bin of the SE is signaled in one of the following: a coding tree unit (CTU), a coding unit (CU), a transform unit (TU), a prediction unit (PU), a coding tree block (CTB), a coding block (CB), a prediction block (PB), or a transform block (TB).

[0379] Clause 143. The method of clause 141, wherein whether to and / or how to determine the least one binarized bin of the SE is signaled in one of the followings: a sequence header, a picture header, a sequence parameter set (SPS), a video parameter set (VPS), a decoding parameter set (DPS), decoding capability information (DCI), a picture parameter set (PPS), an adaptation parameter set (APS), a slice header, or a tile group header.

[0380] Clause 144. The method of any of clauses 1 to 130, further comprising: determining, based on coded information of the block of the video, whether to and / or how to determine the least one binarized bin of the SE, the coded information comprising at least one of: a block size, a colour format, a single and / or dual tree partitioning, a colour component, a slice type, or a picture type.

[0381] Clause 145. The method of any of clauses 1 to 130, wherein the determination of the least one binarized bin of the SE is applied in a coding tool which requires a chroma fusion.

[0382] Clause 146. The method of any of clauses 1 to 145, wherein the context comprises a context model for coding or parsing the SE in an arithmetic coding.

[0383] Clause 147. The method of any of clauses 1 to 146, wherein the conversion includes encoding the block into the bitstream.

[0384] Clause 148. The method of any of clauses 1 to 146, wherein the conversion includes decoding the block from the bitstream.

[0385] Clause 149. An apparatus for video processing comprising a processor and a non -transitory memory with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to perform a method in accordance with any of clauses 1-148.

[0386] Clause 150. A non-transitory computer-readable storage medium storing instructions that cause a processor to perform a method in accordance with any of clauses 1-148.

[0387] Clause 151. A non-transitory computer-readable recording medium storing a bitstream of a video which is generated by a method performed by an apparatus for video processing, wherein the method comprises: determining at least one binarized bin of a syntax element (SE) associated with a block of the video based on at least one of a context or a plurality of factors; and generating the bitstream based on the at least one binarized bin of the SE.

[0388] Clause 152. A method for storing a bitstream of a video, comprising: determining at least one binarized bin of a syntax element (SE) associated with a block of the video based on at least one of a51 F1255801PCTcontext or a plurality of factors; generating the bitstream based on the at least one binarized bin of the SE; and storing the bitstream in a non -transitory computer-readable recording medium.Example Device

[0389] Fig. l ' l illustrates a block diagram of a computing device 2700 in which various embodiments of the present disclosure can be implemented. The computing device 2700 may be implemented as or included in the source device 110 (or the video encoder 114 or 200) or the destination device 120 (or the video decoder 124 or 300).

[0390] It would be appreciated that the computing device 2700 shown in Fig. 27 is merely for purpose of illustration, without suggesting any limitation to the functions and scopes of the embodiments of the present disclosure in any manner.

[0391] As shown in Fig. 27, the computing device 2700 includes a general-purpose computing device 2700. The computing device 2700 may at least comprise one or more processors or processing units 2710, a memory 2720, a storage unit 2730, one or more communication units 2740, one or more input devices 2750, and one or more output devices 2760.

[0392] In some embodiments, the computing device 2700 may be implemented as any user terminal or server terminal having the computing capability. The server terminal may be a server, a large -scale computing device or the like that is provided by a service provider. The user terminal may for example be any type of mobile terminal, fixed terminal, or portable terminal, including a mobile phone, station, unit, device, multimedia computer, multimedia tablet, Internet node, communicator, desktop computer, laptop computer, notebook computer, netbook computer, tablet computer, personal communication system (PCS) device, personal navigation device, personal digital assistant (PDA), audio / video player, digital camera / video camera, positioning device, television receiver, radio broadcast receiver, E-book device, gaming device, or any combination thereof, including the accessories and peripherals of these devices, or any combination thereof. It would be contemplated that the computing device 2700 can support any type of interface to a user (such as “wearable” circuitry and the like).

[0393] The processing unit 2710 may be a physical or virtual processor and can implement various processes based on programs stored in the memory 2720. In a multi-processor system, multiple processing units execute computer executable instructions in parallel so as to improve the parallel processing capability of the computing device 2700. The processing unit 2710 may also be referred to as a central processing unit (CPU), a microprocessor, a controller or a microcontroller.

[0394] The computing device 2700 typically includes various computer storage medium. Such medium can be any medium accessible by the computing device 2700, including, but not limited to, volatile and non-volatile medium, or detachable and non -detachable medium. The memory 2720 can be a volatile memory (for example, a register, cache, Random Access Memory (RAM)), a non-volatile memory (such as a Read-Only Memory (ROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), or a flash memory), or any combination thereof. The storage unit 2730 may be any detachable or non- detachable medium and may include a machine -readable medium such as a memory, flash memory drive, magnetic disk or another other media, which can be used for storing information and / or data and can be accessed in the computing device 2700.52 F1255801PCT

[0395] The computing device 2700 may further include additional detachable / non-detachable, volatile / non-volatile memory medium. Although not shown in Fig. 27, it is possible to provide a magnetic disk drive for reading from and / or writing into a detachable and non-volatile magnetic disk and an optical disk drive for reading from and / or writing into a detachable non-volatile optical disk. In such cases, each drive may be connected to a bus (not shown) via one or more data medium interfaces.

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

[0397] The input device 2750 may be one or more of a variety of input devices, such as a mouse, keyboard, tracking ball, voice-input device, and the like. The output device 2760 may be one or more of a variety of output devices, such as a display, loudspeaker, printer, and the like. By means of the communication unit 2740, the computing device 2700 can further communicate with one or more external devices (not shown) such as the storage devices and display device, with one or more devices enabling the user to interact with the computing device 2700, or any devices (such as a network card, a modem and the like) enabling the computing device 2700 to communicate with one or more other computing devices, if required. Such communication can be performed via input / output (I / O) interfaces (not shown).

[0398] In some embodiments, instead of being integrated in a single device, some or all components of the computing device 2700 may also be arranged in cloud computing architecture. In the cloud computing architecture, the components may be provided remotely and work together to implement the functionalities described in the present disclosure. In some embodiments, cloud computing provides computing, software, data access and storage service, which will not require end users to be aware of the physical locations or configurations of the systems or hardware providing these services. In various embodiments, the cloud computing provides the services via a wide area network (such as Internet) using suitable protocols. For example, a cloud computing provider provides applications over the wide area network, which can be accessed through a web browser or any other computing components. The software or components of the cloud computing architecture and corresponding data may be stored on a server at a remote position. The computing resources in the cloud computing environment may be merged or distributed at locations in a remote data center. Cloud computing infrastructures may provide the services through a shared data center, though they behave as a single access point for the users. Therefore, the cloud computing architectures may be used to provide the components and functionalities described herein from a service provider at a remote location. Alternatively, they may be provided from a conventional server or installed directly or otherwise on a client device.

[0399] The computing device 2700 may be used to implement video encoding / decoding in embodiments of the present disclosure. The memory 2720 may include one or more video coding modules 2725 having one or more program instructions. These modules are accessible and executable by the processing unit 2710 to perform the functionalities of the various embodiments described herein.53 F1255801PCT

[0400] In the example embodiments of performing video encoding, the input device 2750 may receive video data as an input 2770 to be encoded. The video data may be processed, for example, by the video coding module 2725, to generate an encoded bitstream. The encoded bitstream may be provided via the output device 2760 as an output 2780.

[0401] In the example embodiments of performing video decoding, the input device 2750 may receive an encoded bitstream as the input 2770. The encoded bitstream may be processed, for example, by the video coding module 2725, to generate decoded video data. The decoded video data may be provided via the output device 2760 as the output 2780.

[0402] While this disclosure has been particularly shown and described with references to example embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the present application as defined by the appended claims. Such variations are intended to be covered by the scope of this present application. As such, the foregoing description of embodiments of the present application is not intended to be limiting.54 F1255801PCT

Claims

I / We Claim:

1. A method for video processing, comprising: determining, for a conversion between a block of a video and a bitstream of the video, at least one binarized bin of a syntax element (SE) associated with the block based on at least one of a context or a plurality of factors; and performing the conversion based on the at least one binarized bin of the SE.

2. The method of claim 1, wherein the at least one binarized bin of the SE is coded with the context, wherein the context is determined by at least one of a color component or a color format.

3. The method of claim 1, wherein the at least one binarized bin of the SE is coded with the context, wherein the context is determined by a splitting tree structure.

4. The method of claim 3, wherein the splitting tree structure comprises one of: a dual-tree structure or a single-tree structure.

5. The method of any of claims 1 to 4, wherein the at least one binarized bin of the SE is coded with a first context for a luma component and with a second context for a chroma component.

6. The method of claim 5, wherein if a dual-tree splitting structure is applied, the at least one binarized bin of the SE is coded with the first context and the second context.

7. The method of claim 5, wherein the SE indicates whether to and / or how to split the block.

8. The method of claim 7, wherein the SE indicates whether a coding unit (CU) is split.

9. The method of claim 7, wherein the SE indicates whether a split approach is applied.

10. The method of claim 9, wherein the split approach comprises a qual-tree (QT) split approach.

11. The method of claim 7, wherein the SE indicates a type of a split mode.

12. The method of claim 11, wherein the type of the split mode comprises one of: a binary-tree (BT) or a ternary-tree (BT).

13. The method of claim 7, wherein the SE indicates a direction of the split.

14. The method of claim 13, wherein the direction of the split comprises one of: a vertical split or a horizontal split.55 F1255801PCT15. The method of claim 1, wherein the at least one binarized bin of the SE is determined by the plurality of factors, wherein at least one factor in the plurality of factors comprises a color component.

16. The method of claim 15, wherein a first context index is derived for the SE, wherein the first context index is used to indicate whether to and / or how to split the block.

17. The method of claim 16, wherein the first context index is derived independently of a color format.

18. The method of claim 15, wherein a second context index is derived from a first context index and a color format, wherein the first context index is used to indicate whether to and / or how to split the block.

19. The method of claim 18, wherein if a dual tree is applied, a first set of contexts is used for a luma component, wherein the first set of contexts corresponds to the first context index.

20. The method of claim 18, wherein if a dual tree is applied, a second set of contexts is used for a chroma component, wherein the second set of contexts corresponds to the first context index.

21. The method of claim 18, wherein if a single tree structure is applied, a third set of contexts is used, wherein the third set of contexts corresponds to the first context index.

22. The method of claim 18, wherein if a dual tree structure is applied, a third set of contexts is used, wherein the third set of contexts corresponds to the first context index.

23. The method of claim 1, wherein the at least one binarized bin of the SE is coded with the context, wherein the context is determined by at least one neighbouring block.

24. The method of claim 23, wherein a first neighbouring block is used to determine the context, wherein a first parameter is derived for the first neighbouring block.

25. The method of claim 24, wherein the first parameter is equal to a first number if at least one of the following conditions is satisfied: the first neighbouring block is not available, the first neighbouring block is in a region inaccessible, the first neighbouring block is coded with a mode, the first neighbouring block is coded with a coded bit flag (CBF) equal to zero, a width and / or a height of the first neighbouring block is larger than or smaller than a threshold, or a size of the first neighbouring block is larger than or smaller than another threshold.56 F1255801PCT26. The method of claim 25, wherein the mode comprises one of: a palette mode, an intra block copy (IBC) mode, a transform skip mode, an inter mode, an intra mode, or a block-based delta pulse code modulation (BDPCM) mode.

27. The method of claim 25 or 26, wherein the first number is equal to zero.

28. The method of claim 24, wherein if the first parameter is not equal to the first number and the first neighbouring block satisfies at least one additional condition, the first parameter is equal to a second number.

29. The method of claim 28, wherein the first number is equal to zero and the second number is equal to one, or wherein the first number is equal to zero and the second number is equal to zero.

30. The method of claim 23, wherein a plurality of neighbouring blocks including a first neighbouring block and a second neighbouring block are used to determine the context, wherein a first parameter is derived for the first neighbouring block and a second parameter is derived for the second neighbouring block.

31. The method of claim 30, wherein a context index corresponding to the context is derived as one of: a sum of the first parameter and the second parameter, a logical disjunction of the first parameter and the second parameter, or a logical conjunction of the first parameter and the second parameter.

32. The method of claim 30, wherein a context index corresponding to the context is derived as the first parameter or the second parameter.

33. The method of claim 30, wherein the first neighbouring block and / or the second neighbouring block is a top neighbouring block.

34. The method of claim 33, wherein a position in the first neighbouring block is above the block.

35. The method of claim 33, wherein a position in the second neighbouring block is left to the block.

36. The method of claim 23, wherein the at least one neighbouring block is dependent on a color component.

37. The method of claim 36, wherein if a dual-tree is applied and the block is a luma block, the context is determined by a first set of neighbouring blocks, wherein the number of blocks in the first set of neighbouring blocks is greater than or equal to zero, or57 F1255801PCTwherein if a dual-tree is applied and the block is a chroma block, the context is determined by a second set of neighbouring blocks, wherein the number of blocks in the second set of neighbouring blocks is greater than or equal to zero.

38. The method of claim 23, wherein the SE comprises a flag indicating whether a transform skip is applied in the block, wherein the flag comprises transform skip flag.

39. The method of claim 38, wherein if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded with the flag equal to 1, the parameter is equal to a second number.

40. The method of claim 23, wherein the SE comprises an indication indicating whether there is at least one non-zero coefficient in at least one component, wherein the indication comprises root cbf.

41. The method of claim 40, wherein if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded with the at least one non-zero coefficient in the at least one component, the parameter is equal to a second number.

42. The method of claim 40, wherein if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded without the at least one non-zero coefficient in the at least one component, the parameter is equal to a second number.

43. The method of claim 23, wherein the SE comprises an indication indicating whether there is at least one non-zero coefficient in a component with an identifier, wherein the indication comprises cbf [component id] .

44. The method of claim 43, wherein if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded with the at least one non-zero coefficient in the component with the identifier, the parameter is equal to a second number.

45. The method of claim 43, wherein if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded without the at least one non-zero coefficient in the component with the identifier, the parameter is equal to a second number.

46. The method of claim 43, wherein the context is derived by the at least one neighbouring block for a color component.

47. The method of claim 46, wherein the color component comprises a luma component and / or a Cb component.58 F1255801PCT48. The method of claim 43, wherein the context is derived by the at least one neighbouring block if a mode is not used.

49. The method of claim 48, wherein the mode comprises an intra sub-partition (ISP) mode and / or a block-based delta pulse code modulation (BDPCM).

50. The method of claim 23, wherein the SE comprises a flag indicating whether a joint Cb-Cr residue (JCCR) coding mode is applied, wherein the flag comprises jccr flag.

51. The method of claim 50, wherein if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded with the JCCR coding mode, the parameter is equal to a second number.

52. The method of claim 50, wherein if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded without the JCCR coding mode, the parameter is equal to a second number.

53. The method of claim 50, wherein the context used to code the flag indicating whether the JCCR coding mode is applied depends on a coded bit flag (CBF).

54. The method of claim 53, wherein a context index corresponding to the context is derived as a cbf mask corresponding to the CBF minus 1, wherein the cbf mask is equal to: cbf cb * 2 + cbf cr.

55. The method of claim 53, wherein a context index corresponding to the context is equal to: cbf mask - 1+C0 * 3, wherein CO is equal to one of: a sum of a first parameter derived for a first neighbouring block used to determine the context and a second parameter derived for a second neighbouring block used to determine the context, a logical disjunction of the first parameter and the second parameter, or a logical conjunction of the first parameter and the second parameter.

56. The method of claim 23, wherein the SE comprises a flag indicating whether a cross-component prediction (CCP) mode is applied, wherein the flag comprises ccp flag.

57. The method of claim 56, wherein if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded with the CCP mode, the parameter is equal to a second number.59 F1255801PCT58. The method of claim 56, wherein if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded without the CCP mode, the parameter is equal to a second number.

59. The method of claim 23, wherein the SE comprises a flag indicating whether a non-local CCP mode is applied, wherein the flag comprises non local ccp flag.

60. The method of claim 59, wherein if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded with a CCP mode, the parameter is equal to a second number.

61. The method of claim 59, wherein if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded without a CCP mode, the parameter is equal to a second number.

62. The method of claim 59, wherein if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded with the non-local CCP mode, the parameter is equal to a second number.

63. The method of claim 59, wherein if a parameter derived for a neighbouring block used to determine the context is not equal to a first number and the neighbouring block is coded without the non-local CCP mode, the parameter is equal to a second number.

64. The method of claim 23, wherein the SE comprises a flag indicating whether an extrapolation filterbased intra prediction (EIP) is applied, wherein the flag comprises eip flag.

65. The method of claim 23, wherein the SE comprises a flag indicating whether the most probable mode (MPM) is applied for an intra-prediction, wherein the flag comprises mpm flag.

66. The method of claim 23, wherein the SE comprises an indication indicating whether to and / or how to apply an ISP mode, wherein the indication comprises isp mode.

67. The method of claim 23, wherein the SE comprises a flag indicating whether transform skip is applied in the block, wherein the flag comprises transform skip flag.

68. The method of claim 23, wherein the SE comprises an indication indicating whether there is at least one non-zero coefficient in at least one component, wherein the indication comprises root cbf.60 F1255801PCT69. The method of claim 23, wherein the SE comprises a flag indicating whether decoder derived CCP mode is applied, wherein the flag comprises dd ccp flag.

70. The method of claim 23, wherein the SE comprises a flag indicating whether a convolutional crosscomponent model (CCCM) is applied, wherein the flag comprises cccm flag.

71. The method of claim 23, wherein the SE comprises a flag indicating whether a multiple transform selection (MTS) is applied, wherein the flag comprises mts flag.

72. The method of claim 1, wherein the at least one binarized bin of the SE is coded with the context, wherein the context is determined by at least one of: a width of the block, or a height of the block.

73. The method of claim 72, wherein a first context is used if the width is greater than the height, or wherein a second context is used if the width is less than the height, or wherein a third context is used if the width is equal to the height.

74. The method of claim 72, wherein a first context is used if the width is greater than a first number and the height is greater than a second number, or wherein a second context is used if the width is less than or equal to the first number or the height is less than or equal to the second number.

75. The method of claim 72, wherein a first context is used if the width is less than or equal to a first number and the height is less than or equal to a second number, or wherein a second context is used if the width is greater than the first number or the height is greater than the second number.

76. The method of claim 72, wherein a first context is used if the width is less than or equal to a first number or the height is less than or equal to a second number, or wherein a second context is used if the width is greater than the first number and the height is greater than the second number.

77. The method of claim 72, wherein a first context is used if the width multiplying the height is greater than a number, or wherein a second context is used if the width multiplying the height is less than or equal to the number.

78. The method of claim 72, wherein a first context is used if the width multiplying the height is less than or equal to a number, or wherein a second context is used if the width multiplying the height is greater than the number.61 F1255801PCT79. The method of claim 72, wherein a first context is used if the width is greater than the height multiplying a number, or wherein a second context is used if the width is less than or equal to the height multiplying the number.

80. The method of claim 72, wherein a first context is used if the width is less than the height multiplying a number, or wherein a second context is used if the width is greater than or equal to the height multiplying the number.

81. The method of claim 72, wherein a first context is used if the height is greater than the width multiplying a number, or wherein a second context is used if the height is less than or equal to the width multiplying the number.

82. The method of claim 72, wherein a first context is used if the height is less than the width multiplying a number, or wherein a second context is used if the height is greater than or equal to the width multiplying the number.

83. The method of claim 72, wherein the SE comprises an indication indicating whether to and / or how to apply an ISP mode, wherein the indication comprises isp mode.

84. The method of claim 83, wherein a first context is used if the width is greater than the height, or wherein a second context is used if the width is less than the height, or wherein a third context is used if the width is equal to the height.

85. The method of claim 72, wherein the SE comprises a flag indicating whether the most probable mode (MPM) is applied for an intra-prediction, wherein the flag comprises mpm flag.

86. The method of claim 72, wherein the SE comprises a flag indicating whether an extrapolation filterbased intra prediction (EIP) is applied, wherein the flag comprises eip flag.

87. The method of claim 72, wherein the SE comprises a flag indicating whether a cross-component prediction (CCP) mode is applied, wherein the flag comprises ccp flag.

88. The method of claim 72, wherein the SE comprises a flag indicating whether a joint Cb-Cr residue (JCCR) coding mode is applied, wherein the flag comprises jccr flag.

89. The method of claim 72, wherein the SE comprises an indication indicating whether there is at least one non-zero coefficient in a component with an identifier, wherein the indication comprises cbf [component id] .62 F1255801PCT90. The method of claim 72, wherein the SE comprises a flag indicating whether a transform skip is applied in the block, wherein the flag comprises transform skip flag.

91. The method of claim 72, wherein the SE comprises an indication indicating whether there is at least one non-zero coefficient in at least one component, wherein the indication comprises root cbf.

92. The method of claim 72, wherein the SE comprises a flag indicating whether decoder derived CCP mode is applied, wherein the flag comprises dd ccp flag.

93. The method of claim 72, wherein the SE comprises a flag indicating whether a multiple transform selection (MTS) is applied, wherein the flag comprises mts flag.

94. The method of claim 1, wherein the at least one binarized bin of the SE is coded with the context, wherein the context is determined by a bin index.

95. The method of claim 94, wherein at least one bin is coded with the context.

96. The method of claim 95, wherein the at least one bin comprises the first bin.

97. The method of claim 94, wherein each bin is coded with a corresponding context.

98. The method of claim 94, wherein two bins are coded with two different contexts.

99. The method of claim 94, wherein two bins are coded with a same context.

100. The method of claim 94, wherein the SE comprises an indication indicating a type of a CCP mode, wherein the indication comprises ccp type.

101. The method of claim 100, wherein the ccp type is binarized as a truncated unary code.

102. The method of claim 94, wherein the SE comprises an indication indicating a type of a chroma intraprediction mode, wherein the indication comprises chroma intra type.

103. The method of claim 94, wherein the SE comprises an indication indicating a type of a luma intraprediction mode, wherein the indication comprises luma intra type.

104. The method of claim 103, wherein the luma intra type indicates the luma intra-prediction mode not included in a set of most probable modes (MPMs).63 F1255801PCT105. The method of claim 103, wherein the luma intra type is binarized as a truncated unary code.

106. The method of claim 94, wherein the SE comprises an indication indicating an index of a spatial geometric partitioning mode (SGPM), wherein the indication comprises sgpm idx.

107. The method of claim 106, wherein the sgpm idx is binarized as a truncated unary code.

108. The method of claim 94, wherein the SE comprises an indication indicating an index of a crosscomponent linear model (CCLM) delta slope, wherein the indication comprises cclm delta idx.

109. The method of claim 108, wherein the cclm delta idx is binarized as a truncated unary code.

110. The method of claim 94, wherein the SE comprises an indication indicating an index of a non-local CCP mode, wherein the indication comprises non local ccp idx.

111. The method of claim 110, wherein the non local ccp idx is binarized as a truncated unary code.

112. The method of claim 94, wherein the SE comprises an indication indicating an index of a decoder derived CCP mode, wherein the indication comprises dd ccp idx.

113. The method of claim 112, wherein the dd ccp idx is binarized as a truncated unary code.

114. The method of claim 1, wherein the at least one binarized bin of the SE is coded with the context, wherein the context is determined by a coding mode.

115. The method of claim 114, wherein the SE comprises a flag indicating whether a convolutional crosscomponent model (CCCM) is applied, wherein the flag comprises cccm flag.

116. The method of claim 115, wherein the context is determined by an indication indicating a type of a cross-component prediction (CCP) mode, wherein the indication comprises ccp type.

117. The method of claim 116, wherein a first context is used if a CCP mode is used.

118. The method of claim 116, wherein a second context is used if a multi -model (MM)-CCP mode is used.

119. The method of claim 116, wherein a third context is used if one of the following is used: a CCP-left mode, a CCP-top mode, a MM-CCP-left mode, or a MM-CCP-top mode.64 F1255801PCT120. The method of claim 114, wherein the SE comprises a flag indicating whether a multiple transform selection (MTS) is applied, wherein the flag comprises mts flag.

121. The method of claim 120, wherein the context is determined by whether a coding mode is applied.

122. The method of claim 121, wherein a first context is used if a matrix-based intra prediction (MIP) mode or an extrapolation filter-based intra prediction (EIP) mode is used, or wherein a second context is used if the MIP mode and the EIP mode is not used.

123. The method of claim 121, wherein the context is determined by a sum of absolute values of coefficients.

124. The method of claim 123, wherein one or more contexts is selected based on the sum of the absolute values of the coefficients.

125. The method of claim 123, wherein a first set of contexts is used if a MIP mode or an EIP mode is used, or wherein a second set of contexts is used if the MIP mode and the EIP mode is not used.

126. The method of claim 1, wherein whether to and / or how to apply a derivation of the context depends on coding information.

127. The method of claim 126, wherein the derivation of the context is applied to one or more color components.

128. The method of claim 126, wherein the derivation of the context is applied if a target coding mode is used, or wherein the derivation of the context is applied if the target coding mode is not used.

129. The method of claim 128, wherein the target coding mode comprises one of: an intra sub-partition (ISP) mode, a block-based delta pulse code modulation (BDPCM), an intra block copy (IBC) mode, a geometric partitioning mode (GPM), a spatial geometric partitioning mode (SGPM), a cross-component linear model (CCLM), a convolutional cross-component model (CCCM), or an affine mode.

130. The method of claim 126, wherein the derivation of the context is applied if a width of the block and / or a height of the block satisfies one or more conditions.

131. The method of any of claims 1 to 130, wherein the SE is binarized as one of: a flag, a fixed length code, an exponential-Golomb (EG(x)) code, a unary code, a truncated unary code, or a truncated binary code.65 F1255801PCT132. The method of claim 131, wherein the binarized SE is signed or unsigned.

133. The method of any of claims 1 to 130, wherein the SE representing a coding tool or a coding approach is determined to be unused without being signalled, if the coding tool or the coding approach is not applicable or not capable of being used.

134. The method of any of claims 1 to 130, wherein the SE is coded with at least one context model, or wherein the SE is bypass coded.

135. The method of any of claims 1 to 130, wherein the SE is signaled.

136. The method of claim 135, wherein the SE is signaled if a corresponding function is applicable.

137. The method of claim 135, wherein the SE is signaled if a dimension of the block satisfies a condition.

138. The method of any of claims 1-130, wherein the SE is signaled at one of the followings: a block level, a sequence level, a group of pictures level, a picture level, a slice level, or a tile group level.

139. The method of claim 138, wherein the SE is signaled in a coding structure of one of the followings: a coding tree unit (CTU), a coding unit (CU), a transform unit (TU), a prediction unit (PU), a coding tree block (CTB), a coding block (CB), a prediction block (PB), or a transform block (TB).

140. The method of claim 138, wherein the SE is signaled in one of the followings: a sequence header, a picture header, a sequence parameter set (SPS), a video parameter set (VPS),66 F1255801PCTa decoding parameter set (DPS), decoding capability information (DCI), a picture parameter set (PPS), an adaptation parameter set (APS), a slice header, or a tile group header.

141. The method of any of claims 1-130, wherein whether to and / or how to determine the least one binarized bin of the SE is signaled at one of the following: a block level, a sequence level, a group of pictures level, a picture level, a slice level, or a tile group level.

142. The method of claim 141, wherein whether to and / or how to determine the least one binarized bin of the SE is signaled in one of the following: a coding tree unit (CTU), a coding unit (CU), a transform unit (TU), a prediction unit (PU), a coding tree block (CTB), a coding block (CB), a prediction block (PB), or a transform block (TB).

143. The method of claim 141, wherein whether to and / or how to determine the least one binarized bin of the SE is signaled in one of the followings: a sequence header, a picture header, a sequence parameter set (SPS), a video parameter set (VPS), a decoding parameter set (DPS), decoding capability information (DCI), a picture parameter set (PPS), an adaptation parameter set (APS), a slice header, or a tile group header.67 F1255801PCT144. The method of any of claims 1 to 130, further comprising: determining, based on coded information of the block of the video, whether to and / or how to determine the least one binarized bin of the SE, the coded information comprising at least one of: a block size, a colour format, a single and / or dual tree partitioning, a colour component, a slice type, or a picture type.

145. The method of any of claims 1 to 130, wherein the determination of the least one binarized bin of the SE is applied in a coding tool which requires a chroma fusion.

146. The method of any of claims 1 to 145, wherein the context comprises a context model for coding or parsing the SE in an arithmetic coding.

147. The method of any of claims 1 to 146, wherein the conversion includes encoding the block into the bitstream.

148. The method of any of claims 1 to 146, wherein the conversion includes decoding the block from the bitstream.

149. An apparatus for video processing comprising a processor and a non-transitory memory with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to perform a method in accordance with any of claims 1-148.

150. A non-transitory computer-readable storage medium storing instructions that cause a processor to perform a method in accordance with any of claims 1-148.

151. A non-transitory computer-readable recording medium storing a bitstream of a video which is generated by a method performed by an apparatus for video processing, wherein the method comprises: determining at least one binarized bin of a syntax element (SE) associated with a block of the video based on at least one of a context or a plurality of factors; and generating the bitstream based on the at least one binarized bin of the SE.

152. A method for storing a bitstream of a video, comprising: determining at least one binarized bin of a syntax element (SE) associated with a block of the video based on at least one of a context or a plurality of factors;68 F1255801PCTgenerating the bitstream based on the at least one binarized bin of the SE; and storing the bitstream in a non-transitory computer-readable recording medium.69 F1255801PCT

Images