# US 11,445,224 B2 · Shape of EQT subblock > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 11,445,224 B2 - Document ID: US11445224B2 - Status: Granted - Kind: B2 - Application number: 17/110,009 - Filed: 2020-12-02 - Published: 2021-03-25 - Granted: 2022-09-13 - Earliest claimed: 2018-06-05 - Assignees: Beijing Bytedance Network Technology Co., Ltd.; Bytedance Inc. - Applicants: Beijing Bytedance Network Technology Co., Ltd.; Bytedance Inc. - Inventors: Li Zhang; Kai Zhang; Hongbin Liu; Hsiao Chiang Chuang; Yue Wang - Web page: https://patentgrep.com/patent/US11445224B2 ## CPC - H04N 19/96: Tree coding, e.g. quad-tree coding - H04N 19/119: Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks - H04N 19/176: the region being a block, e.g. a macroblock - H04N 19/184: the unit being bits, e.g. of the compressed video stream - H04N 19/186: the unit being a colour or a chrominance component - H04N 19/1883: {the unit relating to sub-band structure, e.g. hierarchical level, directional tree, e.g. low-high [LH], high-low [HL], high-high [HH]} - H04N 19/189: characterised by the adaptation method, adaptation tool or adaptation type used for the adaptive coding - H04N 19/70: characterised by syntax aspects related to video coding, e.g. related to compression standards - H04N 19/46: Embedding additional information in the video signal during the compression process (H04N19/517, H04N19/68, H04N19/70 take precedence) - H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION ## Abstract Methods, systems and devices for using flexible and efficient partitioning techniques, and in particular, sub-block shapes in extended quadtree partitioning, are described. An exemplary method for visual media decoding includes applying, to a current visual media block, a partitioning process that splits the current visual media block into exactly four sub-blocks including at least one sub-block that has a size different from half of a width of the current visual media block times half of a height of the current visual media block, where a size of the current visual media block is M×N, and the size of the at least one sub-block is based on a minimum value between M and N, or a maximum value between M and N; decoding, based on a bitstream representation, the four sub-blocks; and decoding, based on the four sub-blocks and the partitioning process, the current visual media block. ## Claims ### Claim 1 A method of visual media processing, comprising: applying, during a conversion between a current visual media block and a bitstream representation of the current visual media block, to the current visual media block, a partitioning process that splits the current visual media block into exactly four sub-blocks including at least one sub-block that has a size different from that of another sub-block, wherein a size of the current visual media block is M×N, wherein M and N are positive integers that are powers of 2, and wherein M is unequal to N; and performing the conversion based on the four sub-blocks and the partitioning process, wherein, in a case that the partitioning process is allowed for a depth/level, an indication of the usage of a corresponding partition structure is signaled. ### Claim 2 (depends on 1) The method of claim 1, wherein sizes of the four sub-blocks are Mi×N, wherein i=1, 2, 3, 4, and wherein M1+M2+M3+M4=M. ### Claim 3 (depends on 1) The method of claim 1, wherein sizes of the four sub-blocks are M×Ni, wherein i=1, 2, 3, 4, and wherein N1+N2+N3+N4=N. ### Claim 4 (depends on 2) The method of claim 2, wherein M1, M2, M3 and M4 are different from each other. ### Claim 5 (depends on 3) The method of claim 3, wherein N1, N2, N3 and N4 are different from each other. ### Claim 6 (depends on 1) The method of claim 1, wherein a first size of a first sub-block and a second sub-block of the four sub-blocks is (M*w0/w)×(N*h0/h), and wherein a second size of a third sub-block and a fourth sub-block of the four blocks is (M*(w-w0)/w)×(N*(h-h0)/h), wherein w, h, w0 and h0 are positive integers, and wherein w0≤w and h0≤h. ### Claim 7 (depends on 6) The method of claim 6, wherein w0=1, w=2, h0=1 and h=4. ### Claim 8 (depends on 6) The method of claim 6, wherein h0=1, h=2, w0=1 and w=4. ### Claim 9 (depends on 1) The method of claim 1, wherein a height (H) and a width (W) of the current visual media block are integers, and wherein the four sub-blocks have dimensions H/4×W, H/2×W/2, H/2×W/2 and H/4×W. ### Claim 10 (depends on 9) The method of claim 9, wherein a top-left coordinate of the current visual media block is denoted (x, y), and wherein the four sub-blocks have top-left coordinates and dimensions given as: (i) top-left coordinate (x, y) with dimensions H/4×W; (ii) top-left coordinate (x, y+H/4) with dimensions H/2×W/2; (iii) top-left coordinate (x+W/2, y+H/4) with dimensions H/2×W/2; and (iv) top-left coordinate (x, y+3×H/4) with dimensions H/4×W. ### Claim 11 (depends on 1) The method of claim 1, wherein a height (H) and a width (W) of the current visual media block are integers, and wherein the four sub-blocks have dimensions H×W/4, H/2×W/2, H/2×W/2 and H×W/4. ### Claim 12 (depends on 11) The method of claim 11, wherein a top-left coordinate of the current visual media block is denoted (x, y), and wherein the four sub-blocks have top-left coordinates and dimensions given as: (i) top-left coordinate (x, y) with dimensions H×W/4; (ii) top-left coordinate (x+W/4, y) with dimensions H/2×W/2; (iii) top-left coordinate (x+W/4, y+H/2) with dimensions H/2×W/2; and (iv) top-left coordinate (x+3×W/4, y) with dimensions H×W/4. ### Claim 13 (depends on 1) The method of claim 1, wherein the current visual media block comprises a video block. ### Claim 14 An apparatus in a video system comprising a processor and a non-transitory memory with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to: apply, during a conversion between a current visual media block and a bitstream representation of the current visual media block, to the current visual media block, a partitioning process that splits the current visual media block into exactly four sub-blocks including at least one sub-block that has a size different from that of another sub-block, wherein a size of the current visual media block is M×N, wherein M and N are positive integers that are powers of 2, and wherein M is unequal to N; and perform the conversion based on the four sub-blocks and the partitioning process, wherein, in a case that the partitioning process is allowed for a depth/level, an indication of the usage of a corresponding partition structure is signaled. ### Claim 15 (depends on 14) The apparatus of claim 14, wherein sizes of the four sub-blocks are Mi×N, wherein i=1, 2, 3, 4, and wherein M1+M2+M3+M4=M. ### Claim 16 (depends on 14) The apparatus of claim 14, wherein sizes of the four sub-blocks are M×Ni, wherein i32 1, 2, 3, 4, and wherein N1+N2+N3+N4=N. ### Claim 17 (depends on 15) The apparatus of claim 15, wherein M1, M2, M3 and M4 are different from each other. ### Claim 18 (depends on 16) The apparatus of claim 16, wherein N1, N2, N3 and N4 are different from each other. ### Claim 19 A non-transitory computer readable media storing instructions that cause a processor to: apply, during a conversion between a current visual media block and a bitstream representation of the current visual media block, to the current visual media block, a partitioning process that splits the current visual media block into exactly four sub-blocks including at least one sub-block that has a size different from that of another sub-block, wherein a size of the current visual media block is M×N, wherein M and N are positive integers that are powers of 2, and wherein M is unequal to N; and perform the conversion based on the four sub-blocks and the partitioning process, wherein, in a case that the partitioning process is allowed for a depth/level, an indication of the usage of a corresponding partition structure is signaled. ### Claim 20 A non-transitory computer readable media storing instructions that cause a processor to: apply, during a conversion between a current visual media block and a bitstream representation of the current visual media block, to the current visual media block, a partitioning process that splits the current visual media block into exactly four sub-blocks including at least one sub-block that has a size different from that of another sub-block, wherein a size of the current visual media block is M×N, wherein M and N are positive integers that are powers of 2, and wherein M is unequal to N; and generate the bitstream representation from the current visual media block based on the four sub-blocks and the partitioning process, wherein, in a case that the partitioning process is allowed for a depth/level, an indication of the usage of a corresponding partition structure is signaled.