IP Library › Granted Patent US 12,464,123
Granted Patent B2
US 12,464,123 · App. 18/476,957 · Granted Nov 4, 2025

Neighbor based partitioning constraints

Inventors: Kai Zhang (San Diego, CA); Li Zhang (San Diego, CA); Zhipin Deng (Beijing, CN); Na Zhang (Beijing, CN); Yang Wang (Beijing, CN)
Assignees: BEIJING BYTEDANCE NETWORK TECHNOLOGY CO., LTD.; BYTEDANCE INC.
H04N19/119H04N19/105H04N19/132H04N19/176
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,464,123
App. No.
18/476,957
Granted
Nov 4, 2025
Kind
B2
Abstract

Systems, methods, apparatus for video processing are described. A video processing method includes determining, for a conversion between a current block of a video and a bitstream of the video, whether or which a partitioning scheme is enabled for coding of the current block according to a rule, and performing the conversion based on the determining. The rule is based on one or more neighboring blocks of the current block.

Claims (62)

1 . A method for processing video data, comprising:

determining whether a partitioning scheme is enabled for a current block based on a rule associated with one or more neighboring samples or blocks of the current block; and

performing a conversion between a video comprising the current block and a bitstream based on the determining;

wherein a neighboring block of the one or more neighboring blocks is set to be unavailable if one or more conditions are not satisfied,

wherein the one or more conditions comprises at least one of: the current block being coded before the neighboring block, the current block being in a different coding tree unit (CTU) row from the neighboring block, the current block being in a different virtual pipeline data unit (VPDU) from the neighboring block, the current block being in a different subpicture from the neighboring block, the current block being in a different slice from the neighboring block, the current block being in a different tile from the neighboring block, the current block being in a different brick from the neighboring block;

wherein the rule specifies that in a case that the neighboring block is unavailable, information from the neighboring block is disallowed to be used to determine whether the partitioning scheme is enabled.

2 . The method of claim 1 , wherein the rule specifies that whether the partitioning scheme is enabled for the current block is based on information of the one or more neighboring samples or blocks of the current block.

3 . The method of claim 1 , wherein the one or more neighboring blocks of the current block comprise at least one of: a neighboring block or sub-block covering a neighboring sample located on a top side of a top-left sample of the current block, a neighboring block or sub-block covering a neighboring sample located on a top side of a top-right sample of the current block, a neighboring block or sub-block covering a neighboring sample located on a left side of the top-left sample of the current block, or a neighboring block or sub-block covering a neighboring sample located on a left side of a bottom-left sample of the current block.

4 . The method of claim 1 , wherein the one or more neighboring samples or blocks are adjacent or non-adjacent to the current block;

wherein the one or more neighboring samples or blocks are in a current picture including the current block or a picture different from the current picture including the current block.

5 . The method of claim 1 , wherein the rule indicates that when a constraint is applied the partitioning scheme is disabled for the current block, and wherein the constraint is applied in a case that a relationship between at least two neighboring samples or blocks of the one or more neighboring samples or blocks satisfies at least one condition.

6 . The method of claim 5 , wherein whether the constraint is applied or not is based on at least one of a width of the current block, a height of the current block, or a top-left coordinate position of the current block.

7 . The method of claim 5 , wherein whether the constraint is applied or not is based on whether at least two neighboring blocks of the one or more neighboring blocks are in a same coding unit;

wherein the at least two neighboring blocks comprises a neighboring block or sub-block covering a neighboring sample located on a top side of a top-left sample of the current block and a neighboring block or sub-block covering a neighboring sample located on a top side of a top-right sample of the current block, or

wherein the at least two neighboring blocks comprises a neighboring block or sub-block covering a neighboring sample located on a left side of a top-left sample of the current block and a neighboring block or sub-block covering a neighboring sample located on a left side of a bottom-left sample of the current block.

8 . The method of claim 5 , wherein whether the constraint is applied or not is based on whether a first two neighboring blocks of the one or more neighboring blocks are in a first common coding unit and whether a second two neighboring blocks of the one or more neighboring blocks are in a second common coding unit;

wherein the first common coding unit and the second common coding unit are different coding units; and

wherein the first two neighboring blocks comprises a neighboring block or sub-block covering a neighboring sample located on a top side of a top-left sample of the current block and a neighboring block or sub-block covering a neighboring sample located on a top side of a top-right sample of the current block, and the second two neighboring blocks comprises a neighboring block or sub-block covering a neighboring sample located on a left side of the top-left sample of the current block and a neighboring block or sub-block covering a neighboring sample located on a left side of a bottom-left sample of the current block.

