Skip to main content
Log in

Error-bounded lossy compression of floating-point color buffers using quadtree decomposition

  • Original Article
  • Published:
The Visual Computer Aims and scope Submit manuscript

Abstract

In this paper, we present a new color buffer compression algorithm for floating-point buffers. It can operate in either an approximate (lossy) mode or in an exact (lossless) mode. The approximate mode is error-bounded and the amount of introduced accumulated error is controlled via a few parameters. The core of the algorithm lies in an efficient representation and color space transform, followed by a hierarchical quadtree decomposition, and then hierarchical prediction and Golomb–Rice encoding. We believe this is the first lossy compression algorithm for floating-point buffers, and our results indicate significantly reduced color buffer bandwidths and negligible visible artifacts.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Beers, A.C., Agrawala, M., Chadda, N.: Rendering from compressed textures. In: Proceedings of ACM SIGGRAPH 96, pp. 373–378 (1996)

  2. Bogart, R., Kainz, F., Hess, D.: OpenEXR image file format. In: ACM SIGGRAPH Sketches & Applications (2003)

  3. Caglar, A., Ojani, A.: Evaluation and hardware implementation of real-time color buffer compression algorithms. Master’s thesis, Linköping University, 11 (2008)

  4. Golomb, S.W.: Run-length encodings. IEEE Trans. Inf. Theory, 399–401 (1966)

  5. Hasselgren, J., Akenine-Möller, T.: Efficient depth buffer compression. In: Graphics Hardware, pp. 103–110 (2006)

  6. Knittel, G., Schilling, A.G., Kugler, A., Straßer, W.: Hardware for superior texture performance. Comput. Graph. 20(4), 475–481 (1996)

    Article  Google Scholar 

  7. Lehtinen, J.: A framework for precomputed and captured light transport. ACM Trans. Graph. 26(4), 13 (2007)

    Article  Google Scholar 

  8. Lindstrom, P., Isenburg, M.: Fast and efficient compression of floating-point data. IEEE Trans. Vis. Comput. Graph. 12(5), 1245–1250 (2006)

    Article  Google Scholar 

  9. Malvar, H., Sullivan, G.: YC o C g -R: A color space with RGB reversibility and low dynamic range. In: JVT-I014r3 (2003)

  10. Mantiuk, R., Daly, S., Myszkowski, K., Seidel, H.-P.: Predicting visible differences in high dynamic range images—model and its calibration. In: Human Vision and Electronic Imaging X, pp. 204–214 (2005)

  11. Munkberg, J., Clarberg, P., Hasselgren, J., Akenine-Möller, T.: High dynamic range texture compression for graphics hardware. ACM Trans. Graph. 25(3), 698–706 (2006)

    Article  Google Scholar 

  12. Munkberg, J., Clarberg, P., Hasselgren, J., Akenine-Möller, T.: Practical HDR texture compression. Comput. Graph. Forum 27(6), 1664–1676 (2008)

    Article  MATH  Google Scholar 

  13. Rasmusson, J., Hasselgren, J., Akenine-Möller, T.: Exact and error-bounded approximate color buffer compression and decompression. In: Graphics Hardware, pp. 41–48 (2007)

  14. Rice, R.F.: Some practical universal noiseless coding techniques. Technical Report 22, Jet Propulsion Lab (1979)

  15. Roimela, K., Aarnio, T., Itäranta, J.: Efficient high dynamic range texture compression. In: Symposium on Interactive 3D Graphics and Games, pp. 207–214 (2008)

  16. Roimela, K., Aarnio, T., Itäranta, J.: High dynamic range texture compression. ACM Trans. Graph. 25(3), 707–712 (2006)

    Article  Google Scholar 

  17. Ström, J., Akenine-Möller, T.: iPACKMAN: High-quality, low-complexity texture compression for mobile phones. In: Graphics Hardware, pp. 63–70 (2005)

  18. Ström, J., Wennersten, P., Rasmusson, J., Hasselgren, J., Munkberg, J., Clarberg, P., Akenine-Möller, T.: Floating-point buffer compression in a unified codec architecture. In: Graphics Hardware, pp. 96–101 (2008)

  19. Sun, W., Lu, Y., Wu, F., Li, S.: DHTC: An effective DXTC-based HDR texture compression scheme. In: Graphics Hardware, pp. 85–94 (2008)

  20. Teuhola, J.: Fast image compression by quadtree prediction. Real-Time Imaging 4(4), 299–308 (1998)

    Article  Google Scholar 

  21. Torborg, J., Kajiya, J.: Talisman: Commodity real-time 3D graphics for the PC. In: Proceedings of SIGGRAPH, pp. 353–364 (1996)

  22. Wang, L., Wang, X., Sloan, P.-P., Wei, L.-Y., Tong, X., Guo, B.: Rendering from compressed high dynamic range textures on programmable graphics hardware. In: Symposium on Interactive 3D Graphics and Games, pp. 17–24 (2007)

  23. Wennersten, P., Ström, J.: Table-based alpha compression. In: Eurographics 2009 Computer Graphics Forum, vol. 28, Issue 2, pp. 687–695 (2009)

  24. Wilson, R.: Quad-tree predictive coding: A new class of image data compression algorithms. IEEE Int. Conf. Acoust. Speech Signal Process. 9, 527–530 (1984)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jim Rasmusson.

Electronic Supplementary Material

Below is the link to the electronic supplementary material

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rasmusson, J., Ström, J. & Akenine-Möller, T. Error-bounded lossy compression of floating-point color buffers using quadtree decomposition. Vis Comput 26, 17–30 (2010). https://doi.org/10.1007/s00371-009-0372-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00371-009-0372-y

Keywords

Navigation