General block partitioning method
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 quadtree partitioning, symmetric binary partitioning, or asymmetric binary partitioning;
parse said bitstream to determine a syntax associated with each coding unit, wherein said syntax conforms to the following;
asymmetric partitioning of the coding tree unit is allowed;
if a node uses quadtree partitioning, a child of the node is partitionable via quadtree partitioning, binary partitioning, or asymmetric partitioning;
if a node uses asymmetric partitioning, no further partitions are allowed;
if a node uses binary partitioning, a child of the node is only partitionable via binary partitioningdecode the identified coding units using JVET in accordance with said syntax.
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 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.
28 Citations
7 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 quadtree partitioning, symmetric binary partitioning, or asymmetric binary partitioning; parse said bitstream to determine a syntax associated with each coding unit, wherein said syntax conforms to the following; asymmetric partitioning of the coding tree unit is allowed; if a node uses quadtree partitioning, a child of the node is partitionable via quadtree partitioning, binary partitioning, or asymmetric partitioning; if a node uses asymmetric partitioning, no further partitions are allowed; if a node uses binary partitioning, a child of the node is only partitionable via binary partitioning decode the identified coding units using JVET in accordance with said syntax. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A method of decoding a JVET bitstream, 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 quadtree partitioning, symmetric binary partitioning, or asymmetric binary partitioning; parsing said bitstream to determine a syntax associated with each coding unit, wherein said syntax conforms to the following; asymmetric partitioning of the coding tree unit is allowed; if a node uses quadtree partitioning, a child of the node is partitionable via quadtree partitioning, binary partitioning, or asymmetric partitioning; if a node uses asymmetric partitioning, no further partitions are allowed; if a node uses binary partitioning, a child of the node is only partitionable via binary partitioning decode the identified coding units using JVET in accordance with said syntax.
-
Specification