1. Tradeoffs

2. Availability

3. See also

4. References

5. External links

Texture compression is a specialized form of image compression designed for storing texture maps in 3D computer graphics rendering systems. Unlike conventional image compression algorithms, texture compression algorithms are optimized for random access.

Tradeoffs

In their seminal paper on texture compression,^[1] Beers, Agrawala and Chaddha list four features that tend to differentiate texture compression from other image compression techniques. These features are:

Decoding Speed

It is highly desirable to be able to render directly from the compressed texture data and so, in order not to impact rendering performance, decompression must be fast.

Random Access

Since predicting the order that a renderer accesses texels would be difficult, any texture compression scheme must allow fast random access to decompressed texture data. This tends to rule out many better-known image compression schemes such as JPEG or run-length encoding.

Compression Rate and Visual Quality

In a rendering system, lossy compression can be more tolerable than for other use cases. Some texture compression libraries, such as crunch,^[2] allow the developer to flexibly trade off compression rate vs. visual quality, using methods such as rate-distortion optimization (RDO).

Encoding Speed

Texture compression is more tolerant of asymmetric encoding/decoding rates as the encoding process is often done only once during the application authoring process.

Given the above, most texture compression algorithms involve some form of fixed-rate lossy vector quantization of small fixed-size blocks of pixels into small fixed-size blocks of coding bits, sometimes with additional extra pre-processing and post-processing steps. Block Truncation Coding is a very simple example of this family of algorithms.

Because their data access patterns are well-defined, texture decompression may be executed on-the-fly during rendering as part of the overall graphics pipeline, reducing overall bandwidth and storage needs throughout the graphics system. As well as texture maps, texture compression may also be used to encode other kinds of rendering map, including bump maps and surface normal maps. Texture compression may also be used together with other forms of map processing such as MIP maps and anisotropic filtering.

Availability

Some examples of practical texture compression systems are S3 Texture Compression (S3TC), PVRTC, Ericsson Texture Compression (ETC) and Adaptive Scalable Texture Compression (ASTC); these may be supported by special function units in modern Graphics processing units.

OpenGL and OpenGL ES, as implemented on many video accelerator cards and mobile GPUs, can support multiple common kinds of texture compression - generally through the use of vendor extensions.

Texture compression can be applied to reduce memory usage at runtime, as opposed to texture compression designed to reduce download or disk size. For 64-bit iPhone and iPad hardware, the RenderReduce Framework can be applied to significantly reduce memory use. Texture data is often the largest source of memory usage in a mobile application.

See also

• Block Truncation Coding (BTC)
• Vector quantization
• Color Cell Compression

References

External links

• http://gamma.cs.unc.edu/GST/ GST: GPU-decodable Supercompressed Textures

• Heliosia punctinigra
• Heliosia rufa
• Heliosia suffusus
• Helios IIB
• Helio Silva
• Heliosis
• Helios/Pegasus
• Heliosperma
• HelioSphera
• HELIOSPHERA
• Heliospheric Termination Shock Boundary
• Helios Sessolo
• Heliostibes barbarica
• Heliostibes chlorobela
• Heliostibes electrica
• Heliostibes gregalis
• Heliostibes illita
• Helios (wrestler)
• Heliothela albocilialis
• Heliothela aterrima
• Heliothela atra
• Heliothela coerulealis
• Heliothela costipunctalis
• Heliothela cretostrigalis
• Heliothela didymospila