Methods and apparatus of video coding for triangle prediction

Patent metadata

Field	Value
Publication number	US-12574540-B2
Application number	US-202117467140-A
Country	US
Kind code	B2
Filing date	Sep 3, 2021
Priority date	Mar 12, 2019
Publication date	Mar 10, 2026
Grant date	Mar 10, 2026

Abstract

Methods and apparatuses are provided for video coding. The method includes: partitioning video pictures into a plurality of coding units (CUs), at least one of which is further partitioned into two prediction units (PUs) including at least one geometric shaped PU; obtaining a first merge list including a plurality of candidates, each including one or more motion vectors; and obtaining a uni-prediction merge list for the geometric shaped PU; where the uni-prediction merge list including a plurality of uni-prediction merge candidates, and each uni-prediction merge candidate includes one motion vector of a corresponding candidate in the first merge list.

First claim

What is claimed is:

1 . A method for video decoding, comprising:
obtaining, from a video bitstream, a plurality of coding units (CUs) partitioned from video pictures, wherein at least one of the CUs is further portioned into two prediction units (PUs) including at least one geometric shaped PU; deriving a first merge list comprising a plurality of candidates, each comprising one or more motion vectors; and obtaining a plurality of uni-prediction merge candidates by directly accessing the candidates of the first merge list without creating a uni-prediction merge candidate list, wherein each uni-prediction merge candidate comprises one motion vector of a corresponding candidate in the first merge list, wherein each candidate in the first merge list comprises at least one of a List 0 motion vector or a List 1 motion vector, and each uni-prediction merge candidate is associated with a merge index of integer value and comprises a single one of the List 0 and List 1 motion vectors of each candidate in the first merge list selected based on parity of the merge index.

2 . The method of claim 1 , wherein each uni-prediction merge candidate having a merge index value comprises a List 0 or List 1 motion vector of the corresponding candidate in the first merge list with the same merge index.

3 . The method of claim 1 , wherein each uni-prediction merge candidate having an even merge index value comprises a List 0 motion vector of the corresponding candidate in the first merge list upon determining that the List 0 motion vector is available; or a List 1 motion vector of the corresponding candidate in the first merge list upon determining that the List 0 motion vector is not available; and
wherein each uni-prediction merge candidate having an odd merge index value comprises a List 1 motion vector of the corresponding candidate in the first merge list upon determining that the List 1 motion vector is available; or a List 0 motion vector of the corresponding candidate in the first merge list upon determining that the List 1 motion vector is not available.

4 . The method of claim 1 , wherein each uni-prediction merge candidate having a merge index value within a first range comprises a List 0 motion vector of the corresponding candidate in the first merge list; and each uni-prediction merge candidate having a merge index value within a second range comprises a List 1 motion vector of the corresponding candidate in the first merge list.

5 . An apparatus for video decoding, comprising:
one or more processors; and a memory configured to store instructions executable by the one or more processors; wherein the one or more processors, upon execution of the instructions, is configured to: obtain, from a video bitstream, a plurality of coding units (CUs) partitioned from video pictures, wherein at least one of the CUs is further portioned into two prediction units (PUs) including at least one geometric shaped PU; derive a first merge list comprising a plurality of candidates, each comprising one or more motion vectors; and obtain a plurality of uni-prediction merge candidates by directly accessing the candidates of the first merge list without creating a uni-prediction merge candidate list, wherein each uni-prediction merge candidate comprises one motion vector of a corresponding candidate in the first merge list, wherein each candidate in the first merge list comprises at least one of a List 0 motion vector or a List 1 motion vector, and each uni-prediction merge candidate is associated with a merge index of integer value and comprises a single one of the List 0 and List 1 motion vectors of each candidate in the first merge list selected based on parity of the merge index.

6 . The apparatus of claim 5 , wherein each uni-prediction merge candidate having a merge index value comprises a List 0 or List 1 motion vector of the corresponding candidate in the first merge list with the same merge index.

7 . The apparatus of claim 5 , wherein each uni-prediction merge candidate having an even merge index value comprises a List 0 motion vector of the corresponding candidate in the first merge list upon determining that the List 0 motion vector is available; or a List 1 motion vector of the corresponding candidate in the first merge list upon determining that the List 0 motion vector is not available; and
wherein each uni-prediction merge candidate having an odd merge index value comprises a List 1 motion vector of the corresponding candidate in the first merge list upon determining that the List 1 motion vector is available; or a List 0 motion vector of the corresponding candidate in the first merge list upon determining that the List 1 motion vector is not available.

8 . The apparatus of claim 5 , wherein each uni-prediction merge candidate having a merge index value within a first range comprises a List 0 motion vector of the corresponding candidate in the first merge list; and each uni-prediction merge candidate having a merge index value within a second range comprises a List 1 motion vector of the corresponding candidate in the first merge list.

9 . A non-transitory computer readable storage medium, comprising instructions stored therein, wherein, upon execution of the instructions by one or more processors, the instructions cause the one or more processors to perform acts comprising:
obtaining, from a video bitstream, a plurality of coding units (CUs) partitioned from video pictures, wherein at least one of the CUs is further portioned into two prediction units (PUs) including at least one geometric shaped PU; deriving a first merge list comprising a plurality of candidates, each comprising one or more motion vectors; and obtaining a plurality of uni-prediction merge candidates by directly accessing the candidates of the first merge list without creating a uni-prediction merge candidate list, wherein each uni-prediction merge candidate comprises one motion vector of a corresponding candidate in the first merge list, wherein each candidate in the first merge list comprises at least one of a List 0 motion vector or a List 1 motion vector, and each uni-prediction merge candidate is associated with a merge index of integer value and comprises a single one of the List 0 and List 1 motion vectors of each candidate in the first merge list selected based on parity of the merge index.

10 . The non-transitory computer readable storage medium of claim 9 , wherein each uni-prediction merge candidate having a merge index value comprises a List 0 or List 1 motion vector of the corresponding candidate in the first merge list with the same merge index.

11 . The non-transitory computer readable storage medium of claim 9 , wherein each uni-prediction merge candidate having an even merge index value comprises a List 0 motion vector of the corresponding candidate in the first merge list upon determining that the List 0 motion vector is available; or a List 1 motion vector of the corresponding candidate in the first merge list upon determining that the List 0 motion vector is not available; and
wherein each uni-prediction merge candidate having an odd merge index value comprises a List 1 motion vector of the corresponding candidate in the first merge list upon determining that the List 1 motion vector is available; or a List 0 motion vector of the corresponding candidate in the first merge list upon determining that the List 1 motion vector is not available.

12 . The non-transitory computer readable storage medium of claim 9 , wherein each uni-prediction merge candidate having a merge index value within a first range comprises a List 0 motion vector of the corresponding candidate in the first

Assignees

• Beijing Dajia Internet Information Tech Co Ltd

Inventors

• Wang Xianglin
• Chen Yi-Wen
• Xiu Xiaoyu
• Ma Tsung-Chuan

Classifications

• H04N19/44

  Decoders specially adapted therefor, e.g. video decoders which are asymmetric with respect to the encoder · CPC title

• H04N19/176

  the region being a block, e.g. a macroblock · CPC title

• H04N19/119 Primary

  Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks · CPC title

• H04N19/105 Primary

  Selection of the reference unit for prediction within a chosen coding or prediction mode, e.g. adaptive choice of position and number of pixels used for prediction · CPC title

• H04N19/577

  Motion compensation with bidirectional frame interpolation, i.e. using B-pictures · CPC title