BINARY TERNARY QUAD TREE PARTITIONING FOR JVET
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, ternary, or binary partitioning of the root node and quadtree, ternary, 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 or three child nodes of unequal size, representing the child nodes as leaf nodes in a binary tree branching from the parent leaf node and coding the child nodes represented by final leaf nodes of the binary tree with JVET, wherein further partitioning of child nodes split from leaf nodes via asymmetric binary partitioning may be restricted depending on the partitioning type of the parent node.
1 . An apparatus for coding video data comprising one or more processors configured to:
receive a bitstream indicating how a coding tree unit was partitioned into coding units according to a partitioning structure that allows root nodes to be partitioned with at least one of quadtree partitioning, binary partitioning, and/or ternary partitioning;
parse said bitstream to determine how the coding tree unit was partitioned using the quadtree partitioning, binary partitioning, and/or ternary partitioning;
parse said bitstream to determine a symmetry of said partitioning, to determine if at least one of asymmetric partitioning and/or symmetric partitioning was used to partition a parent coding unit into child nodes, wherein symmetric partitioning splits a parent node in to child nodes of equal size, and asymmetric partitioning splits a parent node in to child nodes of unequal size;
identify each of the child nodes within each respective parent unit, wherein a node can be recursively partitioned in to smaller nodes,
wherein both ternary and binary partitioning are allowed in the partitioning structure in either order during a recursive partitioning of a root node or parent node; and
decode the identified coding units using JVET.
2 . The apparatus of claim 1 , wherein the ternary partitioning partitions a parent node into three child nodes of unequal sizes in an asymmetric manner.
3 . The apparatus of claim 1 , wherein the ternary partitioning partitions a parent node into three child nodes, where two of the child nodes are equal size and of a different size than a third node.
4 . The apparatus of claim 1 , wherein a child node resulting from ternary partitioning is a binary node.
5 . The apparatus of claim 1 , wherein if a parent node is partitioned using quadtree partitioning, child nodes produced from the partition are square nodes and further partitioning of the square nodes is allowed using at least one of quadtree partitioning, binary partitioning, ternary partitioning, and/or asymmetric partitioning.
6 . The apparatus of claim 1 , wherein if a parent node is partitioned using asymmetric partitioning, child nodes produced from the partition include a binary node and a restricted node.
7 . The apparatus of claim 6 , wherein the binary child node can use at least one of binary partitioning, ternary partitioning, and/or asymmetric partitioning.
8 . The apparatus of claim 6 , where in if a parent node uses binary partitioning, ternary partitioning, or asymmetric partitioning, child nodes produces from the partition are binary nodes and further partition of the binary nodes are allowed using at least one of binary partitioning, ternary partitioning, and/or asymmetric partitioning.
9 . The apparatus of claim 6 , wherein further partitioning of the restricted node is disallowed.
10 . The apparatus of claim 6 , wherein the further partition of the restricted node is limited to only ternary partitioning.
10 . The apparatus of claim 6 , wherein the further partition of the restricted node is limited to at least one of binary partitioning, ternary partitioning, and/or asymmetric partitioning.
11 . 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 partitioning structure that allows root nodes to be partitioned with at least one of quadtree partitioning, binary partitioning, and/or ternary partitioning;
parsing said bitstream to determine how the coding tree unit was partitioned using the quadtree partitioning, binary partitioning, and/or ternary partitioning;
parsing said bitstream to determine a symmetry of said partitioning, to determine if at least one of asymmetric partitioning and/or symmetric partitioning was used to partition a parent coding unit into child nodes, wherein symmetric partitioning splits a parent node in to child nodes of equal size, and asymmetric partitioning splits a parent node in to child nodes of unequal size;
identifying each of the child nodes within each respective parent unit, wherein a node can be recursively partitioned in to smaller nodes,
wherein both ternary and binary partitioning are allowed in the partitioning structure in either order during a recursive partitioning of a root node or parent node; and
decoding the identified coding units using JVET.
12 . A method of multiple partitioning of a video coding block for JVET, the method comprising:
representing a JVET coding tree unit as a root node in a binary, ternary, and quadtree (BTQT) structure having a quadtree branching from the root node and any of quadtree, binary or ternary trees branching from each of the quadtree's leaf nodes;
using asymmetric partitioning to split a child node represented by a quadtree leaf node into child nodes of unequal size;
using symmetric partitioning to split a child node represented by a quadtree leaf node into child nodes of equal size,
wherein the asymmetric partitioning and the symmetric partitioning occur in any order and within the same BTQT structure; and
representing the child nodes as leaf nodes in each quadtree, binary, and/or or ternary tree branching from the quadtree leaf node.