Patent No. US10659782 (titled "Multi-level significance maps for encoding and decoding") on Dec 20, 2018. The application was issued on May 19, 2020.
’782 is related to the field of video data compression, specifically the efficient entropy encoding and decoding of quantized transform coefficients. In modern video standards like HEVC, significance maps are used to identify the locations of non-zero coefficients within a transform unit, but as transform sizes increase to 16x16 or 32x32, the computational cost of managing individual coefficient contexts and the bitstream overhead for sparse data become significant bottlenecks.
The underlying idea behind ’782 is the implementation of a multi-level significance map structure that partitions a transform unit into smaller, non-overlapping blocks or groups. By first signaling a high-level flag for each group to indicate whether it contains any non-zero data, the system can bypass the encoding of individual flags for entirely empty regions. This hierarchical approach reduces memory bandwidth requirements and improves compression efficiency by avoiding the processing of large clusters of zero-value coefficients.
The claims of ’782 focus on a specific encoding logic that utilizes these significant-coefficient-group flags to control the bitstream inclusion of individual coefficient flags. A critical aspect of the claimed mechanism is an inference rule for the flag at position (0,0) within a group: if a group is signaled as non-empty but all previously scanned flags in that group are zero, the final flag is inferred to be one. This eliminates the need to explicitly encode the last possible non-zero flag in a group, further tightening the bitstream.
In practice, the invention operates by scanning the transform unit in a prescribed order, such as a reverse diagonal scan, to determine which groups contain significant data. The encoder uses context-adaptive binary arithmetic coding (CABAC) with contexts derived from the status of neighboring groups, such as those to the right or below the current block. This spatial dependency allows the probability model to adapt to the typical clustering of energy in the low-frequency regions of a transform block.
This approach differentiates itself from prior methods by replacing computationally intensive neighbor-based context derivation for every single coefficient with a more streamlined hierarchical signaling strategy. By incorporating rate-distortion optimized quantization (RDOQ) at the group level, the encoder can strategically zero out entire blocks if the bit savings outweigh the visual distortion. This results in a high-performance coding engine that scales effectively with the larger transform units required for high-definition video content.
In the early 2010s when ’782 was filed, video compression systems were transitioning toward higher resolution formats at a time when entropy encoding was typically implemented using single-level significance maps to identify non-zero transform coefficients. When systems commonly relied on large transform units, such as 16x16 or 32x32 blocks, to improve coding efficiency, the determination of context for each coefficient position required evaluating the status of multiple neighboring flags. Hardware and software constraints made this process non-trivial, as the high frequency of memory access operations required to retrieve neighboring flag values created significant computational bottlenecks during the real-time decoding of high-definition bitstreams.
The disclosed invention represents a technical advancement through an architectural shift from single-level to multi-level significance map encoding. By partitioning a large transform unit into smaller sub-blocks and generating a higher-level map to indicate which sub-blocks contain at least one non-zero coefficient, the system enables the decoder to bypass entire regions of zero-valued coefficients. This hierarchical structure overcomes the constraint of high computational complexity by reducing the number of context-model lookups and memory accesses required to reconstruct the coefficient matrix. The integration of this multi-level approach allows for more efficient processing of large transform units without the proportional increase in processing overhead typically associated with neighbor-based context derivation.
This patent contains 23 claims, with claims 1, 12, and 23 serving as the independent claims. The independent claims focus on a method, an encoder, and a processor-readable medium for encoding significant-coefficient flags within partitioned transform units by conditionally inferring flag values to avoid redundant bitstream encoding. The dependent claims serve to further define specific transform unit and block dimensions, establish criteria for setting flags based on neighbor group values or coefficient positions, and detail the determination of encoding contexts.
Definitions of key terms used in the patent claims.
US Latest litigation cases involving this patent.

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.
Get instant alerts for new documents