Last Position Binarization With Bit-Specific Arithmetic Context Coding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional image coding techniques face difficulties in accurately switching contexts during context adaptive binary arithmetic coding and decoding of last position information, leading to decreased coding efficiency due to inappropriate context selection for bit positions with different symbol occurrence probabilities.
Innovation Solution
An image coding method that binarizes last position information to generate signals with variable lengths, allowing for context switching among multiple contexts based on bit positions and using a fixed probability for certain signals, ensuring the binary symbol at the last bit position is coded with a context exclusive to that position, thereby improving coding efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If a single context is used for all binary symbols in the first signal, then device complexity is reduced, but coding efficiency decreases due to inappropriate context selection for bit positions with different symbol occurrence probabilities
Solution Approach 1:
The patent segments the first signal into multiple groups based on bit position, with each group assigned a dedicated context. This segmentation allows different contexts to be optimized for different bit position characteristics, improving coding efficiency while maintaining manageable device complexity through systematic organization.
Solution Approach 2:
The patent applies local quality by assigning different contexts to different bit positions within the first signal. Each bit position group receives a context tailored to its specific symbol occurrence probability characteristics, ensuring optimal coding performance for each local region rather than using a uniform approach.
2Productivity
If multiple contexts are switched based on bit position, then coding efficiency improves, but device complexity increases due to the need for context management
Solution Approach 1:
The patent divides the first signal into multiple segments or groups, where each group corresponds to specific bit positions and is associated with a particular context. This segmentation strategy improves coding efficiency by matching contexts to bit position characteristics while controlling device complexity through structured organization of the segmentation scheme.
Solution Approach 2:
The patent implements dynamic context selection where the context changes based on the bit position being coded. This dynamic approach allows the coding system to adapt to varying symbol occurrence probabilities at different bit positions, improving coding efficiency while the context switching is managed through predefined rules that control complexity.
3Measurement precision
If context adaptive binary arithmetic coding is used for all binary symbols, then coding precision improves, but loss of time increases due to the overhead of context management and switching
Solution Approach 1:
The patent segments the coding process into multiple context-specific operations, where each segment handles specific bit positions with their dedicated context. This segmentation improves coding precision by optimizing each segment for its specific characteristics while reducing time loss through efficient segment organization and processing.
Solution Approach 2:
The patent performs preliminary organization of contexts and bit position groupings before the actual coding process. This preliminary action prepares the context switching mechanism in advance, allowing the coding process to proceed efficiently with pre-established context assignments, thereby improving precision while minimizing time overhead during execution.
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.