Set Reordering for Paletted Data

Type
Conference Paper

Authors
Schneider, Jens

KAUST Department
Visual Computing Center (VCC)

Date
2011-03

Abstract
We present a novel method to recycle bits of paletted data sets. We exploit that the codebook of such data can be reordered without affecting the content. Enumerating all possible permutations of N codebook entries yields an additional O(N log2 N) bits that can be used without storage overhed for the losless encoding of a limited amount of tags, meta-information, or part of the actual data. © 2011 IEEE.

Citation
Schneider J (2011) Set Reordering for Paletted Data. 2011 Data Compression Conference. Available: http://dx.doi.org/10.1109/dcc.2011.79.

Publisher
Institute of Electrical and Electronics Engineers (IEEE)

Journal
2011 Data Compression Conference

Conference/Event Name
2011 Data Compression Conference, DCC 2011

DOI
10.1109/dcc.2011.79

Permanent link to this record