Abstract: A method of video coding comprises independently generating a respective intra prediction for each of a plurality of corresponding sub-partitions. Each respective intra prediction is generated using a plurality of reference samples from a current coding block. Illustratively, no reconstructed sample from a first sub-partition of the plurality of corresponding sub-partitions is used to generate a respective intra prediction for any other sub-partition of the plurality of corresponding sub-partitions, and each of the plurality of corresponding sub-partitions has a width less than or equal to 2.

Abstract: A method for video coding is provided, including: providing a motion vector (MV) rounding process that is configured to perform a MV rounding operation; applying the MV rounding process to at least a first MV used in a first prediction tool selected from a first set of tools including: pair-wise merge candidate, triangle prediction mode, and affine mode; and applying the MV rounding process to at least a second MV used in a second prediction tool selected from a second set of tools including: temporal motion vector prediction (TMVP), alternative temporal motion vector prediction (ATMVP), and merge mode with motion vector differences (MMVD).

Abstract: A method and a computing device are provided for video coding. The method may include deriving parameter ? and parameter ? for a CCLM mode by using a predetermined number of neighboring reconstructed luma samples and chroma samples in a CU; and generating a final chroma predictor for the chroma samples of the CU by using the parameter ? and the parameter ?.

Abstract: Methods and devices for video decoding are provided. The method includes: receiving a control variable associated with the video block at a coding level, where the control variable enables adaptive switch between a plurality of motion vector refinement (MVR) offset sets, and the video block comprises first and second geometric partitions; receiving one or more syntax elements to determine a first MVR offset for the first geometric partition and a second MVR offset for the second geometric partition from a selected MVR offset set; obtaining a first motion vector (MV) and a second MV from a candidate list for the first and second geometric partitions; calculating a first refined MV and a second refined MV based on the first and second MVs and the first and second MVR offsets; and obtaining prediction samples for the video block based on the first and second refined MVs.

Abstract: A method of decoding a video signal, apparatus, and a non-transitory computer-readable storage medium are provided. The method includes obtaining a video block from the video signal, obtaining spatial neighboring blocks based on the video block, obtaining up to one left non-scaled motion vector predictor (MVP) based on the multiple left spatial neighboring blocks, obtaining up to one above non-scaled MVP based on the multiple above spatial neighboring blocks, deriving, at the decoder and by reducing possibility of selecting scaled MVPs derived from the spatial neighboring blocks, an MVP candidate list based on the video block, the multiple left spatial neighboring blocks, the multiple above spatial neighboring blocks, receiving a best MVP based on the MVP candidate list, and obtaining a prediction signal of the video block based on the best MVP.

Abstract: A method and an apparatus for image filtering in video coding using a neural network are provided. The method includes: loading, a plurality of quantization parameter (QP) map (QpMap) values at a plurality of QpMap channels into the neural network; obtaining a QP scaling factor by adjusting a plurality of input QP values related to an input frame; and adjusting, according to a QP scaling factor, the plurality of QpMap values for the neural network to learn and filter the input frame to the neural network.

Abstract: A method for video coding is provided. The method includes: partitioning video pictures into a plurality of coding units (CUs), at least one of which is further portioned into two prediction units (PUs) including at least one triangular shaped PU with a partitioning orientation in one of: from top-left corner to bottom-right corner, and from top-right corner to bottom-left corner; constructing a uni-prediction motion vector candidate list; determining whether a current CU is coded as triangle prediction mode according to coded information; signaling a partition orientation flag indicating the partitioning orientation; and signaling index values that indicate selected entries in the constructed uni-prediction motion vector candidate list.

Abstract: A method of subblock-based temporal motion vector prediction is performed at a computing device. The computing device acquires a video bitstream including data associated with multiple encoded pictures. While decoding a current picture in the video bitstream, the computing device selects, according to syntax elements signaled in the video bitstream, one reference picture as a collocated picture of the current picture, and determines a temporal vector between the collocated picture and the current picture from motion information of spatially neighboring blocks of a current code unit (CU) according to a fixed order. Next, the computing device splits the current CU into multiple sub-CUs, obtains a temporal motion vector predictor for each sub-CU from the temporal vector and motion information of a block in the collocated picture that corresponds to a respective subblock of the current picture and decodes the current CU according to the temporal motion vector predictors.

Abstract: Methods, apparatuses, and non-transitory computer-readable storage mediums are provided for decoding a video block in geometry partition mode (GPM). The method includes: partitioning the video block into first and second geometric partitions; obtaining a first prediction list for the first geometric partition and obtaining a second prediction list for the second geometric partition; obtaining motion vectors (MVs) for the first and second geometric partitions by applying a GPM with explicit motion signaling (EMS) to the first and second geometric partitions based on the first and second prediction lists; and obtaining prediction samples of the first and second geometric partitions based on the MVs.

Abstract: Methods, apparatuses, and non-transitory computer-readable storage mediums are provided for video coding. The method for video coding includes: receiving, by a decoder, a residual coding rice constraint flag to provide general constraint controls for at least one of other flags; and in response to determining that a value of the residual coding rice constraint flag equals to 1, determining that a value of the at least one of other flags equals to 0.

