IP Library Granted Patent US 12,010,297
Granted Patent B2
US 12,010,297 · App. 18/052,011 · Granted Jun 11, 2024

Methods for constructing a merge candidate list

Inventors: Zhao Wang (Beijing, CN); Yan Ye (San Mateo, CA); Jiancong Luo (San Mateo, CA)
Assignee: Alibaba Group Holding Limited
H04N19/105H04N19/159H04N19/176H04N19/423
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,010,297
App. No.
18/052,011
Granted
Jun 11, 2024
Kind
B2
Abstract

A video processing method is provided. The method includes inserting a set of spatial merge candidates to a first merge candidate list of a coding block, wherein the first merge candidate list is constructed by: adding a top neighboring block B1 to the first merge candidate list when the top neighboring block B1 is available; adding a left neighboring block A1 to the first merge candidate list when the left neighboring block A1 is available; adding a top neighboring block B0 to the first merge candidate list when the top neighboring block B0 is available; adding a left neighboring block A0 to the first merge candidate list when the left neighboring block A0 is available; and adding an above-left neighboring block B2 to the first merge candidate list when the above-left neighboring block B2 is available.

Claims (52)

1. A video processing method, comprising:

inserting a set of spatial merge candidates to a first merge candidate list of a coding block,

wherein the first merge candidate list is constructed by:

adding a top neighboring block B1 to the first merge candidate list when the top neighboring block B1 is available;

adding a left neighboring block A1 to the first merge candidate list when the left neighboring block A1 is available;

adding a top neighboring block B0 to the first merge candidate list when the top neighboring block B0 is available;

adding a left neighboring block A0 to the first merge candidate list when the left neighboring block A0 is available; and

adding an above-left neighboring block B2 to the first merge candidate list when the above-left neighboring block B2 is available.

2. The method of claim 1 , wherein the first merge candidate list is selected from a plurality of merge candidate lists based on a coding mode applied to the coding block and wherein the first merge candidate list corresponds to a first coding mode.

3. The method of claim 2 , wherein the plurality of merge candidate lists includes a second merge candidate list corresponding to a second coding mode being applied to the coding block and the second merge candidate list is different from the first merge candidate list.

4. The method of claim 3 , wherein the first and second coding modes are two different modes selected from:

a regular merge mode, a merge mode with motion vector difference (MMVD), and a triangle partition mode (TPM).

5. The method of claim 3 , wherein an order of the second merge candidate list is the left neighboring block A1, the top neighboring block B1, the top neighboring block B0, the left neighboring block, and the above-left neighboring block B2.

6. The method of claim 1 , wherein the first merge candidate list is selected when the coding block is part of low-delay pictures, and a third merge candidate list is selected when the coding block is part of non-low-delay pictures; or

the first merge candidate list is selected when the coding block is part of low-delay pictures, and a third merge candidate list is selected when the coding block is part of non-low-delay pictures;

wherein the third merge candidate list is different from the first merge candidate list.

7. The method of claim 6 , wherein a merge mode with motion vector difference (MMVD) is applied on the coding block.

8. An apparatus for performing video processing, the apparatus comprising:

a memory configured to store instructions; and

one or more processors configured to execute the instructions to cause the apparatus to perform:

inserting a set of spatial merge candidates to a first merge candidate list of a coding block,

wherein the first merge candidate list is constructed by:

adding a top neighboring block B1 to the first merge candidate list when the top neighboring block B1 is available;

adding a left neighboring block A1 to the first merge candidate list when the left neighboring block A1 is available;

adding a top neighboring block B0 to the first merge candidate list when the top neighboring block B0 is available;

adding a left neighboring block A0 to the first merge candidate list when the left neighboring block A0 is available; and

adding an above-left neighboring block B2 to the first merge candidate list when the above-left neighboring block B2 is available.

9. The apparatus of claim 8 , wherein the first merge candidate list is selected from a plurality of merge candidate lists based on a coding mode applied to the coding block and wherein the first merge candidate list corresponds to a first coding mode.

10. The apparatus of claim 9 , wherein the plurality of merge candidate lists includes a second merge candidate list corresponding to a second coding mode being applied to the coding block and the second merge candidate list is different from the first merge candidate list.

11. The apparatus of claim 10 , wherein the first and second coding modes are two different modes selected from:

a regular merge mode, a merge mode with motion vector difference (MMVD), and a triangle partition mode (TPM).

12. The apparatus of claim 10 , wherein an order of the second merge candidate list is the left neighboring block A1, the top neighboring block B1, the top neighboring block B0, the left neighboring block, and the above-left neighboring block B2.

13. The apparatus of claim 8 , wherein the first merge candidate list is selected when the coding block is part of low-delay pictures, and a third merge candidate list is selected when the coding block is part of non-low-delay pictures; or

the first merge candidate list is selected when the coding block is part of low-delay pictures, and a third merge candidate list is selected when the coding block is part of non-low-delay pictures;

wherein the third merge candidate list is different from the first merge candidate list.

14. The apparatus of claim 13 , wherein a merge mode with motion vector difference (MMVD) is applied on the coding block.

15. A non-transitory computer readable storage medium storing a bitstream of a video for processing according to a method comprising:

inserting a set of spatial merge candidates to a first merge candidate list of a coding block,

wherein the first merge candidate list is constructed by:

adding a top neighboring block B1 to the first merge candidate list when the top neighboring block B1 is available;

adding a left neighboring block A1 to the first merge candidate list when the left neighboring block A1 is available;

adding a top neighboring block B0 to the first merge candidate list when the top neighboring block B0 is available;

adding a left neighboring block A0 to the first merge candidate list when the left neighboring block A0 is available; and

adding an above-left neighboring block B2 to the first merge candidate list when the above-left neighboring block B2 is available.

16. The non-transitory computer readable storage medium of claim 15 , wherein the first merge candidate list is selected from a plurality of merge candidate lists based on a coding mode applied to the coding block and wherein the first merge candidate list corresponds to a first coding mode.

17. The non-transitory computer readable storage medium of claim 16 , wherein the plurality of merge candidate lists includes a second merge candidate list corresponding to a second coding mode being applied to the coding block and the second merge candidate list is different from the first merge candidate list.

18. The non-transitory computer readable storage medium of claim 17 , wherein the first and second coding modes are two different modes selected from:

a regular merge mode, a merge mode with motion vector difference (MMVD), and a triangle partition mode (TPM).

19. The non-transitory computer readable storage medium of claim 17 , wherein an order of the second merge candidate list is the left neighboring block A1, the top neighboring block B1, the top neighboring block B0, the left neighboring block, and the above-left neighboring block B2.

20. The non-transitory computer readable storage medium of claim 15 , wherein the first merge candidate list is selected when the coding block is part of low-delay pictures, and a third merge candidate list is selected when the coding block is part of non-low-delay pictures; or

the first merge candidate list is selected when the coding block is part of low-delay pictures, and a third merge candidate list is selected when the coding block is part of non-low-delay pictures;

wherein the third merge candidate list is different from the first merge candidate list.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 4, 2026
From: ALIBABA INNOVATION PRIVATE LIMITED
To: HFI INNOVATION INC.
Reel/Frame 075499/0876 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 12, 2026
From: ALIBABA GROUP HOLDING LIMITED
To: ALIBABA INNOVATION PRIVATE LIMITED
Reel/Frame 074832/0914 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 2, 2022
From: WANG, ZHAO; YE, YAN; LUO, JIANCONG
To: ALIBABA GROUP HOLDING LIMITED
Reel/Frame 061632/0729 →
Continuity (3)
Continuation 16996242 · Aug 18, 2020
Provisional Application 62902790 · Sep 19, 2019
Related Publication 20230300321A1 · Sep 21, 2023