The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

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

På svenska

Author

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.

Publishing year

2010

Language

English

Pages

17-30

Publication/Series

Visual Computer

Volume

26

Issue

1

Document type

Journal article

Publisher

Springer

Topic

  • Computer Science

Keywords

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

Status

Published

ISBN/ISSN/Other

  • ISSN: 0178-2789