Abstract: A computing device performs a method of decoding video data by generating a multi-model linear model (MMLM) including a first linear model between the minimum luma value and the threshold luma value, and a second linear model between the threshold luma value and the maximum luma value from a group of reference luma samples and a group of reference chroma samples; and reconstructing a respective sample value of the chroma block from a weighted combination of a respective first corresponding reconstructed sample value of the luma block using the multi-model linear model, and a respective second reconstructed sample value of a neighboring chroma block from an intra prediction mode.

Abstract: Methods, apparatuses, and non-transitory computer-readable storage mediums are provided for video coding with a low-delay transform skip residual coding (TSRC) method. The TSRC method includes: deriving, by an encoder, a rice parameter based on coded information of a current slice of a video. The coded information may include one or more of following parameters: a quantization parameter or a coding bit-depth associated with a slice, a picture, or a sequence of the video; or a hash ratio associated with the slice, the picture, or the sequence of the video.

Abstract: Methods, apparatuses, and non-transitory computer-readable storage mediums are provided for decoding a video signal. The method includes obtaining a first reference picture I associated with a video block, obtaining control point motion vectors (CPMVs) of an affine coding block based on the video block, obtaining prediction samples I(i, j) of the affine coding block, deriving PROF prediction sample refinements of the affine coding block based on the PROF, receiving an LIC flag that indicates whether the LIC is applied to the affine coding block, deriving, and when the LIC is applied, LIC weight and offset based on neighboring reconstructed samples of the affine coding block and their corresponding reference samples in the first reference picture, and obtaining final prediction samples of the affine coding block based on the PROF prediction sample refinements and the LIC weight and offset.

Abstract: A method for video decoding is provided. The method includes obtaining a plurality of sub-blocks within an affine coding unit (CU) of a video frame, where the plurality of sub-blocks include a plurality of boundary sub-blocks and a plurality of non-boundary sub-blocks. Further, the method may include applying both overlapped block motion compensation (OBMC) and affine secondary prediction (ASP) to at least one sub-block to generate a sub-block-based prediction for the affine CU or enabling the ASP for the plurality of non-boundary sub-block and disabling the OBMC for the plurality of non-boundary sub-blocks.

Abstract: A method for coding video data comprises receiving a video picture comprising a plurality of coding units. The picture is divided into multiple non-overlapped blocks. An encoder calculates a hash value of each block of the multiple non-overlapped blocks. All the non-overlapped blocks are classified into at least two categories comprising a first category and a second category. The first category comprises one or more blocks representing one or more hash values covered by a first set of hash values, and the second category comprises all remaining blocks. The blocks in the second category are classified into at least two groups including a first group. The first group comprises one or more blocks representing the same hash value as another block in the second category. An associated computing device and a non-transitory computer readable storage medium are also provided.

Abstract: A method for video coding is provided, including: providing a motion vector (MV) rounding process that is configured to perform a MV rounding operation; applying the MV rounding process to at least a first MV used in a first prediction tool selected from a first set of tools including: pair-wise merge candidate, triangle prediction mode, and affine mode; and applying the MV rounding process to at least a second MV used in a second prediction tool selected from a second set of tools including: temporal motion vector prediction (TMVP), alternative temporal motion vector prediction (ATMVP), and merge mode with motion vector differences (MMVD).

Abstract: An electronic apparatus performs a method of decoding video data. The method includes: receiving, from the video signal, a picture frame that includes a first component and a second component; determining a classifier for the second component from a set of one or more samples of the first component associated with a respective sample of the second component; determining whether to modify a value of the respective sample of the second component within a region of the picture frame according to the classifier; in response to the determination to modify the value of the respective sample of the second component within the region according to the classifier, determining a sample offset for the respective sample of the second component according to the classifier; and modifying the value of the respective sample of the second component based on the determined sample offset.

Abstract: An electronic apparatus performs a method of decoding video data, comprising: receiving, from the video signal, a picture frame that includes a first component and a second component in a first color space; determining a classifier for the second component in the first color space from a set of one or more samples of the first component associated with a respective sample of the second component in the first color space, wherein the set of one or more samples are in a second color space; determining a sample offset for the respective sample of the second component in the first color space according to the classifier; and modifying the value of the respective sample of the second component in the first color space based on the determined sample offset.

Abstract: The present disclosure relates to a decoding method. The method includes acquiring, from a decoder, a regular merge flag for a coding unit (CU) that is coded as merge mode and merge related modes; when the regular merge flag is one, indicating that a regular merge mode or merge mode with motion vector differences (MMVD) is used by the CU, constructing a single merge list for the CU and using regular merge index to indicate which candidate is used; when the regular merge flag is zero, indicating the regular merge mode is not used by the CU, and further receiving mode flags to indicate associated merge related modes are used when a mode flag's constraints are met; and when the regular merge flag is one, determining whether a MMVD merge flag is received based on the value of a MMVD flag.

Abstract: The present disclosure relates to a method for video encoding including: signaling a regular merge flag for a coding unit (CU) that is coded as merge mode and merge related modes; when the regular merge flag is signaled as one, indicating that a regular merge mode or merge mode with motion vector differences (MMVD) is used by the CU, constructing a motion vector merge list for the CU and using regular merge index to indicate which candidate is used; and when the regular merge flag is signaled as zero, indicating the regular merge mode is not used by the CU, and further signaling mode flags to indicate associated merge related modes are used when a mode flag's constraints are met; and when the regular merge flag is signaled as one, determining whether a MMVD merge flag is signaled based on the value of a MMVD flag.