Context-Adaptive CABAC Probability Updates for Video Decoding

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing video coding systems face inefficiencies in entropy decoding due to outdated methods for updating probability values during context-based adaptive binary arithmetic coding (CABAC), leading to suboptimal compression and decoding performance.

Innovation Solution

A device updates probability values for entropy decoding by using a context probability value based on multiple bin values, incorporating a window size and weighting factors, and accounting for inconsistencies to refine the entropy decoding process.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If probability values are updated using traditional CABAC methods, then decoding speed is maintained, but compression efficiency deteriorates

Engineering Contradiction:
Improvedecoding speedVSAvoidcompression efficiency
Core Design Contradiction:
ProductivityVSLoss of energy

Solution Approach 1:

The patent applies dynamics by transitioning from static probability models to dynamic probability models that adapt in real-time. The probability value for a bin is updated based on the actual decoded values of previous bins within a sliding window, allowing the system to dynamically adjust to changing statistical patterns in the video data, thereby improving compression efficiency without sacrificing decoding speed

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent implements feedback mechanisms where the decoded bin values are fed back into the system to update the probability models. The feedback loop uses the actual decoded values to refine future probability estimates, creating a self-correcting system that continuously improves compression efficiency while maintaining operational speed

Inventive Principle:
Principle #23Feedback

2Loss of energy

If probability values are updated frequently, then compression efficiency improves, but computational complexity increases

Engineering Contradiction:
Improvecompression efficiencyVSAvoidcomputational complexity
Core Design Contradiction:
Loss of energyVSDevice complexity

Solution Approach 1:

The patent segments the update process by introducing a sliding window that focuses updates on a limited, recent portion of decoded bins rather than the entire history. This segmentation allows the system to update probabilities efficiently by only considering the most relevant recent data, reducing computational complexity while maintaining compression efficiency

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent applies local quality by giving different weights to different bins based on their recency and relevance. More recent bins within the sliding window have higher weight in the probability update calculation, while older bins have diminishing weight. This localized approach optimizes compression efficiency for the most important data while managing computational resources

Inventive Principle:
Principle #3Local quality

3Measurement precision

If context probability values are updated based on multiple bin values, then decoding accuracy improves, but processing time increases

Engineering Contradiction:
Improvedecoding accuracyVSAvoidprocessing time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent applies preliminary action by pre-defining the sliding window size and update rules before decoding begins. The window size parameter is established in advance, allowing the system to efficiently process data without performing complex calculations during real-time decoding, thus improving accuracy while minimizing processing time overhead

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS20250254330A1Context-adaptive binary arithmetic coding update refinement
Publication Date: 2025.08.07 INTERDIGITAL CE PATENT HOLDINGS SAS
  • US20250254330A1 patent drawing
  • US20250254330A1 patent drawing
  • US20250254330A1 patent drawing

AI summary

A device may obtain a first value for a first binarization symbol associated with video data and a second value for a second binarization symbol associated with the video data. The device may obtain a probability value associated with a third binarization symbol associated with the video data based on the first value, the second value, and a probability value associated with the first binarization symbol. The device may then decode the video data based on the probability value associated with the third binarization symbol. The first, second and third binarization symbols may be for a transform coefficient. In examples, the first, second and third binarization symbols may be associated with a context for entropy decoding. For example, the first, second and third binarization symbols may be associated with an entropy decoding context for decoding the video data using context-based adaptive binary arithmetic coding (CABAC).