US 12,244,800 B2
Coding tree partitioning
Tangi Poirier, Cesson-Sevigne (FR); Franck Galpin, Cesson-Sevigne (FR); Fabrice Urban, Cesson-Sevigne (FR); Fabrice LeLeannec, Betton (FR); and Philippe De LaGrange, Cesson-Sevigne (FR)
Assigned to InterDigital Madison Patent Holdings, SAS, Paris (FR)
Appl. No. 17/619,440
Filed by InterDigital Madison Patent Holdings, SAS, Paris (FR)
PCT Filed Sep. 18, 2020, PCT No. PCT/EP2020/076066
§ 371(c)(1), (2) Date Dec. 15, 2021,
PCT Pub. No. WO2021/058380, PCT Pub. Date Apr. 1, 2021.
Claims priority of application No. 19306169 (EP), filed on Sep. 23, 2019; application No. 19290094 (EP), filed on Sep. 27, 2019; and application No. 19306298 (EP), filed on Oct. 7, 2019.
Prior Publication US 2022/0321883 A1, Oct. 6, 2022
Int. Cl. H04N 19/119 (2014.01); H04N 19/176 (2014.01); H04N 19/96 (2014.01)
CPC H04N 19/119 (2014.11) [H04N 19/176 (2014.11); H04N 19/96 (2014.11)] 16 Claims
OG exemplary drawing
 
1. A method, comprising:
decoding a value indicating a maximum allowed depth of a tree structure, wherein said maximum allowed depth is bounded by twice the difference of a first value and a second value, said first value indicating a size of a largest allowed coding block, and said second value indicating a minimum allowed coding block size; and
partitioning a node representing said largest allowed coding block or a partition of said largest allowed coding block, by said tree structure into coding blocks, wherein said tree structure uses a quadtree followed by at least one of horizontal binary splitting, vertical binary splitting, horizontal ternary splitting, and vertical ternary splitting.