Set Reordering for Paletted Data

Jens Schneider

doi:10.1109/dcc.2011.79

Set Reordering for Paletted Data

Jens Schneider

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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.

Original language	English (US)
Title of host publication	2011 Data Compression Conference
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
ISBN (Print)	9780769543529
DOIs	https://doi.org/10.1109/dcc.2011.79
State	Published - Mar 2011

Access to Document

10.1109/dcc.2011.79

Cite this

@inproceedings{1923c25ff77b4833bd7d95bd4ce7806a,

title = "Set Reordering for Paletted Data",

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. {\textcopyright} 2011 IEEE.",

author = "Jens Schneider",

note = "KAUST Repository Item: Exported on 2020-10-01",

year = "2011",

month = mar,

doi = "10.1109/dcc.2011.79",

language = "English (US)",

isbn = "9780769543529",

booktitle = "2011 Data Compression Conference",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

}

TY - GEN

T1 - Set Reordering for Paletted Data

AU - Schneider, Jens

N1 - KAUST Repository Item: Exported on 2020-10-01

PY - 2011/3

Y1 - 2011/3

N2 - 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.

AB - 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.

UR - http://hdl.handle.net/10754/594291

UR - http://ieeexplore.ieee.org/document/5749532/

UR - http://www.scopus.com/inward/record.url?scp=79955711110&partnerID=8YFLogxK

U2 - 10.1109/dcc.2011.79

DO - 10.1109/dcc.2011.79

M3 - Conference contribution

SN - 9780769543529

BT - 2011 Data Compression Conference

PB - Institute of Electrical and Electronics Engineers (IEEE)

ER -

Set Reordering for Paletted Data

Abstract

Access to Document

Other files and links

Fingerprint

Cite this