Image Encoder Boundary Smoothing for Triangular Block Prediction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding technologies face challenges in efficiently processing increasing amounts of digital video data, particularly in inter and intra prediction functions, especially when image blocks are split into non-rectangular shapes like triangles, leading to inefficiencies in encoding and decoding processes.
Innovation Solution
Implementing a boundary smoothing operation that derives and weights motion vectors for triangular partitions within image blocks, using inter and intra prediction methods to enhance encoding and decoding efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If image blocks are split into non-rectangular shapes (triangles) for inter/intra prediction, then prediction accuracy is improved, but encoding complexity and processing time increase
Solution Approach 1:
The image block is segmented into multiple triangular partitions, each with its own motion vector candidates. This segmentation allows for more precise prediction at block boundaries while managing complexity through structured partitioning and candidate selection processes.
Solution Approach 2:
Different motion vector candidates are derived for different triangular partitions based on their specific spatial relationships with reference blocks. This local quality approach ensures that each partition uses the most appropriate motion candidates for its geometry, improving prediction accuracy without uniformly increasing complexity across the entire block.
2Manufacturing precision
If multiple motion vector candidates are derived for triangular partitions, then boundary smoothing quality is improved, but computational load increases
Solution Approach 1:
Instead of deriving motion vectors for every possible partition configuration, the method selectively derives motion vector candidates only for the necessary triangular partitions that require boundary smoothing. This partial action approach maintains quality where needed while reducing unnecessary computational load in regions that don't require such processing.
Solution Approach 2:
The method changes the parameter of motion vector representation by deriving multiple candidates with different reference block relationships. This allows the system to select the most appropriate candidate for each triangular partition, achieving high boundary smoothing quality while managing computational load through intelligent parameter selection rather than exhaustive processing.
3Productivity
If advanced motion vector prediction and weighting techniques are used for triangular partitions, then encoding efficiency is improved, but processing speed decreases
Solution Approach 1:
Motion vector candidates are derived in advance during the encoding process for triangular partitions. This preliminary action allows the decoder to directly use these pre-computed candidates without performing complex calculations, thereby improving decoding speed while maintaining the encoding efficiency benefits of advanced motion vector prediction and weighting techniques.
Data Source
AI summary
An encoder includes circuitry and a memory coupled to the circuitry, wherein the circuitry, in operation, performs a partition process. The partition process includes calculating first values of a set of pixels between a first partition and a second partition in a current block, using a first motion vector for the first partition; calculating second values of the set of pixels, using a second motion vector for the second partition; and calculating third values of the set of pixels by weighting the first values and the second values. When a ratio of a width to a height of the current block is larger than 4 or a ratio of the height to the width of the current block is larger than 4, the circuitry disables the partition process.