Significance Map Decoding Using Non-Uniform Context Partitions

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current video encoding standards, such as H.264/AVC and the developing HEVC, face inefficiencies in encoding and decoding significance maps due to uniform context distribution, which leads to suboptimal compression efficiency and adaptivity, particularly in balancing bit positions per context.

Innovation Solution

Implementing context-adaptive encoding and decoding methods with non-spatially-uniform partitioning of significance maps, allowing bit positions within each part to share a context, and dynamically selecting partition sets based on characteristics like TU size, text type, and QP value to optimize context usage.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Ease of manufacture

If uniform context distribution is used in significance map encoding, then the encoding process is simple, but compression efficiency is suboptimal

Engineering Contradiction:
Improveencoding simplicityVSAvoidcompression efficiency
Core Design Contradiction:
Ease of manufactureVSLoss of information

Solution Approach 1:

The significance map is divided into multiple partitions, with each partition assigned a separate context. This segmentation allows different regions of the transform unit to be encoded with context-specific probability models, improving compression efficiency by capturing local statistical variations while maintaining manageable complexity through structured partitioning.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

Different contexts are assigned to different spatial partitions of the significance map, allowing each region to have its own probability model tailored to local characteristics. This local quality approach enables the encoder to adapt to varying statistical properties across different areas of the block, thereby improving overall compression efficiency.

Inventive Principle:
Principle #3Local quality

2Loss of information

If more contexts are used for each bit position, then compression efficiency improves, but computational complexity increases

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

Solution Approach 1:

The transform unit is divided into multiple partitions, with each partition having its own context. This segmentation strategy balances compression efficiency and complexity by limiting the number of contexts needed per bit position while still capturing local variations through spatial partitioning. The structured division into manageable partitions prevents exponential growth in computational requirements.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The context assignment is dynamically adapted based on the partition structure and characteristics of the significance map. By using partition-based context modeling, the system can adaptively allocate contexts to different regions without requiring a fixed large number of contexts for all positions, thus balancing efficiency and complexity dynamically.

Inventive Principle:
Principle #15Dynamics

3Adaptability or versatility

If non-spatially-uniform partitioning is used, then adaptivity improves, but encoding complexity increases

Engineering Contradiction:
Improvecontext adaptivityVSAvoidpartition selection complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The partitioning scheme assigns different context models to different spatial regions based on local characteristics of the significance map. This local quality approach improves adaptivity by allowing each partition to be optimized for its specific region's statistical properties, while the structured partitioning methodology keeps encoding complexity manageable through systematic region division.

Inventive Principle:
Principle #3Local quality

Data Source

PatentEP3621206B1Significant map decoding using partition selection
Publication Date: 2024.06.05 VELOS MEDIA INT LTD
  • EP3621206B1 patent drawingFigure 1
  • EP3621206B1 patent drawingFigure 2
  • EP3621206B1 patent drawingFigure 3~4

AI summary

Methods of encoding and decoding for video data are describe in which significance maps are encoded and decoded using non-spatially-uniform partitioning of the map into parts, wherein the bit positions within each part are associated with a given context. Example partition sets and processes for selecting from amongst predetermined partition sets and communicating the selection to the decoder are described.