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

Jim Rasmusson, Jacob Strom, Tomas Akenine-Möller

Research output: Contribution to journalArticlepeer-review

8 Citations (SciVal)


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.
Original languageEnglish
Pages (from-to)17-30
JournalVisual Computer
Issue number1
Publication statusPublished - 2010

Subject classification (UKÄ)

  • Computer Science


  • Texture compression
  • Lossy compression
  • Color buffer compression
  • Real-time
  • High dynamic range
  • Quadtree


Dive into the research topics of 'Error-bounded lossy compression of floating-point color buffers using quadtree decomposition'. Together they form a unique fingerprint.

Cite this