Abstract: The present invention provides a method for decoding a video signal including extracting an inter prediction mode of a current block from the video signal; generating two non-square prediction blocks using two motion vectors according to the inter prediction mode; performing a non-square transform on the two non-square prediction blocks to obtain two non-square prediction blocks on a frequency domain; updating the two non-square prediction blocks on the frequency domain using a correlation coefficient or a scaling coefficient; and generating a reconstruction block based on the updated non-square prediction blocks on the frequency domain and a residual block.

Abstract: A Method of decoding an encoded video bitstream using at least one processor includes: obtaining an encoded video bitstream, the encoded video bitstream including encoded color components; entropy parsing the encoded color components; dequantizing the color components and obtaining transform coefficients of the color components; applying a joint components secondary transform (JCST) on the transform coefficients of the color components, thereby generating JCST outputs; performing a backward transform on the JCST outputs, thereby obtaining residual components of the color components; and decoding the encoded video bitstream based on the residual components of the color components.

Abstract: A method of video decoding includes determining directionality information of a restoration filter unit included in a video frame based on directionality of each of one or more groups of pixels in the restoration filter unit determined by at least one of a previously performed CDEF process or a previously performed intra prediction coding process. The method also includes selecting, based on the directionality information of the restoration filter unit, a set of filter parameters from among a plurality of sets of filter parameters of a restoration filter process, and, after the at least one of the previously performed CDEF process or the previously performed intra prediction coding process, performing one of a Wiener filter process or a self-guided projection filter process as the restoration filter process on the restoration filter unit based on the selected set of filter parameters.

Abstract: A method, apparatus, and computer-readable medium for point cloud coefficient coding are provided. Transform coefficients associated with point cloud data are decomposed into set-index values and symbol-index values, the symbol index-value specifying location of the transform coefficient within a set. The decomposed transform coefficients are partitioned into one or more sets based on the set-index values and the symbol-index values. The set-index values of the partitioned transform coefficients are entropy-coded, and the symbol-index values of the partitioned transform coefficients are bypass-coded. The point cloud data is compressed based on the entropy-coded symbol-index values and the bypass-coded set-index values.

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 determines directionality information of a restoration filter unit included in a video frame based on at least one of a constrained directional enhancement filter (CDEF) process or an intra prediction mode. The processing circuitry determines one of a plurality of sets of filter parameters of a restoration filter process based on the directionality information of the restoration filter unit. The processing circuitry performs the restoration filter process on the restoration filter unit based on the one of the plurality of sets of filter parameters. The processing circuitry reconstructs the video frame based on the filtered restoration filter unit.

Abstract: A method of adaptive point cloud attribute coding is performed by at least one processor and includes determining a centroid of k candidate points of a point cloud, k being a predetermined sampling rate of all points of the point cloud, and selecting one of the k candidate points that is closest to the centroid. The method further includes determining a first levels-of-detail (LoD) layer comprising the one of the k candidate points, and a second LoD layer without the one of the k candidate points, and performing coding of attributes of the all points, based on the first LoD layer and the second LoD layer.

Abstract: A method and apparatus for decoding a video stream encoded using video point cloud coding, the decoding including obtaining a geometry-reconstructed point cloud based on one or more patches; identifying a first boundary of a patch including a plurality of first boundary points; identifying a second boundary including a plurality of second boundary points inside the first boundary; performing smoothing on the first boundary points and the second boundary points; obtaining a smoothed geometry-reconstructed point cloud based on the smoothed first boundary points and the smoothed second boundary points; and reconstructing a dynamic point cloud using the smoothed geometry-reconstructed point cloud.

Abstract: A method of interframe point cloud attribute coding is performed by at least one processor and includes coding a first color attribute of a point of a point cloud to obtain a first reconstructed residual, coding a second color attribute of the point to obtain a second reconstructed residual, and determining a quantization index of the second reconstructed residual, based on the first reconstructed residual and the second reconstructed residual. The method further includes updating the second reconstructed residual, based on the quantization index and the first reconstructed residual.

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.

Abstract: A method of point cloud attribute coding includes obtaining an attribute signal corresponding to a point cloud; determining whether lossless lifting is enabled; based on determining that lossless lifting is enabled, modifying at least one from among a plurality of quantization weight and a plurality of lifting coefficients; decomposing the attribute signal into a plurality of detail signals and a plurality of approximation signals based on the modified at least one from among the plurality of quantization weights and the plurality of lifting coefficients; generating a bitstream representing the point cloud based on the plurality of detail signals and the plurality of approximation signals; and transmitting the bitstream.

Abstract: A method of point cloud geometry decoding including receiving, from a coded bitstream for a point cloud that includes a set of points in a three-dimensional (3D) space, first signaling information being indicative of partition information of the point cloud, and receiving second signaling information that indicates whether the 3D space is an asymmetric cuboid. The method further includes determining dimensions of the 3D space that are signaled along x, y, and z directions based on the second signaling information indicating that the 3D space is the asymmetric cuboid. The method further includes, in response to the first signaling information indicating that the 3D space is the asymmetric cuboid, partitioning the 3D space based on the determined dimensions of the 3D space and based on the partition information indicated by the first signaling information, and reconstructing, by the processing circuitry, the point cloud based on the partitioned 3D space.

