Coding tree partitioning
AssigneeInterDigital Madison Patent Holdings, SAS
InventorsTangi POIRIER, Franck GALPIN, Fabrice URBAN, Fabrice LELEANNEC, Philippe DE LAGRANGE
Life of this patent
Estimating the term…
Loading patent…
AssigneeInterDigital Madison Patent Holdings, SAS
InventorsTangi POIRIER, Franck GALPIN, Fabrice URBAN, Fabrice LELEANNEC, Philippe DE LAGRANGE
Estimating the term…
To encode a picture, a coding tree unit (CTU) in the picture is partitioned by a quadtree structure, and the quadtree leaf nodes can be further partitioned by a multi-type tree (MTT) structure. To increase the set of reachable coding tree nodes and leaves, we propose to increase the maximum allowed MTT hierarchy depth to be twice the difference between the CTU size and the minimum allowed size for a CU. The maximum allowed MTT hierarchy depth can be specified for all QT levels in order to provide more flexibility in the split tree. Alternatively, only two levels of maximum allowed MTT depth are signaled: one when QT splits are allowed, and another one when no more QT splits are allowed. In addition, an upper bound can be set for the minimum 10 allowed coding block size, based on the coding tree unit size or the maximum allowed transform size.
A method for coding tree partitioning in video encoding, comprising:
A method for coding tree partitioning in video decoding, comprising:
An apparatus for coding tree partitioning in video encoding, comprising at least a memory and one or more processors, wherein said one or more processors are configured to:
An apparatus for coding tree partitioning in video decoding, comprising at least a memory and one or more processors, wherein said one or more processors are configured to:
Dependencies are inferred from the claim text.