Video Decoding GPM Blending Width Selection for Coding Efficiency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding methods using geometric partitioning mode (GPM) face inefficiencies due to the selection of a single blending width that may not match various color distributions in image frames, leading to increased bit usage and reduced coding efficiency.
Innovation Solution
A method and device for selecting a blending width in GPM by determining a partitioning line, generating predicted blocks, and combining them weightedly based on candidate widths, using block size thresholds and template regions for precise width determination.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If a single blending width is used for all block units, then device complexity is reduced, but manufacturing precision deteriorates because it cannot match various color distributions
Solution Approach 1:
The patent changes the blending width parameter adaptively based on block size. Different block size ranges correspond to different blending width values, allowing the system to optimize color distribution matching for various block types without requiring complex per-block optimization
Solution Approach 2:
The patent applies different blending width values to different local regions (block units) based on their size characteristics. This local adaptation allows each block to have an optimized blending width suited to its specific color distribution patterns
2Manufacturing precision
If the last candidate width is always selected for each block, then manufacturing precision is improved by matching color distribution, but loss of information increases due to higher bit usage
Solution Approach 1:
The patent changes the blending width candidate selection based on block size. Instead of always using the last candidate width, the system selects from different candidate sets depending on block dimensions, reducing the number of bits needed to encode width information while maintaining precision
Solution Approach 2:
The patent applies different candidate width sets to different block size categories. Smaller blocks use one set of candidates while larger blocks use another, optimizing the balance between precision and bit usage for each local region
3Manufacturing precision
If template matching is performed for all candidate widths, then manufacturing precision is improved by finding optimal blending width, but productivity decreases due to increased processing time
Solution Approach 1:
The patent changes the number of candidate widths evaluated based on block size. By reducing the candidate set for certain block types, the system maintains optimization accuracy while significantly reducing processing time
Solution Approach 2:
The patent performs template matching on a selective subset of candidate widths rather than all possible candidates. This partial evaluation approach achieves sufficient optimization without the full computational cost of evaluating every candidate
Data Source
AI summary
A method of decoding video data by an electronic device is provided. The electronic device receives the video data and determines a block unit from a current frame included in the video data. The electronic device determines, from multiple candidate lines, a partitioning line for dividing the block unit into a pair of geometric partitions using a geometric partitioning mode and, from multiple candidate modes, two different prediction modes of the block unit to generate two predicted blocks for the pair of the geometric partitions. The electronic device determines a blending width of the partitioning line from multiple candidate widths based on a block size of the block unit and weightedly combining the two predicted blocks along the partitioning line based on the blending width to reconstruct the block unit.