IP Library Granted Patent US 12,244,839
Granted Patent B2
US 12,244,839 · App. 18/300,223 · Granted Mar 4, 2025

Constraint of minimum quaternary tree size

Inventors: Guichun Li (San Jose, CA); Xiang Li (Saratoga, CA); Shan Liu (San Jose, CA)
Assignee: TENCENT AMERICA LLC
H04N19/44H04N19/119H04N19/159H04N19/176H04N19/186H04N19/96
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 12,244,839
App. No.
18/300,223
Granted
Mar 4, 2025
Kind
B2
Abstract

An apparatus for video encoding includes processing circuitry that is configured to decode partition information from a coded video bitstream. The partition information is indicative of a minimum allowed QT leaf node size for a I slice. The minimum allowed QT leaf node size for the I slice is constrained by a threshold that is lower than a CTU size. The processing circuitry is configured to determine, based on an override enabling flag, the minimum allowed QT leaf node size according to one of a first syntax element in an SPS or a second syntax element in a PH included in the partition information. The processing circuitry is configured to partition a coding tree block in the I slice into coding blocks based on the determined minimum allowed QT leaf node size. The processing circuitry is configured to reconstruct the coding blocks respectively from the coded video bitstream.

Claims (41)

1. A method for video decoding in a decoder, comprising:

decoding, by processing circuitry, partition information from a coded video bitstream, the partition information being indicative of a minimum allowed quaternary tree (QT) leaf node size for an intra coded (I) slice, the minimum allowed QT leaf node size for the I slice being constrained by a threshold that is lower than a coding tree unit (CTU) size;

determining, by the processing circuitry based on an override enabling flag, the minimum allowed QT leaf node size according to one of a first syntax element in a sequence parameter set (SPS) or a second syntax element in a picture head (PH) included in the partition information;

partitioning, by the processing circuitry, a coding tree block in the I slice into coding blocks based on the determined minimum allowed QT leaf node size, wherein a base 2 logarithm of the minimum allowed QT leaf node size is less than a base 2 logarithm of the CTU size; and

reconstructing, by the processing circuitry, the coding blocks respectively from the coded video bitstream.

2. The method of claim 1 , wherein the partition information is indicative of a minimum allowed QT leaf node size for a luma component.

3. The method of claim 2 , wherein the minimum allowed QT leaf node size for the I slice, as indicated by the partition information, is constrained by the threshold when a dual tree partition is used for the I slice.

4. The method of claim 2 , further comprising determining the threshold based on an implicit QT split requirement.

5. The method of claim 1 , wherein the partition information is indicative of a minimum allowed QT leaf node size for chroma components.

6. The method of claim 1 , wherein the threshold is determined based on (i) the base 2 logarithm of the CTU size and (ii) a dual tree partition being applied to the intra coded I slice.

7. The method of claim 1 , wherein the determining the minimum allowed QT leaf node size further comprises:

based on (i) the base 2 logarithm of the CTU size and (ii) a dual tree partition being applied to the intra coded I slice,

determining that the minimum allowed QT leaf node size is between a base 2 logarithm of a minimum coding block size in the CTU and the base 2 logarithm of the CTU size minus 1.

8. The method of claim 1 , further comprising:

applying QT splits to partition the coding tree block into QT leaf nodes that satisfy a requirement of the minimum allowed QT leaf node size, before applying a binary tree (BT) split or a ternary tree (TT) split.

9. The method of claim 1 , wherein the base 2 logarithm of the minimum allowed QT leaf node size for the I slice, as indicated by the partition information, is smaller than the base 2 logarithm of the CTU size by 1.

10. An apparatus for video encoding, comprising:

processing circuitry configured to:

determine partition information being indicative of a minimum allowed quaternary tree (QT) leaf node size for an intra coded (I) slice, the minimum allowed QT leaf node size for the I slice being constrained by a threshold that is lower than a coding tree unit (CTU) size;

encoding one of a first syntax element in a sequence parameter set (SPS) or a second syntax element in a picture head (PH) included in the partition information based on an override enabling flag indicating the minimum allowed QT leaf node size;

partition a coding tree block in the I slice into coding blocks based on the determined minimum allowed QT leaf node size, wherein a base 2 logarithm of the minimum allowed QT leaf node size is less than a base 2 logarithm of the CTU size; and

encoding the partitioned coding blocks in a bitstream.

11. The apparatus of claim 10 , wherein the partition information is indicative of a minimum allowed QT leaf node size for a luma component.

12. The apparatus of claim 11 , wherein the minimum allowed QT leaf node size for the I slice, as indicated by the partition information, is constrained by the threshold when a dual tree partition is used for the I slice.

13. The apparatus of claim 11 , wherein the processing circuitry is further configured to determine the threshold based on an implicit QT split requirement.

14. The apparatus of claim 10 , wherein the partition information is indicative of a minimum allowed QT leaf node size for chroma components.