9 . The method of claim 5 , wherein whether the constraint is applied or not is based on a number N of coding units covering a range of neighboring samples of the current block, wherein N is an integer.

10 . The method of claim 5 , wherein the partitioning scheme comprises at least one of: a binary tree (BT), a triple tree (TT), an unsymmetric binary tree (UBT), an unsymmetrical quad-tree (UQT), an extended ternary-tree (ETT), a vertical BT, a horizontal BT, a vertical TT, a horizontal TT, a vertical UBT, a horizontal UBT, a vertical ETT, or a horizontal ETT.

11 . The method of claim 5 , wherein whether a syntax element for indicating the partitioning scheme for the current block is present in the bitstream is dependent on the constraint.

12 . The method of claim 5 , wherein whether the constraint is applied or not is dependent on sequence-level information or picture-level information or slice-level information or coding tree unit-level information of the current block and/or information of a neighboring block of the current block.

13 . The method of claim 1 , wherein the rule is based on a color component of the current block.

14 . The method of claim 1 , wherein the conversion comprises decoding the video from the bitstream.

15 . The method of claim 1 , wherein the conversion comprises encoding the video into the bitstream.

16 . An apparatus for processing video data comprising a processor and a non-transitory memory with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to:

determine whether a partitioning scheme is enabled for a current block based on a rule associated with one or more neighboring samples or blocks of the current block; and

perform a conversion between a video comprising the current block and a bitstream based on the determination;

wherein a neighboring block of the one or more neighboring blocks is set to be unavailable if one or more conditions are not satisfied, wherein the one or more conditions comprises at least one of: the current block being coded before the neighboring block, the current block being in a different coding tree unit (CTU) row from the neighboring block, the current block being in a different virtual pipeline data unit (VPDU) from the neighboring block, the current block being in a different subpicture from the neighboring block, the current block being in a different slice from the neighboring block, the current block being in a different tile from the neighboring block, the current block being in a different brick from the neighboring block;

wherein the rule specifies that in a case that the neighboring block is unavailable, information from the neighboring block is disallowed to be used to determine whether the partitioning scheme is enabled.

17 . The apparatus of claim 16 , wherein the rule specifies that whether the partitioning scheme is enabled for the current block is based on information of the one or more neighboring samples or blocks of the current block;

wherein the one or more neighboring blocks of the current block comprise at least one of: a neighboring block or sub-block covering a neighboring sample located on a top side of a top-left sample of the current block, a neighboring block or sub-block covering a neighboring sample located on a top side of a top-right sample of the current block, a neighboring block or sub-block covering a neighboring sample located on a left side of the top-left sample of the current block, or a neighboring block or sub-block covering a neighboring sample located on a left side of a bottom-left sample of the current block;

wherein the one or more neighboring samples or blocks are adjacent or non-adjacent to the current block;

wherein the one or more neighboring samples or blocks are in a current picture including the current block or a picture different from the current picture including the current block;

wherein the rule indicates that when a constraint is applied the partitioning scheme is disabled for the current block, and wherein the constraint is applied in a case that a relationship between at least two neighboring samples or blocks of the one or more neighboring samples or blocks satisfies at least one condition;

wherein whether the constraint is applied or not is based on at least one of a width of the current block, a height of the current block, or a top-left coordinate position of the current block;

wherein whether the constraint is applied or not is based on whether at least two neighboring blocks of the one or more neighboring blocks are in a same coding unit, wherein the at least two neighboring blocks comprises a neighboring block or sub-block covering a neighboring sample located on a top side of a top-left sample of the current block and a neighboring block or sub-block covering a neighboring sample located on a top side of a top-right sample of the current block, or wherein the at least two neighboring blocks comprises a neighboring block or sub-block covering a neighboring sample located on a left side of a top-left sample of the current block and a neighboring block or sub-block covering a neighboring sample located on a left side of a bottom-left sample of the current block;

wherein whether the constraint is applied or not is based on whether a first two neighboring blocks of the one or more neighboring blocks are in a first common coding unit and whether a second two neighboring blocks of the one or more neighboring blocks are in a second common coding unit; wherein the first common coding unit and the second common coding unit are different coding units; and wherein the first two neighboring blocks comprises a neighboring block or sub-block covering a neighboring sample located on a top side of a top-left sample of the current block and a neighboring block or sub-block covering a neighboring sample located on a top side of a top-right sample of the current block, and the second two neighboring blocks comprises a neighboring block or sub-block covering a neighboring sample located on a left side of the top-left sample of the current block and a neighboring block or sub-block covering a neighboring sample located on a left side of a bottom-left sample of the current block;

wherein whether the constraint is applied or not is based on a number N of coding units covering a range of neighboring samples of the current block, wherein N is an integer;

