Last-Position Binarization With Bit-Specific Context Coding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional video coding standards face challenges in accurately switching contexts during context adaptive binary arithmetic coding and decoding, leading to decreased coding efficiency due to the use of common contexts for bit positions with significantly different symbol occurrence probabilities.
Innovation Solution
An image coding method that binarizes last position information to generate a binary signal with a context-switched coding approach, where binary symbols at specific bit positions are coded using contexts exclusive to those positions, and uses a fixed probability for certain signal components, optimizing coding efficiency by varying the signal length based on block size.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If a common context is used for binary symbols at different bit positions, then the device complexity is reduced, but the coding efficiency decreases due to inaccurate probability prediction
Solution Approach 1:
The patent segments the binary signal into a first signal and a second signal based on bit position. The first signal contains binary symbols at bit positions where context switching is beneficial, while the second signal contains symbols at positions where fixed probability is sufficient. This segmentation allows selective application of context switching only where needed, improving coding efficiency without excessive complexity increase.
Solution Approach 2:
The patent applies different coding strategies to different parts of the binary signal based on local characteristics. For the first signal, context adaptive binary arithmetic coding is used to capture local probability variations. For the second signal, fixed probability coding is applied. This local differentiation optimizes overall coding efficiency by matching the coding method to the statistical properties of each segment.
2Productivity
If context adaptive binary arithmetic coding is used for all binary symbols, then the coding efficiency is improved, but the memory requirements and processing complexity increase
Solution Approach 1:
The patent applies context adaptive binary arithmetic coding partially - only to the first signal containing binary symbols at specific bit positions. For the second signal, simpler fixed probability arithmetic coding is used. This partial application of the more complex coding method achieves most of the potential coding efficiency gains while avoiding the full memory and processing overhead of applying it universally to all binary symbols.
3Ease of operation
If the signal length is fixed for all blocks, then the processing is simplified, but the coding efficiency decreases for blocks of varying sizes
Solution Approach 1:
The patent introduces dynamic signal length adjustment based on block characteristics. The binarization process generates a first signal with variable length depending on the last position information value, and optionally a second signal to complete the binary representation. This dynamic adaptation allows the coding process to efficiently handle blocks of varying sizes while maintaining reasonable processing complexity through structured variable-length coding.
Data Source
AI summary
An image coding method including: binarizing last position information to generate (i) a binary signal which includes a first signal having a length smaller than or equal to a predetermined maximum length and does not include a second signal or (ii) a binary signal which includes the first signal having the predetermined maximum length and the second signal; first coding for arithmetically coding each of binary symbols included in the first signal using a context switched among a plurality of contexts according to a bit position of the binary symbol; and second coding for arithmetically coding the second signal using a fixed probability when the binary signal includes the second signal, wherein in the first coding, a binary symbol at a last bit position of the first signal is arithmetically coded using a context exclusive to the last bit position, when the first signal has the predetermined maximum length.