Inter prediction in geometric partitioning with an adaptive number of regions

Patent metadata

Field	Value
Publication number	US-11259014-B2
Application number	US-202017006508-A
Country	US
Kind code	B2
Filing date	Aug 28, 2020
Priority date	Jan 28, 2019
Publication date	Feb 22, 2022
Grant date	Feb 22, 2022

Abstract

A decoder includes circuitry configured to receive a bitstream, partition a current block via a geometric partitioning mode into three portions, determine a motion vector associated with a portion of the three portions, wherein determining further includes constructing a candidate list, and decode the current block using the determined motion vector.

First claim

What is claimed is:

1. A decoder, the decoder comprising circuitry configured to:
receive a bitstream, wherein the bitstream includes a current picture, the current picture including a current block of pixels with multiple geometric partition boundaries, at least a first geometric partition boundary partitioning the block into first and second non-rectangular regions, and a second partition boundary, non-parallel to and intersecting the at least a first geometric partition boundary;
partition the second non-rectangular region of the current block via a geometric partitioning mode to partition the current block into three portions;
determine a first predictor for use on a first side of the at least a first geometric partition boundary using a first motion vector selected from a first list of motion vector candidates;
determine a second predictor for use on a second side of the at least a first geometric partition boundary using a second motion vector selected from a second list of motion vector candidates; and
decode the current block using the first motion vector and the second motion vector, wherein decoding further comprises:
smoothing the first predictor and the second predictor across the at least a first geometric partition boundary; and
adding residual pixel values to the first predictor and the second predictor.

2. The decoder of claim 1 , wherein the current block further comprises a coding tree unit.

3. The decoder of claim 1 , further configured to determine that a merge mode is enabled for a first portion of the three portions.

4. The decoder of claim 3 , further configured to decode the first portion according to the merge mode.

5. The decoder of claim 1 , further configured to determine that a merge mode is disabled for a first portion of the three portions.

6. The decoder of claim 5 , further configured to decode the first portion as a function of a motion vector difference.

7. The decoder of claim 1 , further comprising:
an entropy decoder processor configured to receive the bitstream and decode the bitstream into quantized coefficients;
an inverse quantization and inverse transformation processor configured to process the quantized coefficients including performing an inverse discrete cosine transform;
a deblocking filter;
a frame buffer; and
an intra prediction processor.

8. A method, the method comprising:
receiving, by a decoder, a bitstream, wherein the bitstream includes a current picture, the current picture including a current block of pixels with multiple geometric partition boundaries, at least a first geometric partition boundary partitioning the block into first and second non-rectangular regions, and a second partition boundary, non-parallel to and intersecting the at least a first geometric partition boundary;
partitioning, by the decoder, the second non-rectangular region of the current block via a geometric partitioning mode to partition the current block into three portions;
determining, by the decoder, a first predictor for use on a first side of the at least a first geometric partition boundary using a first motion vector selected from a first list of motion vector candidates:
determining, by the decoder, a second predictor for use on a second side of the at least a first geometric partition boundary using a second motion vector selected from a second list of motion vector candidates; and
decoding, by the decoder, the current block using the first motion vector and the second motion vector, wherein decoding further comprises:
smoothing the first predictor and the second predictor across the at least a first geometric partition boundary; and
adding residual pixel values to the first predictor and the second predictor.

9. The method of claim 8 , wherein the current block further comprises a coding tree unit.

10. The method of claim 8 further comprising determining that a merge mode is enabled for a first portion of the three portions.

11. The method of claim 10 further comprising decoding the first portion according to the merge mode.

12. The method of claim 8 further comprising determining that a merge mode is disabled for a first portion of the three portions.

13. The method of claim 12 further comprising decoding the first portion as a function of a motion vector difference.

14. The method of claim 8 , wherein the decoder further comprises:
an entropy decoder processor configured to receive the bitstream and decode the bitstream into quantized coefficients;
an inverse quantization and inverse transformation processor configured to process the quantized coefficients including performing an inverse discrete cosine transform;
a deblocking filter;
a frame buffer; and
an intra prediction processor.

Assignees

• Op Solutions Llc

Inventors

• Furht Borivoje
• Kalva Hari
• Adzic Velibor

Classifications

• H04N19/109

  among a plurality of temporal predictive coding modes · CPC title

• H04N19/119 Primary

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

• H04N19/593

  involving spatial prediction techniques · CPC title

• H04N19/513

  Processing of motion vectors · 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