General block partitioning method
A method of partitioning in video coding for JVET, comprising representing a JVET coding tree unit as a root node in a quadtree plus binary tree (QTBT structure that can have quadtree or binary partitioning of the root node and quadtree or binary trees branching from each of the leaf nodes. The partitioning at any depth can use asymmetric binary partitioning to split a child node represented by a 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 parent leaf node and coding the child coding units represented by final leaf nodes of the binary tree with JVET. Disclosed is a generalized method of partitioning a block, either square or rectangular, which leads to more flexible block sizes with possible higher coding efficiency.
1. A method for decoding a bitstream using one or more processors, the method comprising:
(a) receiving said bitstream indicating how a coding tree unit is partitioned into final coding units according to a partitioning structure where a square parent block is split with quadtree partitioning that splits said square parent node in half in both horizontal and vertical directions to define four blocks as leaf nodes that are square in shape each of which are the same size, where a first square leaf node as a result of said quadtree partitioning is split with symmetric binary partitioning that splits said first square leaf node in half in either a horizontal direction or a vertical direction resulting in two rectangular blocks that are the same size as leaf nodes where one of said rectangular leaf nodes of said symmetric binary partitioning is further split with symmetric binary partitioning resulting in two blocks that are the same size as leaf nodes, and where a second square leaf node as a result of said quadtree partitioning is split with asymmetric partitioning that splits said second square leaf node in either a horizontal direction or a vertical direction resulting in a plurality of blocks that are different sizes as leaf nodes where one of said leaf nodes of said asymmetric partitioning is further split with asymmetric partitioning resulting in a plurality of blocks that are different sizes as leaf nodes, where a third square leaf node as a result of said quadtree partitioning is split with symmetric binary partitioning that splits said third square leaf node in half in either a horizontal direction or a vertical direction resulting in two blocks that are the same size as leaf nodes where one of said leaf nodes of said symmetric binary partitioning is further split with asymmetric partitioning resulting in a plurality of blocks that are different sizes as leaf nodes, where a fourth square leaf node as a result of said quadtree partitioning is split with asymmetric partitioning that splits said fourth square leaf node resulting in a plurality of blocks that are different sizes as leaf nodes where one of said leaf nodes of said asymmetric partitioning is further split in half in either a horizontal direction or a vertical direction resulting in two blocks that are the same size as leaf nodes, defining final coding units of said coding tree unit where at least one of said final coding units is square in shape and at least one of said final coding units is rectangular in shape;
(b) parse said bitstream that includes each final coding unit, wherein said bitstream conforms to the following:
recursive asymmetric partitioning of the blocks of the coding tree unit is allowed;
recursive symmetric binary partitioning of the blocks of the coding tree unit is allowed;
a leaf node of said square parent block partitioned by said quadtree partitioning is partitionable via, any one of, selected from a group including quadtree partitioning, symmetric binary partitioning, and asymmetric partitioning;
at least one leaf node partitioned using asymmetric partitioning is not permitted to be further partitioned;
at least one leaf node partitioned using symmetric binary partitioning is not permitted to be further partitioned;
(c) identifying said final coding units to be decoded;
(d) decoding the identified final coding units in accordance with an intra decoding process.
2. A method for encoding a bitstream using one or more processors, the method comprising:
(a) providing said bitstream indicating how a coding tree unit is partitioned into final coding units according to a partitioning structure where a square parent block is split with quadtree partitioning that splits said square parent node in half in both horizontal and vertical directions to define four blocks as leaf nodes that are square in shape each of which are the same size, where a first square leaf node as a result of said quadtree partitioning is split with symmetric binary partitioning that splits said first square leaf node in half in either a horizontal direction or a vertical direction resulting in two rectangular blocks that are the same size as leaf nodes where one of said rectangular leaf nodes of said symmetric binary partitioning is further split with symmetric binary partitioning resulting in two blocks that are the same size as leaf nodes, and where a second square leaf node as a result of said quadtree partitioning is split with asymmetric partitioning that splits said second square leaf node in either a horizontal direction or a vertical direction resulting in a plurality of blocks that are different sizes as leaf nodes where one of said leaf nodes of said asymmetric partitioning is further split with asymmetric partitioning resulting in a plurality of blocks that are different sizes as leaf nodes, where a third square leaf node as a result of said quadtree partitioning is split with symmetric binary partitioning that splits said third square leaf node in half in either a horizontal direction or a vertical direction resulting in two blocks that are the same size as leaf nodes where one of said leaf nodes of said symmetric binary partitioning is further split with asymmetric partitioning resulting in a plurality of blocks that are different sizes as leaf nodes, where a fourth square leaf node as a result of said quadtree partitioning is split with asymmetric partitioning that splits said fourth square leaf node resulting in a plurality of blocks that are different sizes as leaf nodes where one of said leaf nodes of said asymmetric partitioning is further split in half in either a horizontal direction or a vertical direction resulting in two blocks that are the same size as leaf nodes, defining final coding units of said coding tree unit where at least one of said final coding units is square in shape and at least one of said final coding units is rectangular in shape;
(b) wherein said bitstream is configured to includes each final coding unit, wherein said bitstream conforms to the following:
recursive asymmetric partitioning of the blocks of the coding tree unit is allowed;
recursive symmetric binary partitioning of the blocks of the coding tree unit is allowed;
a leaf node of said square parent block partitioned by said quadtree partitioning is partitionable via, any one of, selected from a group including quadtree partitioning, symmetric binary partitioning, and asymmetric partitioning;
at least one leaf node partitioned using asymmetric partitioning is not permitted to be further partitioned;
at least one leaf node partitioned using symmetric binary partitioning is not permitted to be further partitioned;
(c) identifying said final coding units to be encoded;
(d) encoding the identified final coding units in accordance with an intra encoding process.