Set Reordering for Paletted Data

dc.contributor.author	Schneider, Jens
dc.date.accessioned	2016-01-19T14:45:20Z
dc.date.available	2016-01-19T14:45:20Z
dc.date.issued	2011-03
dc.identifier.citation	Schneider J (2011) Set Reordering for Paletted Data. 2011 Data Compression Conference. Available: http://dx.doi.org/10.1109/dcc.2011.79.
dc.identifier.isbn	9780769543529
dc.identifier.doi	10.1109/dcc.2011.79
dc.identifier.uri	http://hdl.handle.net/10754/594291
dc.description.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.
dc.publisher	Institute of Electrical and Electronics Engineers (IEEE)
dc.subject	Enumerating Permutations
dc.subject	Paletted Images
dc.subject	Vector Quantization
dc.title	Set Reordering for Paletted Data
dc.type	Conference Paper
dc.contributor.department	Visual Computing Center (VCC)
dc.identifier.journal	2011 Data Compression Conference
dc.conference.date	29 March 2011 through 31 March 2011
dc.conference.name	2011 Data Compression Conference, DCC 2011
dc.conference.location	Snowbird, UT
kaust.person	Schneider, Jens