Abstract: A method of point cloud attribute coding performed by at least one processor, including obtaining an encoded bitstream corresponding to a point cloud; determining whether the encoded bitstream was encoded using an inter-channel tool for inter-channel decorrelation; based on determining that the encoded bitstream was encoded using the inter-channel tool, decoding the encoded bitstream using the inter-channel tool to reconstruct an attribute signal corresponding to the point cloud; and reconstructing the point cloud using the reconstructed attribute signal.

Abstract: A method of video decoding includes creating a candidate list for a current block in a current picture included in a coded video bitstream. The method further includes determining a coding mode for a candidate block associated with the current block. The method further includes determining whether to add, to the candidate list, a vector associated the candidate block based on the determined coding mode. The method further includes reconstructing the current block using at least one candidate from the candidate list.

Abstract: A method, computer program, and computer system are provided for encoding and decoding video data. Video data including one or more subpictures is received. An identifier value corresponding to a subpicture from among the one or more subpictures is signaled. The video data is encoded and/or decoded based on the signaled identifier value.

Abstract: An apparatus for video decoding includes processing circuitry. The processing circuitry is configured to receive a syntax element in a bit stream indicating a maximum number of merge candidates on a merge candidate list for a set of coding blocks, and receive a merge with motion vector difference (MMVD) flag syntax element in the bit stream indicating that an MMVD mode is used to generate a motion vector predictor of a current block included in the set of coding blocks. The processing circuitry is further configured to infer a base candidate index of the MMVD mode to be a predetermined value when the maximum number of the merge candidates is less than 2.

Abstract: A method of decoding or encoding including receiving information regarding a video sequence for encoding or decoding, determining, for the encoding or decoding of the video sequence, whether to use a first transform core matrix that is of a first size type or a second transform core matrix that is of a second size type, and based on the determining, transmitting information that causes the video sequence to be encoded or decoded using the determined first transform core matrix or second transform core matrix.

Abstract: Aspects of the disclosure include methods, apparatuses, and non-transitory computer-readable storage mediums for video encoding/decoding. An apparatus includes processing circuitry that decodes prediction information of a current block in a current picture that is a part of a coded video sequence. The prediction information indicates a cross component filtering (CCF) process for the current block. The processing circuitry generates filtered reconstruction samples of the current block by applying the CCF process on at least one of predicted samples, residual values, or reconstruction samples of the current block. The filtered reconstruction samples of the current block are used for reconstruction of a subsequent block. The processing circuitry reconstructs the current block and the subsequent block based on the filtered reconstruction samples of the current block.

Abstract: A method of three-dimensional (3D)-Tree coding for neural network model compression, is performed by at least one processor, and includes reshaping a four-dimensional (4D) parameter tensor of a neural network into a 3D parameter tensor of the neural network, the 3D parameter tensor comprising a convolution kernel size, an input feature size, and an output feature size, partitioning the 3D parameter tensor along a plane that is formed by the input feature size and the output feature size into 3D coding tree units (CTU3Ds), partitioning each of the CTU3Ds into a plurality of 3D coding units (CU3Ds) recursively until a predetermined depth, using a quad-tree, and constructing a 3D tree for each of the plurality of CU3Ds, wherein the 3D tree for each of the plurality of CU3Ds is a 3D-Unitree.

Abstract: Embodiments of this application disclose a decoding method includes: obtaining a bitstream including picture data; parsing the bitstream to obtain node split mode information of a first-level coding tree and node split mode information of a second-level coding tree, if the split mode corresponding to the first node is no further splitting, parsing the bitstream to obtain encoding information of the first node; and decoding and reconstructing, based on the encoding information of the first node, a coding unit corresponding to the first node, to obtain a picture corresponding to the picture data.

Abstract: A method of utilizing a 64-point primary transform core matrix to decode may include determining whether to use a first transform core matrix that is a DST-7 primary transform core matrix. When a result of the determination is to use the first transform core matrix, the method may include: (i) constructing the first transform core based on a set of unique numbers, and (ii) decoding using the derived primary transform core. The method may further include, when a result of the determination is to not use the first primary transform: (i) deriving a second transform core based on the same set of unique numbers, and (ii) decoding using the derived second transform core.

Abstract: Systems and methods for coding and decoding of a coded bitstream is provided. A method comprises decoding a block of a picture from a coded bitstream. The decoding includes selecting a transform set based on at least one neighboring reconstructed sample from one or more previously decoded neighboring blocks or from a previously decoded picture and inverse transforming coefficients of the block using a transform from the transform set.

Abstract: Aspects of the disclosure provide methods and apparatuses for point cloud compression and decompression. In some examples, an apparatus for point cloud compression/decompression includes processing circuitry. In some embodiments, the processing circuitry decodes prediction information of a point cloud from a coded bitstream and reconstructs a geometry reconstructed cloud according to a geometry image of the point cloud that is decoded from the coded bitstream. Further, the processing circuitry applies a filter to at least a geometry sample inside a patch of the geometry reconstructed cloud in addition to boundary samples of the patch to generate a smoothed geometry reconstructed cloud, and reconstructs points of the point cloud based on the smoothed geometry reconstructed cloud.

