Abstract: A method and system of coding video data using affine motion compensation is described. A method may include receiving a current block of video data that is to be decoded using affine motion compensation, and constructing an affine motion vector predictor (MVP) list for one or more control points of the current block of video data, including adding a motion vector from a neighboring block of video data to the affine MVP list in the case that the motion vector has an associated reference picture that is the same as a target reference picture for the current block of video data. A video coder may determine motion vectors for the one or more control points using the affine MVP list, and code the current block of video data with the determined motion vectors for the one or more control points of the current block of video data.

Abstract: A point cloud encoder and point cloud decoder are configured to convert Cartesian coordinates of a point of point cloud data to spherical coordinates. The spherical coordinates include a radius, an azimuth value, and a laser ID. The point cloud encoder and point cloud decoder may perform the conversion for the azimuth value using a fixed-point implementation using a variable shift value based on a number of bits used for coding azimuth.

Abstract: An example device includes one or more processors configured determine a plurality of subblocks for a current block of video data. For each subblock, the one or more processors (a) generate initial motion vectors for a first prediction direction and a second prediction direction according to an affine motion model, and (b) determine, based on the initial motion vectors, a subblock bilateral matching cost for each respective offset among a plurality of offsets. For each respective offset, the one or more processors determine a respective summation of subblock bilateral matching costs. The one or more processors determine a lowest summation of subblock bilateral matching costs. The one or more processors select an offset associated with the lowest summation of subblock bilateral matching costs. The one or more processors modify the affine motion model based on the selected offset and code the current block based on the modified affine motion model.

Abstract: A device for video decoding can be configured to obtain, from a syntax structure in a bitstream comprising an encoded representation of the video data, a syntax element indicating whether 6-parameter affine prediction is enabled for blocks corresponding to the syntax structure, wherein the blocks corresponding to the syntax structure comprise a first block; based on the syntax element indicating that the 6-parameter affine prediction is enabled for the blocks corresponding to the syntax structure, use the 6-parameter affine prediction to generate a predictive block for the first block; and use the predictive block and residual data to reconstruct the first block.

Abstract: An example method of encoding a point cloud includes obtaining a value of a secondary residual for geometry coding a current predictive tree node of the point cloud; and encoding the value of the secondary residual, wherein encoding the value comprises: encoding, using a first set of context-adaptive binary arithmetic coding (CABAC) contexts, prefix bins of a syntax element having a value that specifies an absolute value of the value of the secondary residual minus 2; and encoding, using a second set of CABAC contexts that is different than the first set of contexts, suffix bins of the syntax element.

Abstract: A method of decoding video data includes generating a fusion of predictors from two or more reference lines of samples relative to a block of video data based on an intra-prediction mode. The method further includes decoding the block of video data using the fusion of predictors and the intra-prediction mode.

Abstract: Systems and techniques are described for processing video data. For example, an apparatus can obtain a block of video data encoded using inter-prediction. In some examples, the apparatus can determine a direction associated with the block of video data, for instance based on pixels of the block of video data, based on pixels of at least one neighboring block of the block of video data, or based on information associated with a geometric partitioning mode (GPM) associated with the block of video data. The apparatus can apply a non-separable transform to the block of video data, for instance to decode or encode the video data. In some examples, the apparatus can apply the non-separable transform to the block according to the direction associated with the block of video data.

Abstract: A device for decoding video data comprises one or more processors configured to: obtain a syntax element from a bitstream that includes an encoded representation of the video data; determine, based on the syntax element, that a template-matching tool is enabled; based on the template-matching tool being enabled, applying the template-matching tool to generate a prediction block for a current coding unit (CU) of the video data; and reconstruct the current CU based on the prediction block for the current CU.

Abstract: A device for decoding video data may be configured to apply a deblocking filter to a block of video data to determine a first filtered block; apply a second filter to the block of video data in parallel with the deblocking filter to determine a second filtered block, wherein the second filter comprises one of a guided filter, a bilateral filter, or an adaptive loop filter; combine the first filtered block and the second filtered block to determine a combined block; apply a third filter to the combined block to determine a third filtered block; process the third filtered block to determine a decoded version of the block of video data; and output the decoded version of the block of video data.

Abstract: A method of coding video data comprises determining, based on a comparison of a threshold and a quantity of reference samples in a selected template, whether the selected template is allowed, wherein a mode index indicates which template from among a plurality of templates is the selected template, wherein each of the templates includes a different set of reconstructed samples that neighbor a current coding unit (CU) of a current picture of the video data; based on determining that the selected template is allowed and that a convolutional cross-component model (CCCM) mode is to be used, applying the CCCM mode to predict chroma samples of the current CU based on reconstructed luma samples of the current CU and the reference samples in the selected template; and; and encoding or decoding the current CU based on the predicted chroma samples of the current CU.

