Encoder, a decoder and corresponding methods for merge mode

Patent metadata

Field	Value
Publication number	US-11909959-B2
Application number	US-202117324401-A
Country	US
Kind code	B2
Filing date	May 19, 2021
Priority date	Nov 20, 2018
Publication date	Feb 20, 2024
Grant date	Feb 20, 2024

Abstract

The present disclosure provides methods and devices of processing a block according to a merge candidate list, the method comprising: constructing a first list according to motion information of neighboring blocks of a current block; obtaining prediction information of the current block; when the prediction information of the current block indicates that a sub-block prediction is applied to the current block, obtaining a uni-prediction candidate for the current block according to the first list; using, the uni-prediction candidate for the current block to perform inter prediction of the current block. According to embodiment of the present disclosure, the regular merge list can be directly used and there is no need to explicitly generate the uni-prediction merge candidate list for sub-block prediction.

First claim

The invention claimed is:

1. A method of processing a block according to a merge candidate list, the method comprising:
constructing a first list according to motion information of neighboring blocks of a current block, wherein the motion information includes the information whether one or two reference picture lists are used, a reference index, and a motion vector for each reference picture list, and wherein the first list is a merge candidate list;
obtaining prediction information of the current block;
if the prediction information of the current block indicates that a sub-block prediction is applied to the current block,
obtaining a uni-prediction candidate for the current block according to the first list; and
using, the uni-prediction candidate for the current block to perform inter prediction of the current block,
wherein constructing the first list further comprises:
after checking whether a neighboring block is available and contains the motion information, performing redundancy checks before using the motion information of the neighboring blocks as merge candidates in the first list, wherein the redundancy checks ensure that the merge candidates with same motion information are excluded from the first list, and wherein the redundancy checks include a first redundancy check performed among left, top-right, top, and top-left neighboring blocks, and a second redundancy check performed among left, bottom-left, and top-left neighboring blocks.

2. The method of claim 1 , wherein the current block comprises two sub-blocks, and wherein each sub-block corresponds to a uni-prediction candidate, and wherein the uni-prediction candidate is obtained without generating a uni-prediction merge candidate list for the sub-block prediction.

3. The method of claim 1 , wherein one uni-prediction candidate is generated according to one bi-prediction candidate of the first list.

4. The method of claim 1 , wherein two uni-prediction candidates are generated according to one bi-prediction candidate of the first list.

5. The method of claim 3 , wherein one uni-prediction candidate is a first part of the bi-prediction candidate.

6. The method of claim 3 , wherein one uni-prediction candidate is a second part of the bi-prediction candidate.

7. The method of claim 1 , wherein the sub-block prediction is a triangular prediction.

8. The method of claim 4 , wherein generation of the two uni-prediction candidates according to the one bi-prediction candidate of the first list comprise:
determining a similarity between the two uni-prediction candidates.

9. The method of claim 1 , wherein the uni-prediction candidate is generated according to a bi-prediction candidate of the first list based on a candidate order in the first list.

10. A non-transitory computer-readable medium having stored thereon instructions that, when executed by one or more processors, cause the one or more processors to perform operations including:
constructing a first list according to motion information of neighboring blocks of a current block, wherein the motion information includes the information whether one or two reference picture lists are used, a reference index, and a motion vector for each reference picture list, and wherein the first list is a merge candidate list;
obtaining prediction information of the current block;
if the prediction information of the current block indicates that a sub-block prediction is applied to the current block,
obtaining a uni-prediction candidate for the current block according to the first list; and
using, the uni-prediction candidate for the current block to perform inter prediction of the current block,
wherein constructing the first list further comprises:
after checking whether a neighboring block is available and contains the motion information, performing redundancy checks before using the motion information of the neighboring blocks as merge candidates in the first list, wherein the redundancy checks ensure that the merge candidates with same motion information are excluded from the first list, and wherein the redundancy checks include a first redundancy check performed among left, top-right, top, and top-left neighboring blocks, and a second redundancy check performed among left, bottom-left, and top-left neighboring blocks.

11. The non-transitory computer-readable medium of claim 10 , wherein the current block comprises two sub-blocks, and wherein each sub-block corresponds to a uni-prediction candidate, and wherein the uni-prediction candidate is obtained without generating a uni-prediction merge candidate list for the sub-block prediction.

12. The non-transitory computer-readable medium of claim 10 , wherein one uni-prediction candidate is generated according to one bi-prediction candidate of the first list.

13. The non-transitory computer-readable medium of claim 12 , wherein one uni-prediction candidate is a first part of the bi-prediction candidate.

14. The non-transitory computer-readable medium of claim 12 , wherein one uni-prediction candidate is a second part of the bi-prediction candidate.

15. A decoder, comprising:
one or more processors; and a non-transitory computer-readable storage medium coupled to the processors and storing instructions for execution by the processors, wherein the instructions, when executed by the processors, causes the decoder to:
construct a first list according to motion information of neighboring blocks of a current block, wherein the motion information includes the information whether one or two reference picture lists are used, a reference index, and a motion vector for each reference picture list, and wherein the first list is a merge candidate list;
obtain prediction information of the current block;
if the prediction information of the current block indicates that a sub-block prediction is applied to the current block,
obtain a uni-prediction candidate for the current block according to the first list; and

use, the uni-prediction candidate for the current block to perform inter prediction of the current block,
wherein constructing the first list further comprises:
after checking whether a neighboring block is available and contains the motion information, performing redundancy checks before using the motion information of the neighboring blocks as merge candidates in the first list, wherein the redundancy checks ensure that the merge candidates with same motion information are excluded from the first list, and wherein the redundancy checks include a first redundancy check performed among left, top-right, top, and top-left neighboring blocks, and a second redundancy check performed among left, bottom-left, and top-left neighboring blocks.

16. The decoder of claim 15 , wherein the current block comprises two sub-blocks, and wherein each sub-block corresponds to a uni-prediction candidate, and wherein the uni-prediction candidate is obtained without generating a uni-prediction merge candidate list for the sub-block prediction.

17. The decoder of claim 15 , wherein one uni-prediction candidate is generated according to one bi-prediction candidate of the first list.

18. The decoder of claim 17 , wherein one uni-prediction candidate is a first part of the bi-prediction candidate.

19. The decoder of claim 17 , wherein one uni-prediction candidate is a second part of the bi-prediction candidate.

20. The decoder of claim 15 , wherein the sub-block prediction is a triangular prediction.

Assignees

• Huawei Tech Co Ltd

Inventors

• Solovyev Timofey Mikhailovich
• Esenlik Semih
• Chen Jianle
• Kotra Anand Meher
• Wang Biao
• Gao Han

Classifications

• H04N19/44

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

• H04N19/105

  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/176

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

• H04N19/82

  involving filtering within a prediction loop · CPC title

• H04N19/119

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