DCC 2001: Proceedings, Data Compression Conference, March 27-29, 2001, Snowbird, UtahJames Andrew Storer, Martin Cohn The proceedings of the March 2000 conference consists of 52 papers, one invited presentation on JPEG-2000, and 39 posters. Paper topics include joint source/channel coding using arithmetic codes, implementing the context tree weighting method for text compression, the performance of BWT sorting algorithms, optimal subtractive dither for near-lossless compression, modifications of uniform quantization applied in wavelet coder, rate distortion behavior of threshold-based nonlinear approximations, and robust video coding for packet networks with feedback. No subject index. Annotation copyrighted by Book News, Inc., Portland, OR. |
Contents
On Zadors EntropyConstrained Quantization Theorem | 3 |
Network Vector Quantization | 13 |
Design of TreeStructured Multiple Description Vector Quantizers | 23 |
Copyright | |
54 other sections not shown
Other editions - View all
Common terms and phrases
achieve adaptive applied approach arithmetic coding binary bit rate bitplane block bytes bzip2 channel channel coding coder codeword component compressed text compression algorithm compression ratio Computer correlation corresponding Data Compression Conference decoder decompression defined denote dictionary distortion edges efficient encoder entropy estimate Figure filter frame given graph gzip Huffman code IEEE Trans IEEE Transactions image coding image compression implementation improve input iteration JBIG layer length lossless lossless data compression matrix method minimize motion compensation node optimal output parameters partition pattern matching performance pixels PPMD prediction error predictor probability problem Proc PSNR quadtree rate-distortion reconstruction redundancy scalable scheme Section segment sequence side information signal source coding SPIHT string structure subband symbol Table tags techniques Theorem tree trellis turbo values vector quantization Viterbi search wavelet coefficients wavelet transform Web graph zero