wherein the partitioning scheme comprises at least one of: a binary tree (BT), a triple tree (TT), an unsymmetric binary tree (UBT), an unsymmetrical quad-tree (UQT), an extended ternary-tree (ETT), a vertical BT, a horizontal BT, a vertical TT, a horizontal TT, a vertical UBT, a horizontal UBT, a vertical ETT, or a horizontal ETT;

wherein whether a syntax element for indicating the partitioning scheme for the current block is present in the bitstream is dependent on the constraint;

wherein whether the constraint is applied or not is dependent on sequence-level information or picture-level information or slice-level information or coding tree unit-level information of the current block and/or information of a neighboring block of the current block; and

wherein the rule is based on a color component of the current block.

18 . A method for storing a bitstream of a video, comprising:

determining whether a partitioning scheme is enabled for a current block based on a rule associated with one or more neighboring samples or blocks of the current block; and

generating the bitstream based on the determining;

storing the bitstream in a non-transitory computer-readable recording medium;

wherein a neighboring block of the one or more neighboring blocks is set to be unavailable if one or more conditions are not satisfied, wherein the one or more conditions comprises at least one of: the current block being coded before the neighboring block, the current block being in a different coding tree unit (CTU) row from the neighboring block, the current block being in a different virtual pipeline data unit (VPDU) from the neighboring block, the current block being in a different subpicture from the neighboring block, the current block being in a different slice from the neighboring block, the current block being in a different tile from the neighboring block, the current block being in a different brick from the neighboring block;

wherein the rule specifies that in a case that the neighboring block is unavailable, information from the neighboring block is disallowed to be used to determine whether the partitioning scheme is enabled.

19 . The method of claim 18 , wherein the rule specifies that whether the partitioning scheme is enabled for the current block is based on information of the one or more neighboring samples or blocks of the current block;

wherein the one or more neighboring blocks of the current block comprise at least one of: a neighboring block or sub-block covering a neighboring sample located on a top side of a top-left sample of the current block, a neighboring block or sub-block covering a neighboring sample located on a top side of a top-right sample of the current block, a neighboring block or sub-block covering a neighboring sample located on a left side of the top-left sample of the current block, or a neighboring block or sub-block covering a neighboring sample located on a left side of a bottom-left sample of the current block;

wherein the one or more neighboring samples or blocks are adjacent or non-adjacent to the current block;

wherein the one or more neighboring samples or blocks are in a current picture including the current block or a picture different from the current picture including the current block;

wherein the rule indicates that when a constraint is applied the partitioning scheme is disabled for the current block, and wherein the constraint is applied in a case that a relationship between at least two neighboring samples or blocks of the one or more neighboring samples or blocks satisfies at least one condition;

wherein whether the constraint is applied or not is based on at least one of a width of the current block, a height of the current block, or a top-left coordinate position of the current block;

wherein whether the constraint is applied or not is based on whether at least two neighboring blocks of the one or more neighboring blocks are in a same coding unit, wherein the at least two neighboring blocks comprises a neighboring block or sub-block covering a neighboring sample located on a top side of a top-left sample of the current block and a neighboring block or sub-block covering a neighboring sample located on a top side of a top-right sample of the current block, or wherein the at least two neighboring blocks comprises a neighboring block or sub-block covering a neighboring sample located on a left side of a top-left sample of the current block and a neighboring block or sub-block covering a neighboring sample located on a left side of a bottom-left sample of the current block;

wherein whether the constraint is applied or not is based on whether a first two neighboring blocks of the one or more neighboring blocks are in a first common coding unit and whether a second two neighboring blocks of the one or more neighboring blocks are in a second common coding unit; wherein the first common coding unit and the second common coding unit are different coding units; and wherein the first two neighboring blocks comprises a neighboring block or sub-block covering a neighboring sample located on a top side of a top-left sample of the current block and a neighboring block or sub-block covering a neighboring sample located on a top side of a top-right sample of the current block, and the second two neighboring blocks comprises a neighboring block or sub-block covering a neighboring sample located on a left side of the top-left sample of the current block and a neighboring block or sub-block covering a neighboring sample located on a left side of a bottom-left sample of the current block;

wherein whether the constraint is applied or not is based on a number N of coding units covering a range of neighboring samples of the current block, wherein N is an integer;

wherein the partitioning scheme comprises at least one of: a binary tree (BT), a triple tree (TT), an unsymmetric binary tree (UBT), an unsymmetrical quad-tree (UQT), an extended ternary-tree (ETT), a vertical BT, a horizontal BT, a vertical TT, a horizontal TT, a vertical UBT, a horizontal UBT, a vertical ETT, or a horizontal ETT;

