JVET quadtree plus binary tree (QTBT) structure with multiple asymmetrical partitioning
First Claim
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 split with at least one of quadtree partitioning, symmetric binary partitioning, and/or asymmetric binary partitioning;
parse said bitstream to determine if at least one of asymmetric binary partitioning and/or symmetric binary partitioning splits a parent node into child nodes, wherein symmetric binary partitioning splits a parent node in to child nodes of equal size, and asymmetric binary 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 the partitioning structure allows both asymmetric binary partitioning and symmetric binary partitioning to occur in either order during recursive partitioning of a parent node, andwherein the partitioning structure allows further partitioning of child nodes that are produced from asymmetric binary partitioning of at least one parent node;
decode the identified coding units using JVET.
5 Assignments
0 Petitions
Accused Products
Abstract
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 node represented by a leaf node into two child nodes of unequal size, representing the two 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 is allowed recursively along the same branch in any order with symmetric partitioning.
7 Citations
11 Claims
-
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 split with at least one of quadtree partitioning, symmetric binary partitioning, and/or asymmetric binary partitioning; parse said bitstream to determine if at least one of asymmetric binary partitioning and/or symmetric binary partitioning splits a parent node into child nodes, wherein symmetric binary partitioning splits a parent node in to child nodes of equal size, and asymmetric binary 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 the partitioning structure allows both asymmetric binary partitioning and symmetric binary partitioning to occur in either order during recursive partitioning of a parent node, and wherein the partitioning structure allows further partitioning of child nodes that are produced from asymmetric binary partitioning of at least one parent node; decode the identified coding units using JVET. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
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 split with at least one of quadtree partitioning, symmetric binary partitioning, and/or asymmetric binary partitioning; parsing said bitstream to determine if at least one of asymmetric binary partitioning and/or symmetric binary partitioning splits a parent node into child nodes, wherein symmetric binary partitioning splits a parent node in to child nodes of equal size, and asymmetric binary 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 the partitioning structure allows both asymmetric binary partitioning and symmetric binary partitioning to occur in either order during recursive partitioning of a parent node, and wherein the partitioning structure allows further partitioning of child nodes that are produced from asymmetric binary partitioning of at least one parent node; and decoding the identified coding units using JVET.
-
Specification