Fractal image compression: theory and application
Fractal image compression: theory and application
Rendering from compressed textures
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Fast texture synthesis using tree-structured vector quantization
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Texture compression with adaptive block partitions (poster session)
MULTIMEDIA '00 Proceedings of the eighth ACM international conference on Multimedia
Image quilting for texture synthesis and transfer
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Real-time texture synthesis by patch-based sampling
ACM Transactions on Graphics (TOG)
Texture compression using low-frequency signal modulation
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
ACM SIGGRAPH 2008 papers
| Hi-index | 0.00 |
In photorealistic rendering, multiple high-resolution texture images are needed to add details to the scene, which makes the limited texture memory exhausted soon. In this paper, we propose a novel compression algorithm for texture image --- incremental texture compression algorithm, in which the textures are compressed to small-sized format and these compressed data are decompressed and rendered in real-time by programmable graphics hardware. Our method dynamically adds new contents into the codebook only when the existed codebook can not encode current region of the texture. In this way, this method can not only compress static textures with high compression ratio, but also efficiently encode dynamic textures in a stream-like manner due to the characteristic of dynamically updating the codebook. Experimental results show that our method is effective to encode textures for real time rendering.