O2tc:利用二進制優點的高品質、低複雜度二進制材質壓縮法
柯天人
- pp 1-55
TLDR
This work proposes an order-of-two texture compression method—O2TC (Order of 2 Texture Compression) to achieve high compression rate, easy decompression, and high quality after decompression.Abstract:
Texture compression is necessary for limited storage and low bandwidth devices. While lossy compressions are effective, quality of texture after recovery becomes an issue. We propose an order-of-two texture compression method—O2TC (Order of 2 Texture Compression) to achieve high compression rate, easy decompression, and high quality after decompression. O2TC tries to exploit virtues in binary system. Its attributes include: judicious selection and coding of representative base colors, and simple and parallelizable retrieval of block of texels. We use either a pair of base colors or a base colors and a difference, and simple and fast binary calculations—without *, ÷ or approximation—to inter/extrapolate them into representative colors. Truncation error upper bound is also minimized with implicit color bits. With 2’s complement arithmetic, we further reduce the compression/decompression error. And alpha channel can be treated the same. Compared with renowned S3TC’s DXT5, our method has much simplified decompression with better texture quality—0.37, 2.80 and 0.15 dB better on average with O2TC RGB888, 8-color, and Plain64-64 options, respectively, on popular alpha maps.read more
References
More filters
Book
Computer Graphics: Principles and Practice
TL;DR: This chapter discusses the development of Hardware and Software for Computer Graphics, and the design methodology of User-Computer Dialogues, which led to the creation of the Simple Raster Graphics Package.
Proceedings ArticleDOI
Topology matching for fully automatic similarity estimation of 3D shapes
TL;DR: A novel technique is proposed, called Topology Matching, in which similarity between polyhedral models is quickly, accurately, and automatically calculated by comparing Multiresolutional Reeb Graphs (MRGs), which operates well as a search key for 3D shape data sets.
Proceedings ArticleDOI
A user-programmable vertex engine
TL;DR: The design, programming interface, and implementation of a very efficient user-programmable vertex engine embedded in the broader fixed function pipeline, supported by transparent multi-threading and bypassing to preserve parallelism and performance is described.
Proceedings ArticleDOI
iPACKMAN: high-quality, low-complexity texture compression for mobile phones
Jacob Ström,Tomas Akenine-Möller +1 more
TL;DR: This work presents a novel texture compression scheme, called iPACKMAN, targeted for hardware implementation, which outperforms the previous de facto standard texture compression algorithms in the majority of all cases that it has tested.