Patent classifications
H04N19/1883
FILTERING-BASED IMAGE CODING DEVICE AND METHOD
A picture may be divided into sub-pictures/slices/tiles. For example, the picture may be divided into sub-picture(s), and subpicture-related information may be used for coding. The sub-picture-related information may be generated by an encoding device and transmitted to a decoding device. According to embodiments of the present document, sub-picture-related information can be efficiently signaled.
Sampled image compression methods and image processing pipeline
A method for processing image or video data is performed in an image processing pipeline. Color filtered mosaiced raw image or video data is received. A one-level wavelet transform of subbands of the color filtered mosaiced raw image or video data to provide LL, HH, LH and HL subbands. The LH and HL subbands are de-correlated by summing and difference operations to provide decorrelated sum and difference subbands. Additional n-level wavelet transformation on the sum and difference subbands and the LL and HH subbands to provide sparsified subbands for encoding. LL and HH and sum subbands are recombined into standard color images e.g., red, green, and blue color components, which are subsequently processed by color correction, white balance, and gamma correction. The sparsified subbands are encoded.
In-loop filtering-based image coding apparatus and method
According to an embodiment of the present document, a method for increasing the accuracy of in-loop filtering is proposed. In an example, the filtering accuracy of chroma blocks can be improved on the basis of luma blocks by performing a cross component adaptive loop filtering process.
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.
Constraints for inter-layer referencing
A video coding method using inter-layer prediction or referencing is provided. A video decoder receives data from a bitstream carrying data for video pictures in a plurality of different layers. At least one of the plurality of layers comprises temporal sublayers that correspond to levels in a hierarchical temporal prediction structure. Each temporal sublayer is associated with a temporal identifier. The video decoder receives an inter-layer prediction constraint parameter constraining a maximum temporal sublayer used in inter-layer prediction. The video decoder reconstructs a first picture in a first layer by referencing data of a second picture in a second layer. A temporal identifier of the referenced data satisfies the received inter-layer prediction constraint parameter.
Low-frequency non-separable transform processing in video coding
An example video codec includes memory configured to store the video data and one or more processors implemented in circuitry and communicatively coupled to the memory. The one or more processors are configured to determine that a current mode of coding a current block of the video data is a single tree partitioning mode. Based on the current mode being the single tree partitioning mode, the one or more processors are configured to refrain from determining whether there is a non-DC coefficient for a chroma component of a transform unit (TU) for the current block and refrain from coding a low-frequency non-separable transformation (LFNST) index in response to the refraining of the determination of whether there is the non-DC coefficient. The one or more processors are configured to code the current block in the single partitioning mode with LFNST disabled.
METHOD, APPARATUS AND SYSTEM FOR ENCODING AND DECODING A CODING TREE UNIT
A method of decoding a coding unit from a coding tree unit of an image frame from a video bitstream. The method comprises determining a scan pattern for a transform block the scan pattern progressing from a current collection to a next collection of the plurality of collections after completing scanning of the current collection; decoding residual coefficients from the video bitstream according to the scan pattern; determining a multiple transform selection index for the coding unit, decoding the multiple transform selection index from the video bitstream if a last significant coefficient encountered along the scan pattern is at or within a threshold cartesian location of the transform block, and determining the multiple transform selection index to indicate that multiple transform selection is not used if the last significant residual coefficient position of the transform block along the scan pattern outside the threshold location; and transforming the decoded residual coefficients.
VIDEO PROCESSING
A method for deriving a value for a first syntax element, Syntax_A. The method comprises determining whether Syntax_A is present in a bitstream. The method comprises, as a result of determining that Syntax_A is not present in the bitstream, deriving the value for Syntax_A to be equal to a first value, B, if a first condition is satisfied, or deriving the value for Syntax_A to be equal to a second value, C, if a second condition is satisfied.
Depth codec for real-time, high-quality light field reconstruction
Techniques to facilitate compression of depth data and real-time reconstruction of high-quality light fields. A parameter space of values for a line, pairs of endpoints on different sides of the line, and a palette index for each pixel of a pixel tile of a depth image is sampled. Values for the line, the pairs of endpoints, and the palette index that minimize an error are determined and stored.
SIGNIFICANCE MAP ENCODING AND DECODING USING PARTITION SELECTION
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.