Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

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

Publiceringsår: 2010
Språk: Engelska
Sidor: 17-30
Publikation/Tidskrift/Serie: Visual Computer
Volym: 26
Nummer: 1
Dokumenttyp: Artikel i tidskrift
Förlag: Springer


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.


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


  • ISSN: 0178-2789

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen