Intra Prediction Image Coding Using Segmented Context Adaptive and Bypass Paths
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current image coding methods using intra prediction modes are inefficient, leading to processing delays and decreased decoding speed due to the complexity of coding and decoding intra prediction modes.
Innovation Solution
An image coding method that employs context adaptive binary arithmetic coding for context adaptive portions and bypass coding for bypass portions, allowing for efficient coding and decoding by making bypass decoding portions contiguous, thereby increasing the degree of parallelism in processing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If context adaptive binary arithmetic coding is used for all portions of intra prediction mode data, then coding precision is improved, but processing time increases and productivity decreases
Solution Approach 1:
The patent divides the binary data of intra prediction modes into two segments: context adaptive portions and bypass portions. The context adaptive portions are coded using context adaptive binary arithmetic coding to maintain precision, while the bypass portions are coded using simpler bypass coding to improve processing speed. This segmentation allows the system to achieve both coding precision and processing efficiency simultaneously.
2Measurement precision
If complex intra prediction mode coding is used, then coding precision is improved, but device complexity increases
Solution Approach 1:
The patent segments the coding process into two distinct paths: context adaptive coding for precision-critical data and bypass coding for less critical data. This segmentation reduces the overall device complexity by allowing different coding mechanisms to be applied selectively, rather than requiring complex adaptive logic throughout the entire coding process.
Solution Approach 2:
The patent applies different coding qualities to different portions of the data based on their importance. Context adaptive binary arithmetic coding is applied to portions where precision is critical, while bypass coding is applied to portions where lower precision is acceptable. This local differentiation of quality reduces overall system complexity while maintaining necessary precision.
3Measurement precision
If sequential decoding of all binary data portions is used, then coding precision is maintained, but processing time increases
Solution Approach 1:
The patent segments the binary data into context adaptive portions and bypass portions that can be decoded independently. The bypass portions can be decoded in parallel with or before the context adaptive portions, eliminating sequential dependencies and reducing total processing time while maintaining decoding precision through the use of appropriate decoding methods for each segment.
Solution Approach 2:
The patent enables preliminary decoding of bypass portions before the context adaptive portions are fully processed. Since bypass portions use simpler coding mechanisms, they can be decoded in advance and prepared for subsequent processing, reducing the overall processing time without compromising the precision of the final decoded result.
Data Source
AI summary
A method for coding multiple binary data into a bitstream is disclosed. The method splits each of four luma binary data into a luma context-dependent segment and a luma context-independent segment, and splits one chroma binary data into a chroma context-dependent segment and a chroma context-independent segment. The method groups first coded data including four coded luma context-dependent segments, second coded data including four coded luma context-independent segments and third coded data including a coded chroma context-dependent segment and a coded chroma context-independent segment. The method further performs, separately, context adaptive binary arithmetic coding on the first coded data and the chroma context-dependent segment using a variable probability. The method also performs, separately, bypass coding on the second coded data and the chroma context-independent segment using a fixed probability.