JVET coding block structure with asymmetrical partitioning
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.
1. A method of decoding a bitstream by a decoder, comprising:
(a) receiving said bitstream indicating how a coding tree unit was partitioned into coding units according to a quad tree plus multi tree structure that allows a square parent node to be split with a quaternary tree partitioning that splits said square parent node in half in both horizontal and vertical directions to define leaf nodes that are square in shape each of which are the same size, wherein said quad tree plus multi tree structure allows one of said leaf nodes to be split based upon one selected from a group consisting of,
(i) a symmetric binary tree partitioning that splits one of said leaf nodes of said quaternary tree partitioning in half in either a horizontal direction or a vertical direction resulting in two blocks that are the same size as leaf nodes, and
(ii) an asymmetric tree partitioning that splits one of said leaf nodes of said quaternary tree partitioning in either a horizontal direction or a vertical direction resulting in a plurality of blocks that are different sizes as leaf nodes;
(b) wherein said leaf nodes as a result of said symmetric binary tree partitioning are allowed to be further partitioned by either or said symmetric binary tree partitioning and said asymmetric tree partitioning;
(c) wherein said leaf nodes as a result of said asymmetric tree partitioning are allowed to be further partitioned by either or said symmetric binary tree partitioning and said asymmetric tree partitioning;
(d) identifying final coding units to be decoded represented by leaf nodes of the quad tree plus multi tree structure; and
(e) decoding the identified final coding units using an intra decoding process.