High Dynamic Range Color Decompression Endpoint Interpolation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional compression techniques do not effectively support high dynamic range data, which requires more than 16 bits per pixel, leading to inefficient memory usage and processing challenges in graphics applications.

Innovation Solution

A method and system for decompressing high dynamic range data using fixed-size block compression formats with 8 bits per pixel, employing two or four compressed endpoint values and indices, allowing for hardware-based decompression and efficient processing.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Quantity of substance

If conventional compression techniques are used, then memory bandwidth is reduced, but high dynamic range data cannot be effectively supported

Engineering Contradiction:
Improvememory bandwidthVSAvoidsupport for high dynamic range data
Core Design Contradiction:
Quantity of substanceVSAdaptability or versatility

Solution Approach 1:

The patent changes the parameter representation by using endpoint-based compression where high dynamic range data is represented by storing endpoint values and interpolation indices rather than direct pixel values. This allows 48+ bpp high dynamic range data to be compressed into an 8-bit per pixel format while maintaining the ability to represent the full dynamic range through mathematical interpolation between endpoints.

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The patent segments the high dynamic range data into compressed formats that can be processed in smaller units. By dividing the data into blocks with compressed endpoint values and indices, the system can process high dynamic range data using conventional compression techniques while maintaining the necessary precision through the endpoint-interpolation model.

Inventive Principle:
Principle #1Segmentation

2Quantity of substance

If high dynamic range data is stored in compact format, then memory usage is reduced, but decompression complexity increases

Engineering Contradiction:
Improvememory usageVSAvoiddecompression complexity
Core Design Contradiction:
Quantity of substanceVSDevice complexity

Solution Approach 1:

The patent replaces complex software-based decompression algorithms with hardware-friendly mathematical operations. The decompression process uses simple linear interpolation between stored endpoint values, which can be efficiently implemented in hardware graphics processing units, thereby reducing the complexity barrier for compact format decompression.

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

3Adaptability or versatility

If conventional compression formats are used, then compatibility is maintained, but processing efficiency for high dynamic range data deteriorates

Engineering Contradiction:
ImprovecompatibilityVSAvoidprocessing efficiency
Core Design Contradiction:
Adaptability or versatilityVSProductivity

Solution Approach 1:

The patent creates a universal compression framework that can handle both conventional and high dynamic range data using the same endpoint-based approach. The compressed format maintains compatibility with existing graphics hardware while enabling efficient processing of high dynamic range data through the standardized endpoint-interpolation decomposition method.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Data Source

PatentUS7920749B1Modified high dynamic range color decompression
Publication Date: 2011.04.05 NVIDIA CORP
  • US7920749B1 patent drawing
  • US7920749B1 patent drawing
  • US7920749B1 patent drawing

AI summary

Systems and methods for representing high dynamic range data in compressed formats with a fixed size block allow high dynamic range data to be stored in less memory. The compressed formats use 8 bits per pixel. A first compressed format includes two endpoint values and compressed indices for the pixels in the block. A second compressed format includes four endpoint values, a partition index that specifies a mask for each pair of the four endpoint values, and compressed indices for the pixels in the block. The two formats may be used for various blocks within a single compressed image and mode bits are included to distinguish between the two formats. Furthermore, each endpoint value may be encoded using an endpoint compression mode that is also specified by the mode bits. Compressed high dynamic range values represented in either format may be efficiently decompressed in hardware.