Patent classifications
H04N19/184
SIMPLIFIED PROCESSING OF WEIGHTED PREDICTION SYNTAX AND SEMANTICS USING A BIT DEPTH VARIABLE FOR HIGH PRECISION DATA
Particular embodiments may remove a condition check in the semantics for checking a high-precision data flag. This simplifies the semantics used in the encoding and decoding process. In this case, even if the high-precision data flag is not set, the value of the weighted prediction syntax element is set by the BitDepth variable. However, even if the BitDepth is not considered high-precision data, such as 8 bits, the range for the weighted prediction syntax element is still the same as the fixed value. For example, the syntax elements luma_offset_l0[i], luma_offset_l1[i], delta_chroma_offset_l0[i][j], and delta_chroma_offset_l1[i][j] use the variable BitDepth as described above whether the flag extended_precision_processing_flag is enabled and not enabled to indicate whether the bit depth is above a threshold.
SIMPLIFIED PROCESSING OF WEIGHTED PREDICTION SYNTAX AND SEMANTICS USING A BIT DEPTH VARIABLE FOR HIGH PRECISION DATA
Particular embodiments may remove a condition check in the semantics for checking a high-precision data flag. This simplifies the semantics used in the encoding and decoding process. In this case, even if the high-precision data flag is not set, the value of the weighted prediction syntax element is set by the BitDepth variable. However, even if the BitDepth is not considered high-precision data, such as 8 bits, the range for the weighted prediction syntax element is still the same as the fixed value. For example, the syntax elements luma_offset_l0[i], luma_offset_l1[i], delta_chroma_offset_l0[i][j], and delta_chroma_offset_l1[i][j] use the variable BitDepth as described above whether the flag extended_precision_processing_flag is enabled and not enabled to indicate whether the bit depth is above a threshold.
MOTION VECTOR DIFFERENCE FOR BLOCK WITH GEOMETRIC PARTITION
A method of video processing includes determining, for a conversion between a current video block of a video and a bitstream of the video, that the current video block is coded with a geometric partitioning mode. The method further includes deriving at least one refined motion vector (MV) for the current video block by adding at least one motion vector difference (MVD) of multiple MVDs signaled or derived for the current video block to a MV derived from a merge candidate associated with the current video block. The MV being associated with an offset distance and/or an offset direction. The method further includes performing the conversion based on the refined MV.
MOTION VECTOR DIFFERENCE FOR BLOCK WITH GEOMETRIC PARTITION
A method of video processing includes determining, for a conversion between a current video block of a video and a bitstream of the video, that the current video block is coded with a geometric partitioning mode. The method further includes deriving at least one refined motion vector (MV) for the current video block by adding at least one motion vector difference (MVD) of multiple MVDs signaled or derived for the current video block to a MV derived from a merge candidate associated with the current video block. The MV being associated with an offset distance and/or an offset direction. The method further includes performing the conversion based on the refined MV.
Adaptive motion vector precision for affine motion model based video coding
Systems and methods are described for video coding using affine motion models with adaptive precision. In an example, a block of video is encoded in a bitstream using an affine motion model, where the affine motion model is characterized by at least two motion vectors. A precision is selected for each of the motion vectors, and the selected precisions are signaled in the bitstream. In some embodiments, the precisions are signaled by including in the bitstream information that identifies one of a plurality of elements in a selected predetermined precision set. The identified element indicates the precision of each of the motion vectors that characterize the affine motion model. In some embodiments, the precision set to be used is signaled expressly in the bitstream; in other embodiments, the precision set may be inferred, e.g., from the block size, block shape or temporal layer.
Method and apparatus for point cloud coding
An apparatus for point cloud decoding includes processing circuitry. The processing circuitry receives, from a coded bitstream for a point cloud, encoded occupancy codes for nodes in an octree structure for the point cloud. The nodes in the octree structure correspond to three dimensional (3D) partitions of a space of the point cloud. Sizes of the nodes are associated with sizes of the corresponding 3D partitions. Further, the processing circuitry decodes, from the encoded occupancy codes, occupancy codes for the nodes. At least a first occupancy code for a child node of a first node is decoded without waiting for a decoding of a second occupancy code for a second node having a same node size as the first node. Then, the processing circuitry reconstructs the octree structure based on the decoded occupancy codes for the nodes, and reconstructs the point cloud based on the octree structure.
Method and apparatus for point cloud coding
An apparatus for point cloud decoding includes processing circuitry. The processing circuitry receives, from a coded bitstream for a point cloud, encoded occupancy codes for nodes in an octree structure for the point cloud. The nodes in the octree structure correspond to three dimensional (3D) partitions of a space of the point cloud. Sizes of the nodes are associated with sizes of the corresponding 3D partitions. Further, the processing circuitry decodes, from the encoded occupancy codes, occupancy codes for the nodes. At least a first occupancy code for a child node of a first node is decoded without waiting for a decoding of a second occupancy code for a second node having a same node size as the first node. Then, the processing circuitry reconstructs the octree structure based on the decoded occupancy codes for the nodes, and reconstructs the point cloud based on the octree structure.
Techniques and apparatus for generalized Trisoup geometry coding
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.
Techniques and apparatus for generalized Trisoup geometry coding
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.
Video Encoder, Video Decoder, Methods for Encoding and Decoding and Video Data Stream for Realizing Advanced Video Coding Concepts
An apparatus (200) for receiving an input video data stream according to an embodiment is provided. The input video data stream has a video encoded thereinto. The apparatus (200) is configured to generate an output video data stream from the input video data stream.