TECHNICAL FIELD

The present disclosure relates to the field of video coding, particularly a block partitioning scheme for JVET that allows quadtree partitioning, symmetric binary partitioning, and asymmetric binary partitioning in a quadtree plus binary tree (QTBT) structure.

BACKGROUND

The technical improvements in evolving video coding standards illustrate the trend of increasing coding efficiency to enable higher bit-rates, higher resolutions, and better video quality. The Joint Video Exploration Team is developing a new video coding scheme referred to as JVET. Similar to other video coding schemes like HEVC (High Efficiency Video Coding), JVET is a block-based hybrid spatial and temporal predictive coding scheme. However, relative to HEVC, JVET includes many modifications to bitstream structure, syntax, constraints, and mapping for the generation of decoded pictures. JVET has been implemented in Joint Exploration Model (JEM) encoders and decoders.

SUMMARY

The present disclosure provides a method of partitioning a video coding block for JVET, the method 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.

The present disclosure also provides a method of partitioning a video coding block for JVET, the method 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, splitting a square block represented by a quadtree node with quadtree partitioning into four square blocks of equal size and representing them as quadtree nodes that can represent final coding units or be split again with quadtree partitioning, symmetric binary partitioning, or asymmetric binary partitioning, with symmetric binary partitioning into two blocks of equal size and representing them in a binary tree branching from the quadtree node as child nodes that can represent final coding units or be recursively split again with symmetric binary partitioning, or with asymmetric binary partitioning into two blocks of unequal size and representing them in a binary tree branching from the quadtree node as leaf nodes that represents final coding units and for which further splitting is disallowed, and coding the coding units represented by leaf nodes of the QTBT structure with JVET.

The present disclosure also provides a method of decoding a JVET bitstream, the method comprising receiving a bitstream indicating how a coding tree unit was partitioned into coding units according to a quadtree plus binary tree (QTBT) structure that allows quadtree nodes to be split with quadtree partitioning, symmetric binary partitioning, or asymmetric binary partitioning, identifying coding units represented by leaf nodes of the QTBT structure, wherein an indication that a node was split from a quadtree leaf node using asymmetric binary partitioning directly indicates that the node represents a final coding unit to be decoded, and decoding the identified coding units using JVET.