wherein whether a syntax element for indicating the partitioning scheme for the current block is present in the bitstream is dependent on the constraint;

wherein whether the constraint is applied or not is dependent on sequence-level information or picture-level information or slice-level information or coding tree unit-level information of the current block and/or information of a neighboring block of the current block; and

wherein the rule is based on a color component of the current block.

Assignments (5)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 25, 2023
From: ZHANG, KAI; ZHANG, LI
To: BYTEDANCE INC.
Reel/Frame 065341/0931 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 25, 2023
From: WANG, YANG
To: BEIJING OCEAN ENGINE NETWORK TECHNOLOGY CO., LTD.,
Reel/Frame 065341/0967 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 25, 2023
From: DENG, ZHIPIN; ZHANG, NA
To: BEIJING ZITIAO NETWORK TECHNOLOGY CO., LTD.
Reel/Frame 065342/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 25, 2023
From: BEIJING ZITIAO NETWORK TECHNOLOGY CO., LTD.
To: BEIJING BYTEDANCE NETWORK TECHNOLOGY CO., LTD.
Reel/Frame 065342/0062 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 25, 2023
From: BEIJING OCEAN ENGINE NETWORK TECHNOLOGY CO., LTD.
To: BEIJING BYTEDANCE NETWORK TECHNOLOGY CO., LTD.
Reel/Frame 065342/0115 →
Continuity (2)
Continuation PCTCN2022085261 · Apr 6, 2022
Related Publication 20240022722A1 · Jan 18, 2024
References Cited (19)
US 20200275099A1 · Park · 2020 [cited by examiner]
US 20210329233A1 · Tsai · 2021 [cited by examiner]
CN 108462873A · 2018 [cited by applicant]
CN 111107358A · 2020 [cited by applicant]
CN 111107368A · 2020 [cited by applicant]
CN 111357291A · 2020 [cited by applicant]
WO 2018088805A1 · 2018 [cited by applicant]
Document: JVET-K0287-v1, Gao, H., et al., “CE1-2.0.11: Picture Boundary Handling,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 11th Meeting: Ljubljana, SI, Jul. 10-18, 2018, 7 pages. [cited by applicant]
Retrieved from the internet: http://www.avs.org.cn/english/, Jan. 10, 2024, 3 pages. [cited by applicant]
Sullivan, G., et al., “Overview of the High Efficiency Video Coding (HEVC) Standard”, IEEE Transactions On Circuits And Systems For Video Technology, vol. 22, No. 12, Dec. 2012, 20 pages. [cited by applicant]
Luthra, A., et al., “Overview of the H.264/AVC video coding standard,” Proceedings of SPIE vol. 5203 Applications of Digital Image Processing XXVI, Nov. 19, 2003, 16 pages. [cited by applicant]
Document: JVET-G1001-v1, Chen, J., et al., “Algorithm Description of Joint Exploration Test Model 7 (JEM 7),” Joint Video Exploration Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 7th Meeting: Torino, IT… [cited by applicant]
Retrieved from the internet: https://jvet.hhi.fraunhofer.de/svn/svn_HMJEMSoftware/tags/ HM-16.6-JEM-7.0, JEM-7.0, Jan. 10, 2024, 1 page. [cited by applicant]
“Series H: Audiovisual and Multimedia Systems Infrastructure of audiovisual services—Coding of moving video High efficiency video coding,” Recommendation ITU-T H.265, Aug. 2021, 716 pages. [cited by applicant]
Document: JVET-D0117r1, Li, X., et al., “Multi-Type-Tree,” Joint Video Exploration Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 4th Meeting: Chengdu, CN, Oct. 15-21, 2016, 3 pages. [cited by applicant]
Patent for binary tree: https://patentscope.wipo.int/search/en/detail.jsf; jsessionid=B6F96E719C3DECA6BB5B0830F82F2478.wapp1nCdocId=WO2016091161 recNum=1 maxRec= office=prevFilter= sortOption= queryString= tab=FullText#… [cited by applicant]
Document: JVET-J1001-v2, Bross, B., “Versatile Video Coding (Draft 1),” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 10th Meeting: San Diego, US, Apr. 10-20, 2018, 43 pages. [cited by applicant]
Budagavi, M., et al., “Core Transform Design for the High Efficiency Video Coding (HEVC) Standard,” IEEE Journal of Selected Topics in Signal Processing, vol. 7, No. 6, Dec. 2013, 13 pages. [cited by applicant]
International Search Report from PCT Application No. PCT/CN2022/085261 dated Jul. 18, 2022, 9 pages. [cited by applicant]