IP Library › Granted Patent US 11,445,224
Granted Patent B2
US 11,445,224 · App. 17/110,009 · Granted Sep 13, 2022

Shape of EQT subblock

Inventors: Li Zhang (San Diego, CA); Kai Zhang (San Diego, CA); Hongbin Liu (Beijing, CN); Hsiao Chiang Chuang (San Diego, CA); Yue Wang (Beijing, CN)
Assignees: BEIJING BYTEDANCE NETWORK TECHNOLOGY CO., LTD.; BYTEDANCE INC.
H04N19/96H04N19/119H04N19/176H04N19/184H04N19/189H04N19/1883H04N19/46
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,445,224
App. No.
17/110,009
Filed
Dec 2, 2020
Granted
Sep 13, 2022
Kind
B2
Art Unit
2487
USPC
375/240.02
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 (39)

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.

2. 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.

3. 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.

4. The method of claim 2 , wherein M1, M2, M3 and M4 are different from each other.

5. The method of claim 3 , wherein N1, N2, N3 and N4 are different from each other.

6. 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.

7. The method of claim 6 , wherein w0=1, w=2, h0=1 and h=4.

8. The method of claim 6 , wherein h0=1, h=2, w0=1 and w=4.

9. 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.

10. 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.

11. 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.

12. 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.

13. The method of claim 1 , wherein the current visual media block comprises a video block.

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.

15. 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.

16. 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.

17. The apparatus of claim 15 , wherein M1, M2, M3 and M4 are different from each other.

18. The apparatus of claim 16 , wherein N1, N2, N3 and N4 are different from each other.

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.

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.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 2, 2020
From: ZHANG, LI; ZHANG, KAI; CHUANG, HSIAO CHIANG
To: BYTEDANCE INC.
Reel/Frame 054521/0798 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 2, 2020
From: LIU, HONGBIN; WANG, YUE
To: BEIJING BYTEDANCE NETWORK TECHNOLOGY CO., LTD.
Reel/Frame 054521/0843 →
Priority Claims (1)
WO PCT/CN2018/089918 · Jun 5, 2018 · international
Continuity (2)
Continuation PCTIB2019054617 · Jun 4, 2019
Related Publication 20210092378A1 · Mar 25, 2021