Residual Coefficient Coding With Adaptive Rice Parameters
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing video coding techniques face challenges in efficiently compressing video data while maintaining video quality, particularly in handling residual and coefficient coding processes.
Innovation Solution
Implementing methods and apparatus for video encoding that include signaling a Sequence Parameter Set (SPS) rice adaptation enabled flag and general constraint information (GCI) to control rice parameter derivation, and using Golomb-Rice code for coding residual coefficients, with bypass-coded bins in specific passes to optimize compression.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional video coding techniques are used for residual and coefficient coding, then implementation is simpler, but compression performance is insufficient
Solution Approach 1:
The patent implements dynamic Rice parameter adaptation where the rice_parameter value is not fixed but adapts based on the statistics of abs_remainder values from previously coded transform units. This allows the coding process to dynamically adjust to the actual data characteristics, improving compression efficiency without requiring complex manual configuration
Solution Approach 2:
The patent uses feedback from previously coded transform units to inform the coding of current transform units. Specifically, the rice_parameter for the current TU is determined based on the statistics (e.g., mean, median) of abs_remainder values from previous TUs, creating a feedback loop that continuously optimizes compression performance based on actual data patterns
2Productivity
If Rice parameter adaptation is enabled for each transform unit, then compression efficiency improves, but signaling overhead increases
Solution Approach 1:
The patent extracts only the essential adaptation information (rice_parameter values) and transmits them in the bitstream when necessary, rather than transmitting all possible configuration parameters. This selective extraction minimizes signaling overhead while maintaining the benefits of adaptation
Solution Approach 2:
The patent applies Rice parameter adaptation at the transform unit level, allowing different rice_parameter values for different TUs based on their local characteristics. This localized adaptation improves compression efficiency for each specific TU without requiring global parameter changes that would increase overall signaling overhead
3Productivity
If Golomb-Rice code with bypass-coded bins is used, then compression performance improves, but coding complexity increases
Solution Approach 1:
The patent segments the coding process into two distinct passes: context-coded bin coding and bypass-coded bin coding. This segmentation allows the algorithm to handle different types of data with appropriate coding methods, improving overall compression performance while keeping each individual pass relatively simple and manageable
Data Source
AI summary
Methods, apparatuses, and non-transitory computer-readable storage mediums are provided for video encoding. In one method, an encoder signals a Sequence Parameter Set (SPS) rice adaption enabled flag that indicates whether rice parameter derivation for binarization of abs_remainder and dec_abs_level is initialized at start of each transform unit (TU) with statistics accumulated from previous TUs, and a general constraint information (GCI) rice adaptation enabled flag, in GCI syntax to provide general control of the SPS rice adaptation enabled flag. The abs_remainder is coded with Golomb-rice code and bypass-coded bins in a second pass when remaining number of context-coded bins is greater than or equal to 4 while coding in a first pass, and the dec_abs_level is directly coded in the second pass using the Golomb-Rice code and the bypass-coded bins when remaining number of context-coded bins is less than 4 while coding in the first pass.