US 11,659,176 B2
JVET quadtree plus binary tree (QTBT) structure with multiple asymmetrical partitioning
Krit Panusopone, San Diego, CA (US); Seungwook Hong, San Diego, CA (US); and Limin Wang, San Diego, CA (US)
Assigned to ARRIS Enterprises LLC, Suwanee, GA (US)
Filed by ARRIS Enterprises LLC, Suwanee, GA (US)
Filed on May 11, 2021, as Appl. No. 17/317,504.
Application 17/317,504 is a continuation of application No. 16/861,055, filed on Apr. 28, 2020, granted, now 11,057,625.
Application 16/861,055 is a continuation of application No. 16/365,075, filed on Mar. 26, 2019, granted, now 10,674,148.
Application 16/365,075 is a continuation of application No. 15/605,886, filed on May 25, 2017, granted, now 10,284,845, issued on May 7, 2019.
Claims priority of provisional application 62/408,696, filed on Oct. 14, 2016.
Claims priority of provisional application 62/341,325, filed on May 25, 2016.
Prior Publication US 2021/0266545 A1, Aug. 26, 2021
This patent is subject to a terminal disclaimer.
Int. Cl. H04N 19/119 (2014.01); H04N 19/96 (2014.01); H04N 19/70 (2014.01)
CPC H04N 19/119 (2014.11) [H04N 19/70 (2014.11); H04N 19/96 (2014.11)] 4 Claims
OG exemplary drawing
 
1. A method of decoding a bitstream by a decoder, the method comprising:
(a) receiving a bitstream indicating how a coding tree unit was partitioned into coding units according to a partitioning structure that allows a node to be split with at least one of quaternary tree partitioning that splits a node in half in both horizontal and vertical directions to define child nodes that are square in shape of which are the same size, symmetric binary tree partitioning, and/or asymmetric tree partitioning;
(b) parsing said bitstream to determine if at least one of asymmetric tree partitioning and/or symmetric binary tree partitioning splits a parent node into child nodes, wherein symmetric binary tree partitioning splits a parent node into a plurality of child nodes of equal size, and asymmetric tree partitioning splits a parent node into a plurality of child nodes of unequal size;
(c) identifying each of the child nodes within each respective parent node, wherein a node can be recursively partitioned into smaller nodes;
(d) wherein the partitioning structure allows both asymmetric tree partitioning and symmetric binary tree partitioning to occur in either order during recursive partitioning;
(e) wherein the partitioning structure allows further partitioning of child nodes that are produced from asymmetric tree partitioning of at least one parent node; and
(f) decoding by the decoder the identified coding units using an intra decoding process.