Advanced

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

Rasmusson, Jim LU ; Strom, Jacob and Akenine-Möller, Tomas LU (2010) In Visual Computer 26(1). p.17-30
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.
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to journal
publication status
published
subject
keywords
Texture compression, Lossy compression, Color buffer compression, Real-time, High dynamic range, Quadtree
in
Visual Computer
volume
26
issue
1
pages
17 - 30
publisher
Springer
external identifiers
  • wos:000272325300002
  • scopus:72549101353
ISSN
0178-2789
DOI
10.1007/s00371-009-0372-y
language
English
LU publication?
yes
id
a1e99ff5-6474-44c4-a25b-d45758c40efe (old id 1535666)
date added to LUP
2010-01-27 11:29:22
date last changed
2018-05-29 11:26:41
@article{a1e99ff5-6474-44c4-a25b-d45758c40efe,
  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.},
  author       = {Rasmusson, Jim and Strom, Jacob and Akenine-Möller, Tomas},
  issn         = {0178-2789},
  keyword      = {Texture compression,Lossy compression,Color buffer compression,Real-time,High dynamic range,Quadtree},
  language     = {eng},
  number       = {1},
  pages        = {17--30},
  publisher    = {Springer},
  series       = {Visual Computer},
  title        = {Error-bounded lossy compression of floating-point color buffers using quadtree decomposition},
  url          = {http://dx.doi.org/10.1007/s00371-009-0372-y},
  volume       = {26},
  year         = {2010},
}