Geometry Partition Blending Weights for Video Coding Efficiency

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current video coding standards face challenges in efficiently managing motion candidates, leading to increased computational complexity and reduced coding efficiency, particularly in handling default motion candidates and filling candidate lists to maximize compression performance.

Innovation Solution

The introduction of default motion candidates, such as a six-parameter affine merge candidate, is implemented to be added to the motion candidate list when the number of candidates is less than a maximum value, ensuring complete lists and optimizing the video processing method for both existing and future video coding standards like HEVC.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If default motion candidates are added to complete the motion candidate list, then coding efficiency is improved, but device complexity increases

Engineering Contradiction:
Improvecoding efficiencyVSAvoiddevice complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent applies preliminary action by pre-defining default motion candidates (such as zero motion vector candidates or affine merge candidates) that are automatically added to the motion candidate list when the list is not sufficiently populated. This advance preparation ensures that the candidate list is always complete without requiring complex runtime decisions, thereby improving coding efficiency while keeping the complexity manageable through standardized procedures.

Inventive Principle:
Principle #10Preliminary action

2Productivity

If the motion candidate list is completed with default candidates, then compression performance is improved, but computational complexity increases

Engineering Contradiction:
Improvecompression performanceVSAvoidcomputational complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent applies self-service by implementing a mechanism where the motion candidate list automatically fills itself with default candidates when it has fewer than the maximum allowed candidates. This self-completing behavior eliminates the need for external intervention or complex algorithms to generate sufficient candidates, thereby improving compression performance while minimizing the increase in computational complexity through a simple and efficient self-service approach.

Inventive Principle:
Principle #25Self-service

3Productivity

If default motion candidates are used to fill candidate lists, then coding efficiency is improved, but ease of operation deteriorates

Engineering Contradiction:
Improvecoding efficiencyVSAvoidease of operation
Core Design Contradiction:
ProductivityVSEase of operation

Solution Approach 1:

The patent applies parameter changes by modifying the motion candidate list generation process to automatically include default candidates based on predefined parameters and conditions. This parameter-based approach ensures that the candidate list is always sufficiently populated without requiring manual intervention or complex operational procedures, thereby improving coding efficiency while maintaining ease of operation through standardized and predictable parameter-driven behavior.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS11924421B2Blending method for inter prediction with geometry partition
Publication Date: 2024.03.05 DOUYIN VISION CO LTD
  • US11924421B2 patent drawing
  • US11924421B2 patent drawing
  • US11924421B2 patent drawing

AI summary

Devices, systems and methods for digital video coding, which includes using default motion candidates for video coding, are described. An exemplary method for video processing includes determining, for a conversion between a block of a video and a bitstream representation of the video, weights to use for a weighted average of prediction samples along an edge of two partitions of the block. The two partitions are generated according to a geometry partition mode, and the weights are selected from a first weighting factor group that at least one of the weights is equal to 0 or 1. The method also includes performing the conversion based on the determining.