Geometric Partition Coding for Efficient Video Block Decoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding technologies face challenges in achieving high compression ratios with minimal sacrifice in picture quality, particularly in limited bandwidth communication and storage scenarios.
Innovation Solution
A method for decoding video data that involves obtaining a splitting mode index and an angle index for a current coding block, using a predefined lookup table to set an index value, and decoding the block based on this index, improving buffer utilization and decoding efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If video data is compressed to reduce data size for limited bandwidth communication and storage, then the quantity of data needed to represent digital video images is decreased, but picture quality is sacrificed
Solution Approach 1:
The video data is divided into multiple coding blocks, and each block is further partitioned into sub-blocks using geometric partition modes (triangular, quadrangular, or pentagonal shapes). This segmentation allows different compression strategies to be applied to different regions, optimizing the balance between data size reduction and picture quality preservation.
Solution Approach 2:
Different geometric partition modes are selectively applied to different coding blocks based on local image characteristics. The decoder determines the appropriate partition mode for each block, allowing regions with high detail to maintain better quality while regions with smooth gradients achieve higher compression ratios.
2Productivity
If complex geometric partition modes are used to improve compression ratio, then the compression efficiency is enhanced, but the decoding complexity increases
Solution Approach 1:
The patent uses index values (partition mode indices and angle indices) to represent different geometric partition configurations. Instead of storing complex geometric descriptions, the system transmits compact index values that reference pre-defined partition modes and angles, significantly reducing the data overhead while maintaining the ability to represent diverse partition shapes.
Solution Approach 2:
Lookup tables are introduced as intermediaries between the transmitted index values and the actual geometric partition configurations. The decoder uses these tables to efficiently translate compact index values into the corresponding partition modes and angles, simplifying the decoding process while supporting complex partition geometries.
3Manufacturing precision
If more detailed partition information is transmitted to maintain picture quality, then the picture quality is preserved, but the bandwidth requirement increases
Solution Approach 1:
The patent extracts only the essential information needed to reconstruct the geometric partitions: partition mode indices and angle indices. By transmitting only these critical parameters rather than full geometric descriptions, the system maintains picture quality while minimizing bandwidth requirements.
Solution Approach 2:
The system transmits partial information (indices rather than complete geometric descriptions) that is sufficient for reconstruction purposes. This partial action approach provides just enough detail to maintain quality without the excessive bandwidth consumption of transmitting complete geometric data.
Data Source
AI summary
The present disclosure provides a method of coding implemented by a decoding device, the method comprising: obtaining a value of a splitting mode index for a current coding block; obtaining a value of an angle index for the current coding block according to the value of the splitting mode index value and a pre-stored table; setting a value of an index partIdx according to the value of the angle index; and storing motion information for the current coding block according to the value of the index partIdx.