Video Border Partitioning for Reduced Bit Signaling
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding standards, such as HEVC, face inefficiencies in handling picture borders, particularly when CTB sizes exceed 64x64, leading to increased bit signaling and reduced compression performance.
Innovation Solution
The proposed method segments pictures into smaller blocks (K×L) within the picture segment, using a partition tree based on the size of these blocks to efficiently process borders, allowing for flexible partitioning structures like QTBT and TT, and padding blocks to align with standard sizes for backward compatibility.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If larger CTB sizes (128x128 or 256x256) are used in video coding, then compression efficiency is improved, but bit signaling overhead increases and handling complexity worsens
Solution Approach 1:
The patent segments large CTBs (128x128 or 256x256) into smaller sub-blocks (e.g., 64x64 or 32x32) using partition trees. This segmentation allows efficient handling of border regions while maintaining the benefits of large block processing, thereby reducing bit signaling overhead without sacrificing compression efficiency.
Solution Approach 2:
The patent applies different processing strategies to different regions within CTBs. Border regions are handled with special partitioning rules and smaller block sizes, while interior regions use standard large-block processing. This local differentiation optimizes compression efficiency while controlling signaling overhead in critical border areas.
2Productivity
If larger CTB sizes (128x128 or 256x256) are used in video coding, then compression efficiency is improved, but processing complexity worsens
Solution Approach 1:
The patent divides large CTBs into smaller sub-blocks through partition trees, making processing more manageable. This segmentation reduces the complexity of handling large blocks while preserving compression efficiency by allowing adaptive processing at different hierarchical levels.
Solution Approach 2:
The patent introduces dynamic partitioning where the block size and partitioning structure adapt based on position within the CTB and content characteristics. Border regions use different partitioning rules than interior regions, allowing the system to dynamically adjust processing complexity to where it is most needed.
3Productivity
If flexible partitioning structures (QTBT, TT) are used, then compression performance is improved, but compatibility with existing standards worsens
Solution Approach 1:
The patent uses partition trees to segment CTBs into sub-blocks, creating a hierarchical structure that can represent both traditional fixed partitions and new flexible partitions. This segmentation approach enables flexible partitioning structures while maintaining a standardized interface for compatibility with existing video coding standards.
Solution Approach 2:
The patent designs the partition tree structure to serve multiple functions: it can represent traditional fixed partitions for backward compatibility, while also enabling flexible adaptive partitions for improved compression performance. This universal structure handles both legacy and advanced partitioning requirements through a single unified mechanism.
Data Source
AI summary
Devices, systems and methods for picture border coding are described. In a representative aspect, a method for processing picture includes segmenting a picture into one or multiple picture segments, determining that a first block of a picture segment covers at least one region that is outside a border of the picture segment, wherein a size of the first block is M×N pixels, selecting a second block of size K×L pixels, where (K≤M and L<N) or (K<M and L≤N), wherein the second block falls entirely within the picture segment and wherein the second block is used as a largest coding unit, a leaf coding block or a coding tree block; and processing, using a partition tree, the border of the picture segment, wherein the partition tree is based on the size of the second block.