Block Tree Pattern Reuse for Lower Video Bitstream Overhead
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The transmission of block tree patterns in video transcoding requires a large number of bits, leading to increased overhead, as the bit string representing how root blocks are split into leaf blocks is often repeated, which is inefficient and increases the bitstream size.
Innovation Solution
Reusing previously encoded block tree patterns by signaling a flag in the bitstream when a similar pattern is found, reducing the need to transmit the entire bit string for each block, and allowing for alterations such as rotation, flipping, or patching to match the current block tree pattern.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If the block tree pattern is transmitted using a full bit string for each root block, then the decoder can accurately reconstruct the block structure, but the bitstream size increases and compression efficiency decreases
Solution Approach 1:
The patent merges identical block tree patterns from multiple root blocks into a single shared representation. When the same pattern appears across different root blocks, it is encoded once and referenced by all applicable blocks, combining redundant information into one efficient representation that reduces overall bitstream size while maintaining complete reconstruction accuracy
Solution Approach 2:
The patent creates a universal block tree pattern representation that can serve multiple root blocks simultaneously. A single encoded pattern functionally represents the block structure for any number of root blocks that share the same pattern, making the encoding multi-functional and eliminating the need for separate transmissions for each identical pattern
2Ease of operation
If the block tree pattern is transmitted repeatedly for each root block, then each block can be independently decoded, but the overhead increases and transmission efficiency decreases
Solution Approach 1:
The patent performs preliminary encoding of block tree patterns by identifying and marking identical patterns across root blocks before final bitstream generation. This advance preparation allows the decoder to efficiently retrieve shared patterns without requiring repeated full transmissions, reducing transmission overhead while maintaining independent decoding capability through proper reference signaling
Solution Approach 2:
The patent uses copying by creating references to shared block tree patterns instead of transmitting complete copies for each root block. When a pattern is identified as identical to a previously encoded pattern, a reference copy is created that points to the original encoding, allowing multiple root blocks to share the same pattern representation with minimal additional overhead
Data Source
AI summary
In some embodiments, a method transcodes a first location from a spatial region. The first location is associated with a first pattern defining a structure of splitting a location into smaller shapes. A bit string of bits is included for the first pattern in an encoded bitstream. The method determines the first location in the spatial region when the first pattern of the first location can be reused for a second pattern of a second location. The first location is one of a plurality of locations in the spatial region. Information for the second location is included in the encoded bitstream that indicates the first location in the spatial region without including a bit string of bits for the second pattern. The first location allows the bit string of bits for the first pattern to be retrieved for use to decode the second location from the encoded bitstream.