Abstract: An example device for filtering video data includes a memory configured to store video data; and a processing system comprising one or more processors implemented in circuitry, the processing system being configured to: apply one or more neural network processing blocks to intermediate filtered video data, each of the neural network processing blocks including a first 1×1 convolutional filter, a parametric rectified linear unit (PReLU) filter, a second 1×1 convolutional filter, and a 3×3 convolutional filter; apply additional neural network processing blocks to output of the one or more neural network processing blocks to form filtered video data; and output the filtered video data.

Abstract: A method of processing video data includes receiving a syntax element that defines a filtering mode for a neural network (NN) model for both a first color component and a second color component, applying an instance of the NN model, in the defined filtering mode, to a first block of the first color component to generate a first filtered block, and storing the first filtered block for a coding unit (CU).

Abstract: A video decoder can be configured to determine a number of allowed non-zero coefficients for a block of video data based on a size of the block; obtain a set of dequantized coefficients for the block, wherein the set of dequantized coefficients comprises a first subset of dequantized coefficients that includes non-zero dequantized coefficients and a second subset of dequantized coefficients that includes all zero coefficients, wherein a number of coefficients in the first subset of dequantized coefficients is equal to the number of allowed non-zero coefficients for the block of video data; apply an inverse low-frequency non-separable transform (LFNST) to the first subset of dequantized coefficients to determine a first intermediate subset of coefficients; and apply an inverse separable transform to the first intermediate subset of coefficients and at least a portion of the second subset of coefficients to determine a block of reconstructed residual values.

Abstract: Point clouds may be coded using a plurality of laser angles. In one example, a video coder may be configured to code a plurality of syntax elements that indicate respective values of a plurality of laser angles in a sorted order according to a constraint.

Abstract: A G-PCC coder is configured to receive the point cloud data, determine a final quantization parameter (QP) value for the point cloud data as a function of a node QP offset multiplied by a geometry QP multiplier, and code the point cloud data using the final QP value to create an coded point cloud.

Abstract: A video coder may code a block of video data using an intra prediction mode determined from a most probable mode list. The video coder may construct a general most probable mode list containing N entries, wherein the N entries of the general most probable mode list are intra prediction modes, and wherein a planar mode is an ordinal first entry in the general most probable mode list, construct a primary most probable mode list from a first Np entries in the general most probable mode list, where Np is less than N, and construct a secondary most probable mode list from a remaining (N?Np) entries in the general most probable mode list. The video coder may then determine a current intra prediction mode for a current block of video data using the primary most probable mode list or the secondary most probable mode list.

Abstract: An example device for decoding video data includes one or more processors implemented in circuitry and configured to: decode a coding tree unit (CTU) of video data, the CTU including a luminance (luma) block and a chrominance (chroma) block, to produce a decoded luma block and a decoded chroma block; determine that a chroma sample of the decoded chroma block is on a first side of an adaptive loop filter (ALF) virtual boundary and that a co-located luma sample of the decoded luma block is on a second side of the ALF virtual boundary, the co-located luma sample being co-located with the chroma sample, the first side being different than the second side; and in response to determining that the chroma sample is on the first side and the luma sample is on the second side, disable cross-component adaptive loop filtering (CC-ALF) for the chroma sample.

Abstract: A device for decoding video data can be configured to receive a syntax element indicating a maximum block size for a transform skip mode; determine a maximum block size for a block-based delta pulse code modulation (BDPCM) mode based on the syntax element; and decode block of video data based on the determined maximum block size for the BDPCM mode.

Abstract: An example device for binarizing video data includes a memory configured to store video data; and one or more processors implemented in circuitry and configured to: calculate a local sum of absolute values (locSumAbs value) of neighboring coefficients to a current coefficient of a current block of video data; derive a shift value from the locSumAbs value; normalize the locSumAbs value using the shift value; determine a Rice parameter using the normalized locSumAbs value; and binarize or inverse binarize the current coefficient using the Rice parameter. In this manner, these techniques may allow for more appropriate Rice parameter value selection when binarizing high bitdepth data in conjunction with performing context-adaptive binary arithmetic coding (CABAC).

Abstract: A video decoder determines, based on a block size of a current block and a low-frequency non-separable transform (LFNST) syntax element, a zero-out pattern of normatively defined zero-coefficients. The LFNST syntax element is signaled at a transform unit (TU) level. Additionally, the video decoder determines transform coefficients of the current block. The transform coefficients of the current block include transform coefficients in an LFNST region of the current block and transform coefficients outside the LFNST region of the current block. As part of determining the transform coefficients of the current block, the video decoder applies an inverse LFNST to determine values of one or more transform coefficients in the LFNST region of the current block. The video decoder also determines that transform coefficients of the current block in a region of the current block defined by the zero-out pattern are equal to 0.