Adaptive Blending Width Selection in Geometric Partition Mode
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding technologies face challenges in efficiently compressing video data, particularly in handling geometric partitions and adaptive blending techniques to improve compression efficiency and quality.
Innovation Solution
The proposed solution involves an apparatus and method for video encoding and decoding that utilizes a geometric partition mode (GPM) along a partition edge. It includes adaptive blending using template matching (TM) to reorder width candidates based on a current template and reference templates, determining a blending area width, and reconstructing samples within the blending area.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If a fixed blending area width is used in GPM, then the decoding process is simple and fast, but the compression efficiency and reconstruction accuracy are limited
Solution Approach 1:
The patent implements dynamic blending area width selection by reordering width candidates based on template matching results. Instead of using a fixed width, the system adaptively determines the optimal blending area width for each partition edge based on local image characteristics, thereby improving compression efficiency while maintaining reasonable decoding complexity through conditional reordering operations.
Solution Approach 2:
The patent changes the parameter of blending area width from a fixed value to an adaptively selected value from multiple candidates. By introducing multiple width candidates and selecting the optimal one based on template matching, the system improves reconstruction accuracy and compression efficiency without requiring complex optimization algorithms, thus balancing performance gain with computational complexity.
2Measurement precision
If template matching is applied to reorder width candidates, then the accuracy of sample reconstruction is improved, but the computational complexity increases
Solution Approach 1:
The patent applies template matching selectively rather than universally. It reorders width candidates based on template matching results when beneficial, but does not require full exhaustive search or complex optimization. This partial application of template matching improves reconstruction accuracy while limiting computational overhead by avoiding unnecessary complex operations in all cases.
3Manufacturing precision
If adaptive blending with multiple width candidates is implemented, then the video quality is improved, but the encoding and decoding time increases
Solution Approach 1:
The patent performs preliminary reordering of width candidates based on template matching results before the actual blending operation. By pre-processing and organizing the width candidates in an optimal sequence, the system improves video quality through adaptive selection while reducing the time required during the actual decoding and blending operations, as the optimal width is already determined in advance.
Data Source
AI summary
Aspects of the disclosure provide a method and an apparatus including processing circuitry that decodes a value of a syntax element that indicates whether a current block is coded with a geometric partition mode (GPM) along a partition edge intersecting the current block. If the value of the syntax element indicates that the current block is coded with the GPM and a condition for adaptive blending is satisfied, width candidates in a width candidate list are reordered using template matching (TM) that is based on a current template of the current block and reference templates that correspond to the respective width candidates. A width candidate is selected from the reordered width candidate list. A width of a blending area defined by boundaries on both sides of the partition edge is determined based on the selected width candidate. The blending area is determined based on the width of the blending area.