Set reordering for paletted data

Jens Schneider

doi:10.1109/DCC.2011.79

Set reordering for paletted data

Jens Schneider^*

^*Corresponding author for this work

King Abdullah University of Science and Technology

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

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.

Original language	English
Title of host publication	Proceedings - DCC 2011
Subtitle of host publication	2011 Data Compression Conference
Pages	475
Number of pages	1
DOIs	https://doi.org/10.1109/DCC.2011.79
Publication status	Published - 2011
Externally published	Yes
Event	2011 Data Compression Conference, DCC 2011 - Snowbird, UT, United States Duration: 29 Mar 2011 → 31 Mar 2011

Publication series

Name	Data Compression Conference Proceedings
ISSN (Print)	1068-0314

Conference

Conference	2011 Data Compression Conference, DCC 2011
Country/Territory	United States
City	Snowbird, UT
Period	29/03/11 → 31/03/11

Keywords

Enumerating Permutations
Paletted Images
Vector Quantization

Access to Document

10.1109/DCC.2011.79

Cite this

@inproceedings{f9a98e80a05648e78becd25c5d121db3,

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.",

keywords = "Enumerating Permutations, Paletted Images, Vector Quantization",

author = "Jens Schneider",

year = "2011",

doi = "10.1109/DCC.2011.79",

language = "English",

isbn = "9780769543529",

series = "Data Compression Conference Proceedings",

pages = "475",

booktitle = "Proceedings - DCC 2011",

note = "2011 Data Compression Conference, DCC 2011 ; Conference date: 29-03-2011 Through 31-03-2011",

}

TY - GEN

T1 - Set reordering for paletted data

AU - Schneider, Jens

PY - 2011

Y1 - 2011

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.

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.

KW - Enumerating Permutations

KW - Paletted Images

KW - Vector Quantization

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

AN - SCOPUS:79955711110

SN - 9780769543529

T3 - Data Compression Conference Proceedings

SP - 475

BT - Proceedings - DCC 2011

T2 - 2011 Data Compression Conference, DCC 2011

Y2 - 29 March 2011 through 31 March 2011

ER -

Set reordering for paletted data

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this