Abstract: A method, computer system, and computer-readable medium are provided for point cloud attribute coding by at least one processor. Data associated with a point cloud is received. The received data is transformed through a lifting decomposition based on enabling a scalable coding of attributes associated with the lifting decomposition. The point cloud is reconstructed based on the transformed data.

Abstract: A method, apparatus, and computer-readable medium for point cloud coefficient coding are provided. Transform coefficients associated with point cloud data are decomposed into set-index values and symbol-index values, the symbol index-value specifying location of the transform coefficient within a set. The decomposed transform coefficients are partitioned into one or more sets based on the set-index values and the symbol-index values. The set-index values of the partitioned transform coefficients are entropy-coded, and the symbol-index values of the partitioned transform coefficients are bypass-coded. The point cloud data is compressed based on the entropy-coded symbol-index values and the bypass-coded set-index values.

Abstract: A method of point cloud geometry decoding in a point cloud decoder is provided. In the method, first signaling information is received from a coded bitstream for a point cloud that includes a set of points in a three-dimensional (3D) space. The first signaling information indicates partition information of the point cloud. Second signaling information is determined based on the first signaling information indicating a first value. The second signaling information is indicative of a partition mode of the set of points in the 3D space. Further, the partition mode of the set of points in the 3D space is determined based on the second signaling information. The point cloud is reconstructed subsequently based on the partition mode.

Abstract: A method of predicting point cloud attribute coding includes receiving point cloud data comprising one or more candidate points and extracting one or more candidate attribute values for the one or more candidate points from the received point cloud data. The method further includes calculating a weighted median from the one or more extracted candidate attribute values and a weight factor, whereby the weight factor corresponds to a relative importance factor of a candidate vector associated with the extracted candidate attribute values. The method further includes assign one or more prediction indices corresponding to attribute data for video encoding to the candidate points in response to the calculation of the weighted median, wherein the prediction indices and processing the media content to encode the attribute data associated with the candidate points having the lowest prediction indices.

Abstract: The present invention provides a method for encoding a video signal on the basis of a graph-based separable transform (GBST), the method comprising the steps of: generating an incidence matrix representing a line graph; training a sample covariance matrix for rows and columns from the rows and columns of a residual signal; calculating a graph Laplacian matrix for rows and columns on the basis of the incidence matrix and the sample covariance matrix for rows and columns; and obtaining a GBST by performing eigen decomposition of the graph Laplacian matrix for rows and columns.

Abstract: There is included a method and apparatus comprising computer code configured to cause a processor or processors to perform receiving video data in an AOMedia Video 1 (AV1) format comprising data of at least two chroma prediction-residual signal blocks, a transformation between at least one signal block, having a size less than or equal to a combination of the chroma prediction-residual signal blocks, and the chroma prediction-residual signal blocks, and decoding the video data based on an output of the transformation comprising the at least one signal block having the size less than or equal to the combination of the chroma prediction-residual blocks.

Abstract: A method of obtaining a tree-based point cloud compression (PCC) media stream using moving picture experts group (MPEG)-dynamic adaptive streaming over http (DASH), is performed by at least one processor and includes obtaining, from a server, a media representation description (MPD) comprising a PCC uniform resource indicator (URI) and a PCC three-dimensional (3D) descriptor, and determining whether the PCC URI comprised in the obtained MPD indicates that the tree-based PCC media stream is to be accessed. The method further includes, based on the PCC URI being determined to indicate that the tree-based PCC media stream is to be accessed, obtaining, from the server, the tree-based PCC media stream, using the PCC 3D descriptor comprised in the obtained MPD.

Abstract: A method of adaptive point cloud attribute coding includes obtaining an attribute of a current point included in point cloud data, and obtaining candidate predicted values of the obtained attribute, the candidate predicted values including any one or any combination of a weighted average value of a plurality of distances from the current point respectively to other points included in the point cloud data, a first predicted value of a first distance from the current point to a first nearest point among the other points and a second predicted value of a second distance from the current point to a second nearest point after the first nearest point among the other points. The method further includes selecting, for the obtained attribute, one among the obtained candidate predicted values, using rate-distortion optimization, and setting, for a decoder, a flag indicating whether the obtained candidate predicted values includes the weighted average value.

Abstract: A method of point cloud geometry encoding includes receiving a slice of a point cloud frame for encoding, and constructing an octree representing a geometry of points in a bounding box of the slice where a current node of the octree is partitioned with a quadtree (QT) partition or a binary tree (BT) partition. The constructing includes determining a value of a partitionSkip variable specifying a partition type and a partition direction of the current node of the octree.