15. The apparatus of claim 10 , wherein the threshold is determined based on (i) the base 2 logarithm of the CTU size and (ii) a dual tree partition being applied to the intra coded I slice.

16. The apparatus of claim 10 , wherein the processing circuitry is further configured to:

based on (i) the base 2 logarithm of the CTU size and (ii) a dual tree partition being applied to the intra coded I slice,

determine that the minimum allowed QT leaf node size is between a base 2 logarithm of a minimum coding block size in the CTU and the base 2 logarithm of the CTU size minus 1.

17. The apparatus of claim 10 , wherein the processing circuitry is further configured to:

apply QT splits to partition the coding tree block into QT leaf nodes that satisfy a requirement of the minimum allowed QT leaf node size, before applying a binary tree (BT) split or a ternary tree (TT) split.

18. The apparatus of claim 10 , wherein the base 2 logarithm of the minimum allowed QT leaf node size for the I slice, as indicated by the partition information, is smaller than the base 2 logarithm of the CTU size by 1.

19. A method of processing visual media data, the method comprising:

processing a bitstream that includes the visual media data according to a format rule, wherein

the bitstream includes partition information from a coded video bitstream, the partition information being indicative of a minimum allowed quaternary tree (QT) leaf node size for an intra coded (I) slice, the minimum allowed QT leaf node size for the I slice being constrained by a threshold that is lower than a coding tree unit (CTU) size; and

the format rule specifies that

based on an override enabling flag, the minimum allowed QT leaf node size is determined according to one of a first syntax element in a sequence parameter set (SPS) or a second syntax element in a picture head (PH) included in the partition information,

a coding tree block in the I slice is partitioned into coding blocks based on the determined minimum allowed QT leaf node size, wherein a base 2 logarithm of the minimum allowed QT leaf node size is less than a base 2 logarithm of the CTU size; and

the coding blocks are respectively reconstructed from the coded video bitstream.

20. The method of claim 19 , wherein the partition information is indicative of a minimum allowed QT leaf node size for a luma component.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 19, 2023
From: LI, GUICHUN; LI, XIANG; LIU, SHAN
To: TENCENT AMERICA LLC
Reel/Frame 063376/0172 →
Continuity (4)
Continuation 17494539 · Oct 5, 2021
Continuation 17077748 · Oct 22, 2020
Provisional Application 62979911 · Feb 21, 2020
Related Publication 20230283794A1 · Sep 7, 2023
References Cited (23)
US 20130272372A1 · Hannuksela et al. · 2013 [cited by applicant]
US 20190281290A1 · Lee · 2019 [cited by examiner]
US 20200059659A1 · Chen et al. · 2020 [cited by applicant]
US 20200195924A1 · Hsiang · 2020 [cited by applicant]
US 20210044828A1 · Pham Van · 2021 [cited by examiner]
US 20210112247A1 · Hsiang et al. · 2021 [cited by applicant]
US 20210160528A1 · Chen et al. · 2021 [cited by applicant]
US 20210250621A1 · Huang · 2021 [cited by examiner]
US 20210314630A1 · Misra et al. · 2021 [cited by applicant]
US 20210321098A1 · Chuang et al. · 2021 [cited by applicant]
WO 2019189279A1 · 2019 [cited by applicant]
WO 2019230670A1 · 2019 [cited by applicant]
Extended European Search Report in EP21756470.7, mailed Feb. 14, 2024, 13 pages. [cited by applicant]
Li et al., “Fix on minimum QT size value range,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 18th Meeting: by teleconference, Apr. 15-24, 2020, Document: JVET-R0269, 3 pages. [cited by applicant]
Gao et al., “Syntax and Semantics Chacnes of QT/BT/TT Split Constraint Syntax Elements Signaling Method,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, Oct. 3-12, 208, JVET-L0678, 12… [cited by applicant]
Office Action in CN202180003437.9, mailed Sep. 13, 2023, 8 pages. [cited by applicant]
Bross et al., “Versatile Video Coding (Draft 8),” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, Jan. 7-17, 2020, JVET-Q2001-vC, 17th Meeting: Brussels, BE, 512 pages. [cited by applicant]
Chen et al., “Algorithm description for Versatile Video Coding and Test Model 8 (VTM 8),” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, Jan. 7-17, 2020, JVET-Q2002-v1, 17th Meeting: … [cited by applicant]
Hsiang et al., “AHG9: Fix on high-level syntax related to coding tree constraints,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, Jan. 7-17, JVET-Q0174-v2, 17th Meeting: Brussels, BE… [cited by applicant]
International Search Report and Written Opinion in PCT/US2021/013245, mailed Mar. 25, 2021, 7 pages. [cited by applicant]
International Telecommunications Union (ITU-T), “High efficiency video Coding,” H.265, Dec. 2016, Series H: Audiovisual and Multimedia Systems, 664 pages. [cited by applicant]
Office Action in JP2021560898, mailed Nov. 1, 2022, 9 pages. [cited by applicant]
Office Action in JP2021560898, mailed May 16, 2023, 3 pages. [cited by applicant]