# US 2024/0267567 A1 · Systems and methods for blending block sections in a partition-based prediction mode

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2024/0267567 A1
- Document ID: US20240267567A1
- Status: Published application
- Kind: A1
- Application number: 18/244,827
- Filed: 2023-09-11
- Published: 2024-08-08
- Earliest claimed: 2023-02-03
- Assignees: Tencent America LLC
- Applicants: Tencent America LLC
- Inventors: Han Gao; Xin Zhao; Liang Zhao; Jing YE; Shan Liu
- Web page: https://patentgrep.com/patent/US20240267567A1

## CPC

- H04N 19/86: involving reduction of coding artifacts, e.g. of blockiness
- H04N 19/117: Filters, e.g. for pre-processing or post-processing (sub-band filter banks H04N19/635)
- H04N 19/124: Quantisation
- H04N 19/157: Assigned coding mode, i.e. the coding mode being predefined or preselected to be further used for selection of another element or parameter
- H04N 19/176: the region being a block, e.g. a macroblock
- H04N 19/70: characterised by syntax aspects related to video coding, e.g. related to compression standards
- H04N 19/82: involving filtering within a prediction loop
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

The various implementations described herein include methods and systems for encoding and decoding video. In one aspect, a method of video decoding includes receiving video data that includes a first block from a bitstream, where the first block is encoded using a first partition mode. The method further includes identifying first and second sections of the first block and identifying blending values for blending the first and second sections. The blending values are obtained from one or more lookup tables (LUTs). The LUTs include values ranging from 0 to N, a first value in the LUTs is set to 0 and corresponds to a portion that is outside of a first blending region, and a second value in the LUTs is set to N and corresponds to a portion that is outside of a second blending region. The method also includes decoding the first block using the blending values.

## Claims

### Claim 1

A method of video decoding performed at a computing system having memory and one or more processors, the method comprising:
receiving video data comprising a plurality of blocks, including a first block, from a video bitstream, wherein the first block is encoded using a first partition mode;
in accordance with the first partition mode, identifying a first section of the first block and a second section of the first block;
identifying a plurality of blending values for blending the first section and the second section, the plurality of blending values obtained from one or more lookup tables,
wherein the one or more lookup tables include values ranging from 0 to N, N being a positive integer,
wherein at least a first value corresponding to a last position in the one or more lookup tables is set to 0 and corresponds to a portion of the first section that is outside of a first blending region, and
wherein a second value in the one or more lookup tables is set to N and corresponds to a portion of the second section that is outside of a second blending region; and
decoding the first block using the plurality of blending values.

### Claim 2 (depends on 1)

The method of claim 1, wherein at least a subset of the plurality of blending values correspond to a non-linear blending function.

### Claim 3 (depends on 2)

The method of claim 2, wherein the non-linear blending function is a sigmoid function.

### Claim 4 (depends on 2)

The method of claim 2, further comprising identifying a coefficient for the non-linear blending function, wherein the coefficient is signaled in the video bitstream or derived, and wherein the plurality of blending values are identified using the coefficient.

### Claim 5 (depends on 4)

The method of claim 4, wherein the coefficient is a blending weight factor for a sigmoid function.

### Claim 6 (depends on 4)

The method of claim 4, wherein the coefficient defines a blending area for the first section and/or the second section.

### Claim 7 (depends on 1)

The method of claim 1, wherein the one or more lookup tables include a first lookup table with values {32, 32, 31, 31, 30, 30, 29, 29, 28, 28, 27, 27, 26, 26, 25, 25, 24, 24, 23, 23, 22, 22, 21, 21, 21, 20, 20, 19, 19, 18, 18, 18, 17, 17, 16, 16, 16, 15, 15, 15, 14, 14, 14, 13, 13, 13, 12, 12, 12, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 0}.

### Claim 8 (depends on 1)

