Last Position Arithmetic Coding With Consecutive Bitstream Segments
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current video coding standards face inefficiencies in arithmetic coding and decoding of last position information, particularly due to frequent switching between different arithmetic decoding methods, which hinders efficient processing.
Innovation Solution
An image coding method that binarizes and codes the last position information by separating it into components, using context adaptive binary arithmetic coding and bypass coding, and placing coded signals in a bit stream such that signals coded by the same method are consecutive, reducing the number of method switches during decoding.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If different arithmetic decoding methods are used for different parts of the last position information, then coding flexibility and adaptability are improved, but the number of method switches increases decoding complexity and reduces processing efficiency
Solution Approach 1:
The last position information is segmented into two distinct parts: the significant flag indicating whether the last position is at the end of the scan order, and the actual last position value. Each segment is encoded using a dedicated arithmetic decoding method appropriate to its characteristics, avoiding the need to switch methods frequently during decoding.
Solution Approach 2:
The significant flag is decoded first before the actual last position value. This preliminary action allows the decoder to prepare for the appropriate decoding method in advance, reducing the number of method switches during the overall decoding process by anticipating the decoding requirements beforehand.
2Measurement precision
If multiple arithmetic decoding methods are employed for different components, then coding precision and efficiency are improved, but the processing speed decreases due to frequent method switching
Solution Approach 1:
The last position information is divided into a significant flag component and a position value component, with each decoded using an optimized arithmetic decoding method. This segmentation allows precision-critical parts to use higher-precision decoding while maintaining overall decoding speed by minimizing method transition overhead.
Solution Approach 2:
The decoding process maintains continuity by processing the significant flag and position value in a sequential manner without interrupting the arithmetic decoding flow. This continuous processing approach reduces the impact of method switching on overall decoding speed while preserving coding precision.
3Measurement precision
If the last position information is encoded in a detailed and precise manner, then decoding accuracy is improved, but the computational complexity and processing overhead increase
Solution Approach 1:
The last position information is segmented into a significant flag that indicates boundary conditions and an actual position value. This segmentation reduces computational complexity by handling the boundary case separately with a simple flag, while the position value is decoded with appropriate precision only when necessary.
Solution Approach 2:
Different decoding precision levels are applied to different parts of the last position information based on their specific requirements. The significant flag uses binary precision sufficient for its boolean nature, while the position value uses higher precision arithmetic decoding only where needed, optimizing the balance between accuracy and computational complexity.
Data Source
AI summary
An image coding method including: binarizing a first component and a second component which are included in last position information, to generate a first binary signal and a second binary signal, respectively; coding, by first arithmetic coding, a first partial signal which is a part of the first binary signal and a second partial signal which a part of the second binary signal, and coding, by second arithmetic coding, a third partial signal which is another part of the first binary signal and a fourth partial signal which is another part of the second binary signal; and placing the coded first through fourth partial signals in a bit stream, wherein in the placing, (i) the coded second partial signal is placed next to the coded first partial signal, or (ii) the coded fourth partial signal is placed next to the coded third partial signal.