Abstract: A method of decoding may be performed by at least one processor, and may comprise: receiving an entropy coded bitstream comprising compressed video data; generating one or more dequantized blocks, determining whether at least one of a height and a width of the one or more dequantized blocks is greater than or equal to a predefined threshold, and responsive to the at least one of the height or the width of the one or more dequantized blocks being greater than or equal to the predefined threshold, transform coding a dequantized block using a tuned line graph transform (LGT) core to perform direct matrix multiplications for each of the horizontal and vertical dimensions of the one or more dequantized blocks.

Abstract: Aspects of the disclosure provide methods and apparatuses for video encoding/decoding. In some examples, an apparatus for video decoding includes receiving circuitry and processing circuitry. For example, the processing circuitry decodes prediction information of a current block in a current picture from a coded video bitstream. The prediction information is indicative of a prediction mode that uses a first optical flow refinement coding tool. The first optical flow refinement coding tool uses a grid structure that is used additionally by at least a second optical flow refinement coding tool during operations of optical flow refinement. Then, the processing circuitry calculates, using the first optical flow refinement coding tool, refinements to predictions of samples of the current block based on the grid structure, and reconstructs the samples of the current block based on the refinements and the predictions of the samples.

Abstract: Embodiments provide an apparatus and method of partitioning of an image or an image slice. In particular, on an image processing apparatus, the image or image slice is split into an integer number of coding tree units in both vertical and horizontal directions. Boundary coding tree units are then at least partially forced-split so that at least one resulting coding unit is a result of binary-tree partitioning, i.e., includes a coding unit which is longer on one side than on the other side. The longer side is parallel or concurrent to the image or image slice boundary. Recursively partitioning coding units that span the picture boundary without the requirement for signaling partition information in a bitstream can be achieved.

Abstract: Aspects of the disclosure provide methods and apparatuses for video encoding/decoding. Processing circuitry decodes prediction information of a block from a coded video bitstream. The prediction information is indicative of a matrix based intra prediction for the block. The processing circuitry determines entries of a vector based on neighboring samples of the block. An entry can be determined based on one or more neighboring samples of the block. The processing circuitry converts the entries into a reduced bit form with a number of bits satisfying a requirement of using a first multiplication tool that processes fewer bits than a second multiplication tool. Then, the processing circuitry multiplies, using the first multiplication tool, the entries of the vector in the reduced bit form with entries of a matrix to calculate a subset of prediction samples of the block, and determines other prediction samples of the block based on the subset.

Abstract: An apparatus comprises: a memory; and a processor coupled to the memory and configured to: obtain a current block of a video frame, obtain candidate MVs corresponding to neighboring blocks of the video frame, the neighboring blocks neighbor the current block, obtain precisions of the candidate MVs, perform first rounding of the precisions based on a rounding scheme, perform second rounding of the candidate MVs based on the first rounding, perform pruning of the candidate MVs, and generate a candidate list based on the second rounding and the pruning.

Abstract: Aspects of the disclosure provide a method and an apparatus for video coding. In some examples, an apparatus includes processing circuitry that receives a bit stream that includes coded information representing a bin of a syntax element for a current block in a picture. The bin of the syntax element indicates whether a local illumination compensation (LIC) process is applied to code the current block. The processing circuitry selects a context model from multiple candidate context models applicable to coding of the syntax element, according to at least a coding characteristic of a region neighboring the current block, and decodes the coded information according to the selected context model to obtain the bin of the syntax element. The processing circuitry reconstructs the current block in response to the bin of the syntax element.

Abstract: Systems and methods for coding and decoding are provided. A method includes receiving a coded video stream including video data partitioned into a plurality of layers; and decoding the video data of the coded video stream, the decoding including: determining whether a first picture of the coded video stream is to be output based on a syntax element that indicates a mode of output layer set signaling.

Abstract: A method of video decoding performed by a video decoder includes receiving a coded video bitstream including a current picture. The method further includes determining a block size of a current block coded in the intra sub-partition (ISP) coding mode. The method further includes determining a direction and number of partitions of the current block based on the determined block size. The method further includes decoding the current block based on the determined direction and number of partitions of the current block.

Abstract: There is included a method and apparatus comprising computer code configured to cause a processor or processors to perform obtaining a leaf node of geometry based point cloud compression (G-PCC) data, splitting the leaf node into a plurality of cuboids, deriving separate triangle soups for each of the cuboids, and coding a plurality of flags respectively for each of the edges of each of the cuboids, where the plurality of flags indicate whether vertices of the separate triangle soups are present on ones of the edges.