Video Encoding Tile Partitioning for Sub-bitstream Extraction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video processing technologies face inefficiencies in partitioning methods for video or pictures, particularly in extracting regions of interest, which leads to increased computational burden and complexity in streaming sub-bitstreams, especially in high-resolution videos like 4K and 8K, due to the need for rewriting slice addresses and lack of data structures for tile partitioning in bitstreams.
Innovation Solution
The proposed solution involves encoding a digital video by partitioning it into tiles and slices, where each slice includes a tile identifier and a slice address, allowing for efficient extraction of sub-bitstreams without rewriting slice addresses, by representing slice addresses as coordinates or offsets within the tile, and encoding tile parameters to facilitate efficient decoding and streaming.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If existing partitioning methods are used to extract regions of interest from video pictures, then the ability to access specific regions is achieved, but the computational burden and complexity increase significantly
Solution Approach 1:
The picture is divided into multiple tiles, and each tile is further divided into slices. This hierarchical segmentation allows independent processing and extraction of specific regions of interest without requiring complex operations on the entire picture, thereby reducing computational burden while maintaining ease of access to target regions.
Solution Approach 2:
Tile identifiers and slice addresses are encoded into the bitstream in advance during the encoding phase. This preliminary action eliminates the need for complex runtime computations to determine region locations, allowing efficient extraction of regions of interest during decoding without increasing operational complexity.
2Reliability
If slice addresses are rewritten during sub-bitstream extraction, then correct positioning is maintained, but the processing time and computational resources increase
Solution Approach 1:
The slice address information is copied and embedded into the bitstream as explicit metadata during encoding. During sub-bitstream extraction, this pre-encoded address information is directly utilized without modification, eliminating the need for time-consuming address rewriting operations while ensuring accurate positioning through the copied address data.
3Productivity
If tile partitioning data structures are added to bitstreams, then efficient region extraction is enabled, but the bitstream complexity and size increase
Solution Approach 1:
Tile identifiers and slice address information are extracted from the complex picture structure and represented as separate, simplified data elements in the bitstream. This extraction approach enables efficient region identification and extraction operations while maintaining a relatively simple bitstream structure that does not require complex hierarchical data structures.
4Manufacturing precision
If high-resolution videos (4K, 8K) are processed using traditional methods, then complete picture quality is maintained, but the computational complexity and resource requirements increase dramatically
Solution Approach 1:
High-resolution pictures are divided into multiple tiles and slices, allowing parallel processing of smaller regions. This segmentation maintains the complete picture quality by processing all regions at full resolution while reducing computational complexity through distributed processing of manageable tile and slice units rather than handling the entire high-resolution picture as a single complex structure.
Data Source
AI summary
Techniques for encoding, decoding, and extracting one or more bitstreams to form one or more sub-bitstreams are described. In one example aspect, a method for video or picture processing includes partitioning a picture into one or more tiles and generating one or more bitstreams using one or more configurations based on the one or more tiles. Generating each of the one or more bitstreams includes partitioning each of the one or more tiles into one or more slices, and performing, for each slice among the one or more slices a first encoding step to encode a tile identifier in a header of the slice, and a second encoding step to encode, in the header of the slice, a second address of the slice that indicates a location of the slice in the tile.