Lossless image data sequence compression using optimal context quantization

Research output: Contribution to journalConference articleResearchpeer-review

331 Downloads (Pure)

Abstract

Context based entropy coding often faces the conflict of a desire for large templates and the problem of context dilution. We consider the problem of finding the quantizer Q that quantizes the K-dimensional causal context Ci=(X(i-t1), X(i-t2), …, X(i-tK)) of a source symbol Xi into one of M conditioning states. A solution giving the minimum adaptive code length for a given data set is presented (when the cost of the context quantizer is neglected). The resulting context quantizers can be used for sequential coding of the sequence X0, X1, X 2, …. A coding scheme based on binary decomposition and context quantization for coding the binary decisions is presented and applied to digital maps and α-plane sequences. The optimal context quantization is also used to evaluate existing heuristic context quantizations.
Original languageEnglish
JournalData Compression Conference. Proceedings
Pages (from-to)53-62
ISSN1068-0314
DOIs
Publication statusPublished - 2001
Event2001 IEEE Data Compression Conference - Snowbird, UT, United States
Duration: 27 Mar 200129 Mar 2001
http://www.informatik.uni-trier.de/~ley/db/conf/dcc/dcc2001.html

Conference

Conference2001 IEEE Data Compression Conference
CountryUnited States
CitySnowbird, UT
Period27/03/200129/03/2001
Internet address

Fingerprint Dive into the research topics of 'Lossless image data sequence compression using optimal context quantization'. Together they form a unique fingerprint.

Cite this