Granted Patent B2

US 12,432,339 · App. 17/804,687 · Granted Sep 30, 2025

Inventors: Han Huang (San Diego, CA); Vadim Seregin (San Diego, CA); Marta Karczewicz (San Diego, CA)

Assignee: QUALCOMM Incorporated

H04N19/105H04N19/176H04N19/503H04N19/70

Abstract

Claims (50)

1. A method of coding video data, the method comprising:

coding one or more syntax elements indicative of a first value of N1 and a second value of N2, wherein N1 is a positive integer value, and wherein N2 is less than N1, wherein coding the one or more syntax elements indicative of the first value of N1 and the second value of N2 comprises:

coding a first syntax element that indicates the second value of N2; and

determining the second value for N1 as N2+k, wherein k is a fixed integer value greater than 0;

constructing a merge candidate list of merge candidates, wherein the merge candidate list has N1 candidates;

reordering the N1 merge candidates in the merge candidate list according to a cost function to create a reordered merge candidate list;

discarding a last N1-N2 candidates in the reordered merge candidate list to reduce the reordered merge candidate list to a specified number, N2, of candidates to create an output merge candidate list, wherein the output merge candidate list has N2 candidates, and wherein the N2 candidates in the output merge candidate list have smaller costs of the cost function relative to the N1-N2 candidates that were discarded; and

coding a block of video data using the output merge candidate list.

2. The method of claim 1 , wherein reordering the merge candidates in the merge candidate list according to the cost function to create the reordered merge candidate list comprises:

reordering the merge candidates in the merge candidate list using a template matching cost.

3. The method of claim 1 , wherein reordering the merge candidates in the merge candidate list according to the cost function to create the reordered merge candidate list comprises:

reordering the merge candidates in the merge candidate list using a bilateral-matching cost.

4. The method of claim 1 , wherein reordering the merge candidates in the merge candidate list according to the cost function to create the reordered merge candidate list comprises:

reordering the merge candidates in the merge candidate list using a bi-prediction cost.

5. The method of claim 1 , further comprising:

coding a merge index into the output merge candidate list based on a value of N2.

6. The method of claim 1 , further comprising:

determining a third value for k based on a merge mode.

7. The method of claim 1 , wherein coding comprises encoding.

8. The method of claim 1 , wherein coding comprises decoding.

9. An apparatus configured to code video data, the apparatus comprising:

a memory configured to store video data; and

one or more processors in communication with the memory, the one or more processors configured to:

code one or more syntax elements indicative of a first value of N1 and a second value of N2, wherein N1 is a positive integer value, and wherein N2 is less than N1, wherein to code the one or more syntax elements indicative of the first value of N1 and the second value of N2, the one or more processors are further configured to:

code a first syntax element that indicates the second value of N2; and

determine the second value for N1 as N2+k, wherein k is a fixed integer value greater than 0;

construct a merge candidate list of merge candidates, wherein the merge candidate list has N1 candidates;

reorder the NI merge candidates in the merge candidate list according to a cost function to create a reordered merge candidate list;

discard a last N1-N2 candidates in the reordered merge candidate list to reduce the reordered merge candidate list to a specified number, N2, of candidates to create an output merge candidate list, wherein the output merge candidate list has N2 candidates, and wherein the N2 candidates in the output merge candidate list have smaller costs of the cost function relative to the N1-N2 candidates that were discarded; and

code a block of video data using the output merge candidate list.

10. The apparatus of claim 9 , wherein to reorder the merge candidates in the merge candidate list according to the cost function to create the reordered merge candidate list, the one or more processors are further configured to:

reorder the merge candidates in the merge candidate list using a template matching cost.

11. The apparatus of claim 9 , wherein to reorder the merge candidates in the merge candidate list according to the cost function to create the reordered merge candidate list, the one or more processors are further configured to:

reorder the merge candidates in the merge candidate list using a bilateral-matching cost.

12. The apparatus of claim 9 , wherein to reorder the merge candidates in the merge candidate list according to the cost function to create the reordered merge candidate list, the one or more processors are further configured to:

reorder the merge candidates in the merge candidate list using a bi-prediction cost.

13. The apparatus of claim 9 , wherein the one or more processors are further configured to:

code a merge index into the output merge candidate list based on a value of N2.

14. The apparatus of claim 9 , wherein the one or more processors are further configured to:

determine a third value for k based on a merge mode.

15. The apparatus of claim 9 , wherein the apparatus is configured to encode video data.

16. The apparatus of claim 9 , wherein the apparatus is configured to decode video data.

17. An apparatus configured to code video data, the apparatus comprising:

means for coding one or more syntax elements indicative of a first value of N1 and a second value of N2, wherein N1 is a positive integer value, and wherein N2 is less than N1, wherein means for coding the one or more syntax elements indicative of the first value of N1 and the second value of N2 comprises:

means for coding a first syntax element that indicates the second value of N2; and

means for determining the second value for N1 as N2+k, wherein k is a fixed integer value greater than 0;

means for constructing a merge candidate list of merge candidates, wherein the merge candidate list has N1 candidates;

means for reordering the N1 merge candidates in the merge candidate list according to a cost function to create a reordered merge candidate list;

means for discarding a last N1-N2 candidates in the reordered merge candidate list to reduce the reordered merge candidate list to a specified number, N2, of candidates to create an output merge candidate list, wherein the output merge candidate list has N2 candidates, and wherein the N2 candidates in the output merge candidate list have smaller costs of the cost function relative to the N1-N2 candidates that were discarded; and

means for coding a block of video data using the output merge candidate list.

Assignments (1)

Continuity (2)

References Cited (23)