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.

Exact and Error-Bounded Approximate Color Buffer Compression and Decompression

På svenska

Author

Editor

  • Timo Aila
  • Mark Segal

Summary, in English

In this paper, we first present a survey of existing color buffer compression algorithms. After that, we introduce a new scheme based on an exactly reversible color transform, simple prediction, and Golomb-Rice encoding. In addition to this, we introduce an error control mechanism, which can be used for approximate (lossy) color buffer compression. In this way, the introduced error is kept under strict control. To the best of our knowledge, this has not been explored before in the literature. Our results indicate superior compression ratios compared to existing algorithms, and we believe that approximate compression can be important for mobile GPUs

Publishing year

2007

Language

English

Pages

41-48

Publication/Series

Proceedings of the 22nd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware

Volume

2007

Document type

Conference paper

Publisher

Association for Computing Machinery (ACM)

Topic

  • Computer Science

Keywords

  • color buffer compression
  • 3D graphics

Conference name

Graphics Hardware, 2007

Conference date

2007-08-04 - 2007-08-05

Conference place

San Diego, United States

Status

Published

Research group

  • Computer Graphics

ISBN/ISSN/Other

  • ISBN: 978-1-59593-625-7