Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

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

In English

Författare

Summary, in English

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.

Publiceringsår

2010

Språk

Engelska

Sidor

17-30

Publikation/Tidskrift/Serie

Visual Computer

Volym

26

Issue

1

Dokumenttyp

Artikel i tidskrift

Förlag

Springer

Ämne

  • Computer Science

Nyckelord

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

Status

Published

ISBN/ISSN/Övrigt

  • ISSN: 0178-2789