CABAC Probability Estimation Using Multi-Bin Context Updates

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing video coding techniques using context adaptive binary arithmetic coding (CABAC) face inefficiencies in probability estimation, leading to suboptimal compression and increased bit usage for certain syntax elements.

Innovation Solution

The proposed method updates low and high rate state variables based on the specific combination of the last M bins, rather than solely on the value of the previous bin, to improve probability estimation in CABAC, enabling better context selection and reduced bit signaling for syntax elements.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If probability estimation is updated based solely on the previous bin value, then the update process is simple, but the probability estimation accuracy is insufficient leading to suboptimal compression

Engineering Contradiction:
Improveprobability estimation accuracyVSAvoidstate variable update complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The patent transitions from updating state variables based on a single previous bin value (1D dependency) to updating based on the last M bin values (M-dimensional dependency). This dimensional expansion allows the system to capture more complex probability patterns by considering a window of M previous bin outcomes, thereby improving probability estimation accuracy without fundamentally changing the update mechanism.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

Solution Approach 2:

The patent introduces dynamic adaptation by allowing different shift values to be applied when updating low and high rate state variables based on the specific combination of last M bins. This dynamic approach enables the system to adjust the update behavior according to the observed bin sequence, optimizing probability estimation for different coding scenarios while maintaining computational efficiency.

Inventive Principle:
Principle #15Dynamics

2Productivity

If context models use fixed update rules for state variables, then the implementation is straightforward, but the compression efficiency is suboptimal

Engineering Contradiction:
Improvecompression efficiencyVSAvoidcontext model complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent changes the parameters used in state variable updates by introducing different shift values based on the last M bin combinations. Instead of using a fixed update rule, the system selects appropriate shift values from a set of possible values depending on the observed bin sequence. This parameter variation enables the context model to adapt to different probability distributions in the data, improving compression efficiency.

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The patent segments the update process into separate updates for low rate and high rate state variables, each using potentially different shift values determined by the last M bins. This segmentation allows independent optimization of each state variable's update behavior, enabling finer-grained adaptation to the data characteristics and improving overall compression efficiency.

Inventive Principle:
Principle #1Segmentation

3Measurement precision

If the same update rule is applied for all bin values, then the processing is uniform and simple, but the probability estimation does not capture scenario-specific patterns

Engineering Contradiction:
Improveprobability estimation accuracyVSAvoidupdate process simplicity
Core Design Contradiction:
Measurement precisionVSEase of operation

Solution Approach 1:

The patent applies local quality by tailoring the update rules for low and high rate state variables according to the specific combination of last M bins. Different regions of the state space (different bin combinations) receive different update treatments through the selection of appropriate shift values. This localized adaptation enables the system to capture scenario-specific probability patterns while maintaining a relatively simple overall update mechanism.

Inventive Principle:
Principle #3Local quality

Data Source

PatentUS12489898B2Context adaptive binary arithmetic coding (CABAC) probability estimation for video coding
Publication Date: 2025.12.02 QUALCOMM INC
  • US12489898B2 patent drawing
  • US12489898B2 patent drawing
  • US12489898B2 patent drawing

AI summary

A video decoder is configured to receive bin values according to a context model, wherein the context model includes one or more probability states and the bin values correspond to one or more syntax elements of the video data; determine a first shift value based on the received bin values; determine a second shift value based on the received bin values; update a first state variable based on the first shift value; update a second state variable based on the second shift value; determine, for a next bin to be decoded, a probability state for the context model based on the first state variable and the second state variable; context decode the next bin to be decoded based on the probability state; and determine values for the one or more syntax elements based on the received bin values and the context decoded next bin value.