The disclosure proposes a decoder for decoding coefficients of blocks of a video sequence from a bitstream. The decoder comprises a scan pattern list module for providing one or more pre-defined scan orders, a scan order generator for generating one or more scan orders, a scan order selector for selecting a scan order for each block from the pre-defined and generated scan orders on the basis of scan order information contained in the bitstream, a decoding module for decoding one or more coefficient vectors of each block from the bitstream, a deserializer for inverse scanning, for each block, the one or more coefficient vectors of that block according to the scan order selected for that block so as to obtain a coefficient matrix. The scan order generator generates the one or more scan orders depending on one or more previously obtained coefficient matrices of blocks of the video sequence.

Methods and apparatus are provided for encoding and decoding binary sets using adaptive tree selection. In one exemplary encoding method embodiment, picture data is encoded for a block in a picture; in which one of a plurality of trees structures is selected to code a binary set of data for indicating coefficient significance for the block. In another exemplary encoding method embodiment, picture data is encoded for a block in a picture, in which one or more trees are used to encode a binary set of data for indicating coefficient significance for the block, the one or more trees each having a plurality of nodes, at least one of the nodes of the one or more trees being modified responsive to at least one parameter.

Disclosed herein are a QTBT split structure allowing blocks of various shapes capable of more efficiently reflecting various local characteristics of video and a method of efficiently signaling the split structure.

Methods for decoding of a video bitstream by a video decoding circuit are provided. In one implementation, a method receives coded data for a 2N×2N coding unit (CU) from the video bitstream, selects one or more first codewords according to whether asymmetric motion partition is disabled or enabled when a size of said 2N×2N CU is not equal to a smallest CU size, wherein none of the first codewords corresponds to INTER N×N partition, selects one or more second codewords when the size of said 2N×2N CU is equal to the smallest CU size, wherein none of the second codewords corresponds to the INTER N×N partition when N is 4, determines a CU structure for said 2N×2N CU from the video bitstream using said one or more first codewords or said one or more second codewords, and decodes the video bitstream using the CU structure.

An image decoding method performed by a decoding apparatus according to the present disclosure includes receiving a bitstream including residual information; deriving quantized transform coefficients for a current block based on the residual information included in the bitstream; deriving residual samples for the current block based on the quantized transform coefficients; and generating a reconstructed picture based on the residual samples for the current block.

An apparatus for decoding a sequence of pictures from a data stream is configured for decoding a picture of the sequence by deriving a residual transform signal of the picture from the data stream; combining a residual transform signal with a buffered transform signal approximation of a previous picture of the sequence so as to obtain a transform signal representing the picture, the transform signal comprising a plurality of transform coefficients; and subjecting the transform signal to a spectral-to-spatial transformation. The apparatus is configured for deriving the buffered transform signal approximation from a further transform signal representing the previous picture so that the buffered transform signal approximation comprises approximations of further transform coefficients of the further transform signal.

A method of partitioning a coding unit (CU) into one or more transform units (TUs) for encoding a video sequence using at least one processor includes determining a height of the CU; determining a width of the CU; determining a TU size of each of the one or more TUs based on the height of the CU and the width of the CU; determining one or more TU positions of the one or more TUs based on the height of the CU and the width of the CU; and partitioning the CU into the one or more TUs based on the determined size of the one or more TUs and the one or more positions of the one or more TUs.

A method of partitioning a video coding block for JVET, comprising representing a JVET coding tree unit as a root node in a quadtree plus binary tree (QTBT) structure that can have a quadtree branching from the root node and binary trees branching from each of the quadtree's leaf nodes using asymmetric binary partitioning to split a coding unit represented by a quadtree leaf node into two child coding units of unequal size, representing the two child coding units as leaf nodes in a binary tree branching from the quadtree leaf node and coding the child coding units represented by leaf nodes of the binary tree with JVET, wherein further partitioning of child coding units split from quadtree leaf nodes via asymmetric binary partitioning is disallowed.

Disclosed herein are a QTBT split structure allowing blocks of various shapes capable of more efficiently reflecting various local characteristics of video and a method of efficiently signaling the split structure.

Methods for management of encoding complexity for image and video encoding, for example for algorithms belonging to the JPEG 2000 family of standards, where the encoding process targets a given compressed size (i.e. a total coded length) for the image or for each frame of a video sequence. Described are a set of methods for complexity constrained encoding of HTJ2K code-streams, involving collection of local or global statistics for each sub-band (not for each code-block), generation of forecasts for the statistics of sub-band samples that have not yet been produced by spatial transformation and quantization processes, and the use of this information to generate a global quantization parameter, from which the coarsest bit-plane to generate in each code-block can be deduced. Coded length estimates can be generated in a manner that enables latency and memory to be separately optimized against encoded image quality, while maintaining low computational complexity.