Significance Map Encoding And Decoding Using Partition Selection

Patent No. US10848783 (titled "Significance Map Encoding And Decoding Using Partition Selection") was filed by Velos Media Llc on Oct 9, 2019.

What is this patent about?

’783 is related to the field of video compression, specifically the encoding and decoding of significance maps within video codecs like H.264/AVC and HEVC. Significance maps indicate the locations of non-zero coefficients within a transformed block of video data, and their efficient encoding is crucial for overall compression performance. The patent addresses the problem of optimizing context modeling for entropy encoding these maps.

The underlying idea behind ’783 is to improve the efficiency of context-adaptive entropy coding of significance maps by using non-uniform partitioning of the map. Instead of assigning a unique context to each coefficient position or using uniform partitioning, the invention groups coefficient positions into parts based on their statistical significance, assigning a single context to each part. This allows for better context adaptation and improved compression, especially by concentrating contexts in the upper-left quadrant where significant coefficients are more likely to occur.

The claims of ’783 focus on a method, encoder, and non-transitory medium for encoding a significance map. The key element is a partition set that assigns contexts to bit positions in the significance map. This assignment is characterized by: (1) each bit position in the upper left quadrant having one of at least four contexts, (2) the upper right and lower left quadrants sharing four to six contexts different from the upper left, with each context assigned to at least two bit positions, and (3) the lower right quadrant having a majority of bit positions assigned to a single context.

In practice, the encoder iterates through each bit position in the significance map, determines the appropriate context based on the pre-defined partition set, encodes the bit value using that context, and then updates the context based on the encoded bit. The non-uniform partitioning strategy acknowledges that high-frequency coefficients (typically in the lower right) are often zero, so fewer contexts are needed there. This allows the encoder to concentrate its context modeling resources on the more statistically significant upper-left quadrant, leading to better probability estimation and improved compression.

This approach differentiates itself from prior methods that use either a uniform distribution of contexts or a one-to-one mapping of contexts to coefficient positions. By strategically grouping coefficient positions into parts and assigning contexts based on their statistical likelihood of containing significant coefficients, ’783 achieves a better balance between adaptivity and accuracy in context modeling. This results in a more efficient encoding of the significance map and, consequently, improved overall video compression performance.

How does this patent fit in bigger picture?

Technical landscape at the time

In the early 2010s when ’783 was filed, video compression systems commonly relied on block-based coding, where frames were divided into blocks, transformed, quantized, and entropy encoded. At a time when context-adaptive entropy coding was typically implemented using dedicated contexts for each coefficient position or small groups of positions within a transform unit, hardware or software constraints made managing a large number of distinct contexts non-trivial.

Novelty and Inventive Step

The examiner approved the application because the prior art of record, specifically US 20080219578 A1-Lee, does not disclose a method of encoding a significance map for a transform unit into a bitstream that includes determining a context for each bit position based on a partition set. The partition set assigns contexts to bit positions such that the upper left quadrant has at least four contexts, the upper right and lower left quadrants have four to six contexts different from the upper left, and a majority of bit positions in the lower right quadrant are assigned a single context. The prior art discloses using six contexts for the first partition set and nine contexts for the second partition set, and using one of its six contexts for certain positions and three of its nine contexts for certain positions.

Claims

This patent contains 21 claims, with independent claims 1, 8, and 15. The independent claims are directed to encoding a significance map for a transform unit into a bitstream using context-adaptive encoding based on a partition set. The dependent claims generally elaborate on the selection and initialization of the partition set and associated contexts.

Key Claim Terms New

Definitions of key terms used in the patent claims.

Term (Source)Support for SpecificationInterpretation
Context-adaptive encoding
(Claim 1, Claim 8, Claim 15)
“The entropy encoding of the symbols in significance map is based upon a context model. In the case of a 4×4 luma or chroma block or transform unit (TU), a separate context is associated with each coefficient position in the TU.”Encoding a bit position using a context that is determined based on previously encoded bits.
Partition set
(Claim 1, Claim 8, Claim 15)
“The claims specify that the partition set assigns contexts to bit positions within the significance map such that each bit position in an upper left quadrant of the significance map is assigned one of at least four contexts, an upper right and lower left quadrant of the significance map are assigned four to six contexts different from said at least four contexts, wherein each of the four to six contexts is assigned to at least two bit positions, and a majority of bit positions in a lower right quadrant are assigned a single context.”A set that assigns contexts to bit positions within the significance map.
Significance map
(Claim 1, Claim 8, Claim 15)
“In H.264/AVC and in the current development work for HEVC, the quantized transform coefficients are encoded by (a) encoding a last significant coefficient position indicating the location of the last non-zero coefficient in the block, (b) encoding a significance map indicating the positions in the block (other than the last significant coefficient position) that contain non-zero coefficients, (c) encoding the magnitudes of the non-zero coefficients, and (d) encoding the signs of the non-zero coefficients.”A map indicating the positions in a block that contain non-zero coefficients.
Significant coefficient flag
(Claim 1, Claim 8, Claim 15)
“The claims specify that for each bit position in the significance map having a significant coefficient flag that is to be encoded using context-adaptive encoding, determining a context for that bit position based upon a partition set.”A flag indicating whether a bit position in the significance map has a significant coefficient.
Transform unit
(Claim 1, Claim 8, Claim 15)
“The block or matrix of quantized transform domain coefficients (sometimes referred to as a “transform unit”) is then entropy encoded using a particular context model.”A block or matrix of quantized transform domain coefficients.

Litigation Cases New

US Latest litigation cases involving this patent.

Case NumberFiling DateTitle
1:25-cv-00967Jun 23, 2025Velos Media, LLC v. ByteDance Ltd et al

Patent Family

Patent Family

File Wrapper

The dossier documents provide a comprehensive record of the patent's prosecution history - including filings, correspondence, and decisions made by patent offices - and are crucial for understanding the patent's legal journey and any challenges it may have faced during examination.

  • Date

    Description

  • Get instant alerts for new documents

US10848783

VELOS MEDIA LLC
Application Number
US16597829
Filing Date
Oct 9, 2019
Status
Granted
Expiry Date
Oct 24, 2031
External Links
Slate, USPTO, Google Patents