IP Library › Granted Patent US 12,647,601
Granted Patent B2
US 12,647,601 · App. 18/777,378 · Granted Jun 2, 2026

Adjacent spatial motion vector predictor candidates improvement

Inventors: Han Gao (Palo Alto, CA); Liang Zhao (Palo Alto, CA); Xin Zhao (Palo Alto, CA); Shan Liu (Palo Alto, CA)
Assignee: TENCENT AMERICA LLC
H04N19/52H04N19/105H04N19/139H04N19/176H04N19/593H04N19/88
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,647,601
App. No.
18/777,378
Granted
Jun 2, 2026
Kind
B2
Abstract

An example method of video decoding includes receiving a video bitstream comprising a plurality of blocks, including a current block. The method also includes generating a motion vector prediction (MVP) list for the current block by interleaving respective spatial motion vector predictors (SMVPs) from left and above neighboring blocks. Generating the MVP list includes inserting a first SMVP into the MVP list, the first SMVP corresponding to a left neighboring block that is left of the current block, and inserting a second SMVP into the MVP list, the second SMVP corresponding to a top neighboring block that is above the current block. The method further includes decoding the current block using an MVP from the MVP list.

Claims (48)

1 . A method of video decoding, the method comprising:

receiving a video bitstream comprising a plurality of blocks, including a current block;

generating a motion vector prediction (MVP) list for the current block by interleaving respective spatial motion vector predictors (SMVPs) from left and above neighboring blocks, including:

inserting a first SMVP into the MVP list, the first SMVP corresponding to a left neighboring block that is left of the current block; and

inserting a second SMVP into the MVP list, the second SMVP corresponding to a top neighboring block that is above the current block; and

decoding the current block using an MVP from the MVP list.

2 . The method of claim 1 , further comprising pruning one or more candidates from the MVP list based on determining that the one or more candidates have a same SMVP.

3 . The method of claim 2 , wherein the pruning is performed on only a portion of the MVP list.

4 . The method of claim 1 , wherein generating the MVP further includes:

inserting a third SMVP into the MVP list, the third SMVP corresponding to the left neighboring block; and

inserting a fourth SMVP into the MVP list, the fourth SMVP corresponding to the top neighboring block.

5 . The method of claim 4 , wherein generating the MVP further includes:

inserting a fifth SMVP into the MVP list, the fifth SMVP corresponding to a bottom-left neighboring block; and

inserting a sixth SMVP into the MVP list, the sixth SMVP corresponding to a top-right neighboring block.

6 . The method of claim 5 , wherein generating the MVP further includes inserting a seventh SMVP into the MVP list, the seventh SMVP corresponding to a top-left neighboring block.

7 . The method of claim 1 , further comprising assigning respective weights to motion vectors (MVs) of the MVP list.

8 . The method of claim 7 , wherein one or more of the MVs in the MVP list are assigned a weight of zero.

9 . The method of claim 1 , wherein, when one or more conditions are satisfied, the first SMVP is inserted into the MVP list before the second SMVP.

10 . The method of claim 9 , wherein, when one or more conditions are satisfied, the first SMVP is inserted into the MVP list after the second SMVP.

11 . The method of claim 9 , wherein the one or more conditions correspond to one or more of: a width of the current block, and a height of the current block.

12 . The method of claim 9 , wherein the one or more conditions correspond to whether a left or above neighboring block is selected as an MVP candidate.

13 . A computing system, comprising:

control circuitry;

memory; and

one or more sets of instructions stored in the memory and configured for execution by the control circuitry, the one or more sets of instructions comprising instructions for:

receiving video data comprising a plurality of blocks corresponding to one or more pictures, the plurality of blocks including a current block;

generating a motion vector prediction (MVP) list for the current block by interleaving respective spatial motion vector predictors (SMVPs) from left and above neighboring blocks, including:

inserting a first SMVP into the MVP list, the first SMVP corresponding to a left neighboring block that is left of the current block; and

inserting a second SMVP into the MVP list, the second SMVP corresponding to a top neighboring block that is above the current block; and

encoding the current block using an MVP from the MVP list.

14 . The computing system of claim 13 , wherein generating the MVP further includes:

inserting a third SMVP into the MVP list, the third SMVP corresponding to the left neighboring block; and

inserting a fourth SMVP into the MVP list, the fourth SMVP corresponding to the top neighboring block.

15 . The computing system of claim 14 , wherein generating the MVP further includes:

inserting a fifth SMVP into the MVP list, the fifth SMVP corresponding to a bottom-left neighboring block; and

inserting a sixth SMVP into the MVP list, the sixth SMVP corresponding to a top-right neighboring block.

16 . The computing system of claim 15 , wherein generating the MVP further includes inserting a seventh SMVP into the MVP list, the seventh SMVP corresponding to a top-left neighboring block.

17 . The computing system of claim 13 , wherein the one or more sets of instructions further comprises instructions for assigning respective weights to motion vectors (MVs) of the MVP list.

18 . The computing system of claim 13 , wherein the one or more sets of instructions further comprises instructions for pruning one or more candidates from the MVP list based on determining that the one or more candidates have a same SMVP.

19 . The computing system of claim 13 , wherein, when one or more conditions are satisfied, the first SMVP is inserted into the MVP list before the second SMVP.

20 . A method of obtaining a video bitstream, the method comprising:

generating a video bitstream, including:

receiving video data comprising a plurality of blocks corresponding to one or more pictures, the plurality of blocks including a current block;

generating a motion vector prediction (MVP) list for the current block by interleaving respective spatial motion vector predictors (SMVPs) from left and above neighboring blocks, including:

inserting a first SMVP into the MVP list, the first SMVP corresponding to a left neighboring block that is left of the current block; and

inserting a second SMVP into the MVP list, the second SMVP corresponding to a top neighboring block that is above the current block; and

encoding the current block using an MVP from the MVP list; and

transmitting the video bitstream including the encoded current block.

Continuity (3)
Continuation 17941432 · Sep 9, 2022
Provisional Application 63349761 · Jun 7, 2022
Related Publication 20240373058A1 · Nov 7, 2024
References Cited (14)
US 10602180B2 · Chen · 2020 [cited by examiner]
US 11202065B2 · Zhang et al. · 2021 [cited by applicant]
US 11218723B2 · Chen · 2022 [cited by examiner]
US 12244854B2 · Xu · 2025 [cited by examiner]
US 20140301467A1 · Thirumalai et al. · 2014 [cited by applicant]
US 20170150168A1 · Nakamura et al. · 2017 [cited by applicant]
US 20210067798A1 · Chujoh · 2021 [cited by examiner]
US 20220078410A1 · Zhu et al. · 2022 [cited by applicant]
US 20220272323A1 · Li · 2022 [cited by examiner]
US 20220360814A1 · Wu · 2022 [cited by examiner]
US 20230103767A1 · Chang · 2023 [cited by examiner]
WO WO2023132564A1 · 2023 [cited by applicant]
Tencent Technology, ISR/WO, PCT/US2022/43327, Feb. 3, 2023, 7 pgs. [cited by applicant]
Tencent America LLC, India Office Action, IN Patent Application No. 202427017228, Mar. 13, 2026, 7 pgs. [cited by applicant]