The method of claim 1, wherein the one or more lookup tables include a second lookup table with values {32, 32, 33, 33, 34, 34, 35, 35, 36, 36, 37, 37, 38, 38, 39, 39, 40, 40, 41, 41, 42, 42, 43, 43, 43, 44, 44, 45, 45, 46, 46, 46, 47, 47, 48, 48, 48, 49, 49, 49, 50, 50, 50, 51, 51, 51, 52, 52, 52, 53, 53, 53, 53, 54, 54, 54, 55, 55, 55, 55, 55, 56, 56, 56, 56, 57, 57, 57, 57, 57, 58, 58, 58, 58, 58, 58, 59, 59, 59, 59, 59, 59, 59, 60, 60, 60, 60, 60, 60, 60, 60, 60, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 63, 63, 63, 63, 63, 63, 63, 64}.

### Claim 9 (depends on 1)

The method of claim 1, wherein the first blending region has a different width than the second blending region.

### Claim 10 (depends on 1)

The method of claim 1, wherein the one or more lookup tables include quantized values of a non-linear blending function.

### Claim 11 (depends on 10)

The method of claim 10, further comprising constructing the one or more lookup tables, including:
determining a weighting factor from the non-linear blending function; and
obtaining a quantized weighting factor by dividing the weighting factor by a quantization step size and rounding to a nearest integer.

### Claim 12 (depends on 11)

The method of claim 11, wherein constructing the one or more lookup tables further comprises adjusting the quantized weighting factor by a preset offset prior to insertion into the one or more lookup tables.

### Claim 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, including a first block, from a video bitstream, wherein the first block is encoded using a first partition mode;
in accordance with the first partition mode, identifying a first section of the first block and a second section of the first block;
identifying a plurality of blending values for blending the first section and the second section, the plurality of blending values obtained from one or more lookup tables, wherein the one or more lookup tables include values ranging from 0 to N, N being a positive integer, wherein at least a first value corresponding to a last position in the one or more lookup tables is set to 0 and corresponds to a portion of the first section that is outside of a first blending region, and wherein a second value in the one or more lookup tables is set to N and corresponds to a portion of the second section that is outside of a second blending region; and
decoding the first block using the plurality of blending values.

### Claim 14 (depends on 13)

The computing system of claim 13, wherein at least a subset of the plurality of blending values correspond to a non-linear blending function.

### Claim 15 (depends on 14)

The computing system of claim 14, wherein the non-linear blending function is a sigmoid function.

### Claim 16 (depends on 14)

The computing system of claim 14, wherein the one or more sets of instructions further comprise instructions for identifying a coefficient for the non-linear blending function, wherein the coefficient is signaled in the video bitstream or derived, and wherein the plurality of blending values are identified using the coefficient.

### Claim 17 (depends on 13)

The computing system of claim 13, wherein the one or more lookup tables include quantized values of a non-linear blending function.

### Claim 18

A non-transitory computer-readable storage medium storing one or more sets of instructions configured for execution by a computing device having control circuitry and memory, the one or more sets of instructions comprising instructions for:
receiving video data comprising a plurality of blocks, including a first block, from a video bitstream, wherein the first block is encoded using a first partition mode;
in accordance with the first partition mode, identifying a first section of the first block and a second section of the first block;
identifying a plurality of blending values for blending the first section and the second section, the plurality of blending values obtained from one or more lookup tables, wherein the one or more lookup tables include values ranging from 0 to N, N being a positive integer, wherein at least a first value corresponding to a last position in the one or more lookup tables is set to 0 and corresponds to a portion of the first section that is outside of a first blending region, and wherein a second value in the one or more lookup tables is set to N and corresponds to a portion of the second section that is outside of a second blending region; and
decoding the first block using the plurality of blending values.

### Claim 19 (depends on 18)

The non-transitory computer-readable storage medium of claim 18, wherein at least a subset of the plurality of blending values correspond to a non-linear blending function.

### Claim 20 (depends on 19)

The non-transitory computer-readable storage medium of claim 19, wherein the non-linear blending function is a sigmoid function.
