Video Block Partitioning Pattern Association via Segmentation Masks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current video coding techniques face high computational complexity in efficiently processing irregularly shaped video coding block partitions, limiting coding efficiency in modern video codecs.
Innovation Solution
A method to select a video block partitioning pattern from a group of patterns based on values of samples within a segmentation mask, using decision trees, logical gates, or look-up tables, allowing efficient association of partitioning patterns to video coding blocks, reducing the number of samples processed from four to six.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If cross-correlation based techniques are used for mapping video block partitioning patterns onto segmentation masks, then the mapping can be performed, but the computational complexity becomes high
Solution Approach 1:
The patent segments the segmentation mask into multiple regions (e.g., foreground and background regions) and processes each region separately to determine partitioning patterns. This segmentation approach reduces the overall computational complexity by breaking down the large-scale cross-correlation problem into smaller, more manageable sub-problems that can be solved independently and more efficiently.
Solution Approach 2:
The patent extracts key features and characteristics from the segmentation mask and reference patterns, focusing only on the essential elements needed for pattern matching. By extracting and processing only the relevant features rather than performing full cross-correlation on all pixels, the computational complexity is significantly reduced while maintaining mapping accuracy.
2Adaptability or versatility
If irregularly shaped video coding block partitions are processed using conventional techniques, then the partitions can be handled, but the processing efficiency is limited
Solution Approach 1:
The patent employs dynamic programming techniques to efficiently search and determine the optimal partitioning pattern configuration that best matches the irregular segmentation mask. This dynamic approach allows the system to adapt to various irregular shapes while maintaining high processing efficiency by making optimal local decisions that contribute to the global optimal solution.
Solution Approach 2:
The patent transforms the irregular partitioning problem into a parameter optimization problem by defining objective functions and constraints based on geometric parameters. By changing the problem formulation from direct pixel-level processing to parameter-based optimization, the processing efficiency is improved while maintaining adaptability to irregular shapes.
Data Source
AI summary
Embodiments of the invention relates to an apparatus for associating a video block partitioning pattern to a video coding block, wherein the apparatus comprises: an obtainer adapted to obtain values of a set of segmentation mask samples, wherein each segmentation sample of the set of segmentation mask samples represents a different position in a segmentation mask adapted to define video coding block partitions of the video coding block; a selector adapted to select a video block partitioning pattern from a predetermined group of video block partitioning patterns based on the values of segmentation mask samples of the set of segmentation mask samples; andan associator adapted to associate the selected video block partitioning pattern to the video coding block.