# US 2025/0168340 A1 · Coding tree partitioning > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2025/0168340 A1 - Document ID: US20250168340A1 - Status: Published application - Kind: A1 - Application number: 19/028,534 - Filed: 2025-01-17 - Published: 2025-05-22 - Earliest claimed: 2019-09-23 - Assignees: InterDigital Madison Patent Holdings, SAS - Applicants: InterDigital Madison Patent Holdings, SAS - Inventors: Tangi POIRIER; Franck GALPIN; Fabrice URBAN; Fabrice LELEANNEC; Philippe DE LAGRANGE - Web page: https://patentgrep.com/patent/US20250168340A1 ## CPC - H04N 19/119: Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks - H04N 19/147: according to rate distortion criteria (rate-distortion as a criterion for motion estimation H04N19/567) - H04N 19/159: Prediction type, e.g. intra-frame, inter-frame or bidirectional frame prediction - H04N 19/176: the region being a block, e.g. a macroblock - H04N 19/186: the unit being a colour or a chrominance component - H04N 19/70: characterised by syntax aspects related to video coding, e.g. related to compression standards - H04N 19/96: Tree coding, e.g. quad-tree coding - H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION ## Abstract 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. ## Claims ### Claim 1 A method for coding tree partitioning in video encoding, comprising: partitioning a largest allowed coding block into coding blocks; and encoding a first value indicating a minimum allowed coding block size, wherein an upper bound of said minimum allowed coding block size depends on a smaller value of a second value and a size of said largest allowed coding block. ### Claim 2 (depends on 1) The method of claim 1, wherein said first value is also indicative of a size of a virtual pipeline decoding unit (VPDU). ### Claim 3 (depends on 2) The method of claim 2, wherein said first value is equal to said size of said virtual pipeline decoding unit (VPDU). ### Claim 4 (depends on 1) The method of claim 1, wherein said largest allowed coding block corresponds to a coding tree block. ### Claim 5 (depends on 1) The method of claim 1, wherein said second value is 64. ### Claim 6 A method for coding tree partitioning in video decoding, comprising: partitioning a largest allowed coding block into coding blocks; and decoding a first value indicating a minimum allowed coding block size, wherein an upper bound of said minimum allowed coding block size depends on a smaller value of a second value and a size of said largest allowed coding block. ### Claim 7 (depends on 6) The method of claim 6, wherein said first value is also indicative of a size of a virtual pipeline decoding unit (VPDU). ### Claim 8 (depends on 7) The method of claim 7, wherein said first value is equal to said size of said virtual pipeline decoding unit (VPDU). ### Claim 9 (depends on 6) The method of claim 6, wherein said largest allowed coding block corresponds to a coding tree block. ### Claim 10 (depends on 6) The method of claim 6, wherein said second value is 64. ### Claim 11 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: partition a largest allowed coding block into coding blocks; and encode a first value indicating a minimum allowed coding block size, wherein an upper bound of said minimum allowed coding block size depends on a smaller value of a second value and a size of said largest allowed coding block. ### Claim 12 (depends on 11) The apparatus of claim 11, wherein said first value is also indicative of a size of a virtual pipeline decoding unit (VPDU). ### Claim 13 (depends on 12) The apparatus of claim 12, wherein said first value is equal to said size of said virtual pipeline decoding unit (VPDU). ### Claim 14 (depends on 11) The apparatus of claim 11, wherein said largest allowed coding block corresponds to a coding tree block. ### Claim 15 (depends on 11) The apparatus of claim 11, wherein said second value is 64. ### Claim 16 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: partition a largest allowed coding block into coding blocks; and decode a first value indicating a minimum allowed coding block size, wherein an upper bound of said minimum allowed coding block size depends on a smaller value of a second value and a size of said largest allowed coding block. ### Claim 17 (depends on 16) The apparatus of claim 16, wherein said first value is also indicative of a size of a virtual pipeline decoding unit (VPDU). ### Claim 18 (depends on 17) The apparatus of claim 17, wherein said first value is equal to said size of said virtual pipeline decoding unit (VPDU). ### Claim 19 (depends on 16) The apparatus of claim 16, wherein said largest allowed coding block corresponds to a coding tree block. ### Claim 20 (depends on 16) The apparatus of claim 16, wherein said second value is 64.