GENERAL BLOCK PARTITIONING METHOD

• US 20170347096A1
• Filed: 05/25/2017
• Published: 11/30/2017
• Est. Priority Date: 05/25/2016
• Status: Active Grant

• Current Assignee: ARRIS Enterprises LLC (CommScope Holding Company, Inc.)
• Original Assignee: ARRIS Enterprises LLC (CommScope Holding Company, Inc.)
• Inventors: Hong, Seungwook, Panusopone, Krit, Wang, Limin, Yu, Yue
• Granted Patent: US 10,326,989 B2
• Time in Patent Office: Days
• CPC Class Codes: H04N 19/107 between spatial and temporal predictive coding, e.g. picture refresh
• CPC Class Codes: H04N 19/119 Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks
• CPC Class Codes: H04N 19/159 Prediction type, e.g. intra-frame, inter-frame or bidirectional frame prediction
• CPC Class Codes: H04N 19/172 the region being a picture, frame or field
• CPC Class Codes: H04N 19/176 the region being a block, e.g. a macroblock
• CPC Class Codes: H04N 19/46 Embedding additional information in the video signal during the compression process H04N19/517, H04N19/68, H04N19/70 take precedence
• CPC Class Codes: H04N 19/61 in combination with predictive coding
• CPC Class Codes: H04N 19/70 characterised by syntax aspects related to video coding, e.g. related to compression standards

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.

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 the syntax associated with each coding unit includes;

a first flag indicating whether a child node is partitioned;

if the flag indicates that the child node is partitioned, a second flag indicating whether to split the child node horizontally or vertically;

a third flag indicating whether the partition is symmetric or asymmetric;

if the second flag indicates a horizontal partition and the third flag indicates an asymmetric partition, a fourth flag indicating whether a left or right child coding unit is a larger coding unit in the horizontal, asymmetric split;

if the second flag indicates a vertical partition and the third flag indicates an a symmetric partition, a fifth flag indicating whether a top or bottom child coding unit is a larger coding unit in the vertical, asymmetric split;

decode the identified coding units using JVET.

2. The apparatus of claim 1, wherein a partition of a coding tree unit having dimensions 32×

32 produces in at least one of;

a square block of 32×

32,

two rectangular blocks of 32×

24 and 32×

8 with a vertical split ratio equal to 3;

1,

two rectangular blocks of 32×

16 and 32×

16 with a vertical split ratio equal to 2;

2,

two rectangular blocks of 32×

8 and 32×

24 with a vertical split ratio equal to 1;

3,

two rectangular blocks of 24×

32 and 8×

32 with a horizontal split ratio equal to 3;

1,

two rectangular blocks of 16×

32 and 16×

32 with a horizontal split ratio equal to 2;

2, and/or

two rectangular blocks of 8×

32 and 24×

32 with a horizontal split ratio equal to 1;

3.

3. The apparatus of claim 1, wherein a partition of a coding tree unit having dimensions 32×

24 produces in at least one of;

a square block of 32×

24,

two rectangular blocks of 32×

8 and 24×

24 with a horizontal split ratio equal to 1;

3,

two rectangular blocks of 32×

16 and 32×

8 with a horizontal split ratio equal to 3;

1,

two rectangular blocks of 32×

8 and 32×

16 with a horizontal split ratio equal to 1;

3,

two rectangular blocks of 24×

24 and 24×

8 with a vertical split ratio equal to 3;

1, and/or

two rectangular blocks of 16×

24 and 16×

24 with a vertical split ratio equal to 2;

2.

4. The apparatus of claim 1, wherein a partition of a coding tree unit having dimensions 24×

24 produces in at least one of;

a square block of 24×

24,

two rectangular blocks of 24×

16 and 24×

8 with a horizontal split ratio equal to 2;

1,

two rectangular blocks of 24×

8 and 24×

16 with a horizontal split ratio equal to 1;

2,

two rectangular blocks of 16×

24 and 8×

24 with a horizontal split ratio equal to 2;

1, and/or

two rectangular blocks of 8×

24 and 16×

24 with a vertical split ratio equal to 1;

2.

5. The apparatus of claim 1, wherein partition is signaled via bin assignments, where a bin represents at least one of the following:

whether a child node is split or not;

whether a child node is split horizontally or vertically;

whether a child node is split symmetrically or asymmetrically;

if asymmetrically, whether a left child unit is larger or a right child unit is larger in a binary partition.

6. The apparatus of claim 1, wherein at least four bins are assigned to each child node of the partitioning structure to define partitioning within the partitioning structure.

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 the syntax associated with each coding unit includes;

a first flag indicating whether a child node is partitioned;

if the flag indicates that the child node is partitioned, a second flag indicating whether to split the child node horizontally or vertically;

a third flag indicating whether the partition is symmetric or asymmetric;

if the second flag indicates a horizontal partition and the third flag indicates an asymmetric partition, a fourth flag indicating whether a left or right child coding unit is a larger coding unit in the horizontal, asymmetric split;

if the second flag indicates a vertical partition and the third flag indicates an a symmetric partition, a fifth flag indicating whether a top or bottom child coding unit is a larger coding unit in the vertical, asymmetric split;

decoding the identified coding units using JVET.