Segmentation-Based Video Block Partitioning for Coding Efficiency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current video coding schemes face inefficiencies in coding efficiency, particularly at object boundaries in video sequences, due to redundancy introduced by rectangular block partitioning, which can be improved through segmentation-based partitioning but faces challenges in computational complexity and data rate efficiency.
Innovation Solution
The proposed solution involves an apparatus and method for encoding and decoding video signals using segmentation-based partitioning of video coding blocks, where a video coding block is partitioned into segments with associated motion vectors, and the encoding processor encodes these segments based on neighboring block motion vectors, selecting the optimal partition based on rate-distortion measures to minimize redundancy.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If rectangular block partitioning is used for motion partitioning, then the coding scheme is simple to implement, but coding efficiency deteriorates at object boundaries due to redundancy
Solution Approach 1:
The patent applies segmentation by dividing video coding blocks into multiple segments with different motion characteristics. Instead of treating the entire block uniformly, the method segments the block into regions with coherent motion, allowing each segment to be coded independently with appropriate motion vectors, thereby reducing redundancy at object boundaries while maintaining implementation feasibility.
Solution Approach 2:
The patent implements local quality by allowing different parts of the video block to have different partitioning characteristics. Specifically, segments near object boundaries are partitioned differently from uniform regions, with motion vectors adapted to local motion characteristics. This enables the coding scheme to optimize for local motion patterns rather than applying a uniform partitioning approach throughout the entire block.
2Adaptability or versatility
If geometric motion partitioning is used to partition blocks via straight lines, then flexibility in motion partitioning is improved, but computational complexity increases due to exhaustive search
Solution Approach 1:
The patent applies preliminary action by performing segmentation based partitioning before final motion partitioning decisions. The method first identifies potential segment boundaries using segmentation techniques, then uses these pre-identified boundaries to guide the motion partitioning process. This preliminary segmentation step reduces the search space for optimal partitioning lines, thereby maintaining flexibility while reducing computational complexity compared to exhaustive search methods.
3Productivity
If segmentation based partitioning is used to partition blocks along actual object boundaries, then coding efficiency is improved, but data rate increases due to additional side information
Solution Approach 1:
The patent applies the taking out principle by extracting only the essential segmentation information needed for motion partitioning, rather than transmitting complete boundary descriptions. The method extracts key segment boundary locations and associated motion vectors, discarding redundant boundary representation data. This extraction approach maintains the benefits of accurate object boundary partitioning while significantly reducing the amount of side information that needs to be transmitted.
4Manufacturing precision
If fine quadtree decomposition is used to partition blocks, then object boundaries are better represented, but redundancy is introduced along boundaries decreasing coding efficiency
Solution Approach 1:
The patent applies dynamics by making the partitioning structure adaptive rather than static. The method dynamically adjusts the decomposition level and partitioning strategy based on local content characteristics, particularly at object boundaries. Instead of uniformly applying fine quadtree decomposition throughout the block, the system dynamically determines where finer partitioning is needed versus where coarser partitioning suffices, thereby achieving accurate boundary representation without introducing unnecessary redundancy in uniform regions.
Data Source
AI summary
The invention relates to an encoding apparatus for processing a video signal comprising a plurality of frames dividable into video coding blocks. A first video coding block of a current frame of the video signal is partitioned into a first segment associated with a first segment motion vector relative to a first reference frame of the video signal and a second segment. The first video coding block is associated with a plurality of virtual partitions. Each virtual partition is associated with a respective subset of the plurality of video coding blocks of the current frame. Each video coding block of the respective subset neighbors the first video coding block and is associated with a motion vector.