HDR Graphics Compression Endpoint Quantization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
High dynamic range (HDR) graphics with higher bit-depth components are not packed efficiently for random access, leading to banding and quantization artifacts due to insufficient bit-depth resolution, whereas standard dynamic range (SDR) systems with 8-bits per component are efficiently packed but limit the dynamic range and color gamut.
Innovation Solution
A graphics processor determines texture compression endpoints for HDR pixel blocks with higher bit-depth components, quantizes them to a smaller bit length, and selects quantized endpoints to pack HDR graphics efficiently similar to 8-bit standard texture compression, using an endpoint selection module, weight selection module, and packing module to generate a compressed data block.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If HDR graphics with higher bit-depth components are packed efficiently for random access, then memory bandwidth and storage efficiency are improved, but bit-depth resolution is reduced causing banding and quantization artifacts
Solution Approach 1:
The patent segments the HDR pixel data into multiple planes (e.g., R, G, B, A channels) and processes each plane independently through the compression pipeline. This segmentation allows the system to apply quantization and endpoint selection to each plane separately, maintaining precision where needed while achieving compression efficiency. The segmented approach enables parallel processing and efficient memory packing without sacrificing overall bit-depth resolution.
Solution Approach 2:
The patent dynamically changes the quantization parameters and endpoint values based on the local characteristics of the pixel block. By adapting the number of bits used for endpoints and weights to the actual content complexity and luminance range, the system maintains high bit-depth resolution in critical areas while allowing greater compression in less sensitive regions. This parameter adaptation resolves the contradiction by making precision allocation flexible rather than fixed.
2Measurement precision
If quantization is reduced to maintain bit-depth resolution, then visual quality is improved, but memory bandwidth requirements and storage space increase
Solution Approach 1:
The patent applies partial quantization rather than full quantization across all pixel data. By using endpoint selection that retains only the most significant bits and applying quantization selectively based on local image characteristics, the system maintains sufficient bit-depth resolution for visual quality while reducing the total number of bits that need to be stored and transmitted. This partial action approach achieves the right balance between precision and bandwidth consumption.
Solution Approach 2:
The system dynamically adjusts quantization parameters including the number of bits for endpoints and weights based on content analysis. In regions with smooth gradients or limited luminance range, fewer bits are allocated, reducing memory bandwidth requirements. In regions requiring higher fidelity, more bits are preserved. This adaptive parameter change allows the system to optimize the trade-off between visual quality and bandwidth usage on a per-block basis.
3Productivity
If standard 8-bit per component packing is used, then memory efficiency is improved, but dynamic range and color gamut are limited
Solution Approach 1:
The patent transitions from the traditional single-dimension approach of storing each pixel component with fixed bit-depth to a multi-dimensional representation using planes, endpoints, and weights. This dimensional transformation allows HDR data with variable bit-depth (10-bit, 12-bit, or higher) to be packed into memory structures designed for 8-bit data. The endpoint-weight format effectively creates a new dimensional space where compression efficiency and dynamic range coexist.
Solution Approach 2:
The system changes the fundamental parameters of how pixel data is represented and packed by introducing endpoint selection and weight-based compression. Instead of storing full high-bit-depth values for every pixel, the system stores compressed representations using fewer bits for endpoints and weights, achieving memory packing efficiency comparable to 8-bit systems while preserving the ability to represent HDR dynamic range through the mathematical reconstruction of original values.
4Adaptability or versatility
If high bit-depth components are used, then color gamut and dynamic range are improved, but compression efficiency and packing density decrease
Solution Approach 1:
The patent extracts the essential visual information from high bit-depth HDR data by identifying and storing only the critical endpoints and weights needed to reconstruct the image. Rather than storing all high-bit-depth pixel values, the system extracts the minimum necessary data (endpoints defining the luminance range and weights defining the distribution), achieving compression efficiency while preserving color gamut and dynamic range in the reconstructed output.
Solution Approach 2:
The system changes the compression parameters by adapting the bit-depth allocation between endpoints and weights based on the actual HDR content characteristics. For images with limited luminance range or smooth gradients, the system uses fewer bits, improving compression efficiency. For images requiring full HDR capability, more bits are allocated, maintaining color gamut and dynamic range. This parameter adaptability resolves the contradiction between compression efficiency and HDR quality.
Data Source
AI summary
A device implementing the subject high bit-depth graphics compression may include at least one processor configured to receive pixel data for a pixel block, obtain endpoints of a first bit length based on the pixel data in the pixel block, quantize the endpoints to a second bit length smaller than the first bit length, select the quantized endpoints for pixel values in the pixel block, determine a weight for each pixel of the pixel block in each of a plurality of planes corresponding to the endpoints selected for the pixel block, and generate a compressed data block representative of the pixel block based at least on the endpoints for the pixel block and the weight for each pixel of the pixel block in each of the plurality of planes corresponding to the endpoints. A method and computer program product implementing the subject high bit-depth graphics compression is also provided.


