Adaptive Texture Compression Median Lookup
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current texture compression techniques, such as S3TC, are inadequate for efficiently managing memory and bandwidth in mobile and low-power systems used for 3D graphics, particularly in wireless phone architectures, as they do not effectively compress and decompress textures in real-time without significant performance degradation.
Innovation Solution
An adaptive method for selecting reference colors to construct a look-up table, where groups of colors are formed, and the median color is chosen as the representative, with error computation and bitstream composition differing from S3TC, allowing for more efficient compression and decompression.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If S3TC algorithm is used for texture compression, then memory size is reduced, but decompression latency and processing time increase
Solution Approach 1:
The patent pre-calculates and stores error values in a lookup table during compression, so that during decompression only simple table lookups and arithmetic operations are needed, dramatically reducing decompression latency while maintaining compression ratios
2Quantity of substance
If S3TC algorithm is used for texture compression, then memory bandwidth is reduced, but visual quality and objective measures degrade
Solution Approach 1:
The patent modifies the color selection parameters by using median colors of sorted color groups instead of simple min/max colors, and changes the error calculation to use Euclidean distance with weighted components, improving visual quality while maintaining bandwidth efficiency
3Manufacturing precision
If adaptive median color selection is implemented, then visual quality improves, but computational complexity increases
Solution Approach 1:
The patent performs the computationally intensive median color calculation and error value storage during the offline compression phase, creating lookup tables that contain pre-computed error values. This shifts the computational burden from runtime decompression to offline preparation, making the runtime operation simple and efficient
Solution Approach 2:
The patent creates a lookup table that copies and stores pre-computed error values for different color combinations. During decompression, instead of recalculating errors, the system simply looks up pre-stored values, dramatically reducing computational complexity at runtime
Data Source
AI summary
A method for texture compressing images having a plurality of color components (R, G, B) includes defining color representatives for use in encoding by defining groups of colors for each color component (R,G,B), and selecting a representative median color for the group. Each group ideally includes 3 to 15 increasing colors. The method includes computing, for each group, an error between each member of the group and the representative median color of the group. Typically, the error is computed as the sum of the absolute differences (SAD) between each member of the group and the representative median color of the group.