H04N19/169

SIGNIFICANCE MAP ENCODING AND DECODING USING PARTITION SELECTION
20180014030 · 2018-01-11 · ·

Methods of encoding and decoding for video data are describe in which significance maps are encoded and decoded using non-spatially-uniform partitioning of the map into parts, wherein the bit positions within each part are associated with a given context. Example partition sets and processes for selecting from amongst predetermined partition sets and communicating the selection to the decoder are described.

ENCODING, DECODING, AND REPRESENTING HIGH DYNAMIC RANGE IMAGES

Techniques are provided to encode and decode image data comprising a tone mapped (TM) image with HDR reconstruction data in the form of luminance ratios and color residual values. In an example embodiment, luminance ratio values and residual values in color channels of a color space are generated on an individual pixel basis based on a high dynamic range (HDR) image and a derivative tone-mapped (TM) image that comprises one or more color alterations that would not be recoverable from the TM image with a luminance ratio image. The TM image with HDR reconstruction data derived from the luminance ratio values and the color-channel residual values may be outputted in an image file to a downstream device, for example, for decoding, rendering, and/or storing. The image file may be decoded to generate a restored HDR image free of the color alterations.

SYNTAX STRUCTURES INDICATING COMPLETION OF CODED REGIONS

Syntax structures that indicate the completion of coded regions of pictures are described. For example, a syntax structure in an elementary bitstream indicates the completion of a coded region of a picture. The syntax structure can be a type of network abstraction layer unit, a type of supplemental enhancement information message or another syntax structure. For example, a media processing tool such as an encoder can detect completion of a coded region of a picture, then output, in a predefined order in an elementary bitstream, syntax structure(s) that contain the coded region as well as a different syntax structure that indicates the completion of the coded region. Another media processing tool such as a decoder can receive, in a predefined order in an elementary bitstream, syntax structure(s) that contain a coded region of a picture as well as a different syntax structure that indicates the completion of the coded region.

ENCODING METHOD AND APPARATUS, AND DECODING METHOD AND APPARATUS

An encoding apparatus for encoding an image includes: a communicator configured to receive, from a device, device information related to the device; and a processor configured to encode the image by using image information of the image and the device information, wherein the processor is further configured to process the image according to at least one of the device information and the image information, determine a non-encoding region, a block-based encoding region, and a pixel-based encoding region of the image according to at least one of the device information and the image information, performs block-based encoding on the block-based encoding region by using a quantization parameter determined according to at least one of the device information and the image information, perform pixel-based encoding on the pixel-based encoding region, generates an encoded image by entropy encoding a symbol determined by the block-based encoding or the pixel-based encoding, and generate a bitstream comprising the encoded image, region information of the block-based encoding region and the pixel-based encoding region, and quantization information of the quantization parameter, and wherein the communicator is further configured to transmit the bitstream to the device.

Use and signaling of refining video coding tools

An example method of video processing includes performing a conversion between a video picture of a video and a bitstream representation of the video. The bitstream representation conforms to a format rule. The format rule specifies that applicability of a Decoder-side Motion Vector Refinement coding tool and a Bi-Directional Optical Flow coding tool for the video picture are indicated separately in the bitstream representation.

Predictive tree coding for point cloud coding
11710259 · 2023-07-25 · ·

A method and device for decoding a point cloud using octree partitioning and a predictive tree include obtaining the point cloud. A bounding box of the point cloud is determined. Octree nodes are generated by partitioning the bounding box using octree partitioning. The predictive tree is generated for points in at least one octree node of the octree nodes. A transform is applied to the predictive tree. The points in the at least one octree node are decoded using the predictive tree.

Decoding capability information storage in video coding
11711518 · 2023-07-25 · ·

Systems, methods and apparatus for encoding or decoding a file format that stores one or more images are described. One example method includes performing a conversion between a visual media file and a bitstream of a visual media data according to a format rule, where the format rule specifies that a type of a sample entry determines whether decoding capability information network abstraction layer units are included in either the sample entry of a video track in the visual media file or in a sample of the video track and the sample entry of the video track in the visual media file.

Arithmetic coding information for parallel octree coding
11711545 · 2023-07-25 · ·

Aspects of the disclosure include a method for point cloud coding. In the method, whether decoding of occupancy codes of nodes in a range of octree partition depths in an octree partitioning structure of a point cloud reaches a minimum octree partition depth at which parallel decoding is enabled is determined. Arithmetic coding information for decoding the occupancy codes of the nodes in the minimum octree partition depth is stored based on the decoding of the occupancy codes of the nodes in the range of octree partition depths reaching the minimum octree partition depth. The parallel decoding is performed on occupancy codes of the nodes in each of the at least one remaining octree partitions depth based on the stored arithmetic coding information. The point cloud is reconstructed based on the occupancy codes of the nodes in the range of octree partition depths in the octree partitioning structure.

Constrained Coding Tree for Video Coding
20230239518 · 2023-07-27 ·

A video coding mechanism is disclosed. The mechanism includes partitioning an image to create at least one coding tree unit (CTU) with at least one coding tree node. The mechanism further includes determining that the coding tree node height is twice a maximum transform unit (TU) height and the coding tree node width is twice a maximum TU width. The mechanism further includes selecting a split mode for the coding tree node based on the determination. The split mode is selected from a quad-tree split, a horizontal binary-tree split, and no split. The mechanism further includes applying the split mode to the coding tree node to create one or more coding units (CUs). The mechanism further includes encoding the CUs into a bitstream. The mechanism further includes transmitting the bitstream toward a decoder.

TECHNIQUES FOR IMPLEMENTING A DECODING ORDER WITHIN A CODED PICTURE
20230239483 · 2023-07-27 ·

A method for video processing is described. The method includes performing a conversion between a video including one or more pictures including one or more subpictures including one or more slices and a bitstream representation of the video according to a rule, and wherein the bitstream representation includes a number of coded units, wherein the rule specifies that a decoding order of coded units within a subpicture is in an increasing order of subpicture level slice index values of the coded units.