Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)最新文献

Empirical channel matched quantizer design and UEP for robust image transmission 鲁棒图像传输的经验信道匹配量化器设计和UEP

Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672245

R. Chandramouli, N. Ranganathan, S. J. Ramadoss

{"title":"Empirical channel matched quantizer design and UEP for robust image transmission","authors":"R. Chandramouli, N. Ranganathan, S. J. Ramadoss","doi":"10.1109/DCC.1998.672245","DOIUrl":"https://doi.org/10.1109/DCC.1998.672245","url":null,"abstract":"Summary form only given. Channel matched quantization for image transmission over time varying channels reduces the effects of channel errors. The presence of variable length codes in compression standards like the JPEG cause error propagation due to bit errors. Unequal error protection (UEP) schemes have emerged as an effective method to combat catastrophic loss in the received signal due to burst and random errors. An empirical channel matched quantizer design algorithm that jointly optimizes the distortion due to quantization-channel noise and a new efficient UEP scheme for image transmission are proposed. The baseline JPEG encoder is used to compress the 8-bit gray level images before transmission. A slow frequency non-selective Rayleigh fading channel is considered in this study. A quantization table optimized for human visual quality is used for very low channel bit error rates. For higher bit error rates, the quantization table is matched to the channel conditions by multiplying its entries by the optimal quantization multiplication factor, M/sup */ such that the average number of received image blocks in error is minimized. M/sup */ is computed for each bit error rate ranging from 10/sup -4/ to 10/sup -1/ through empirical modeling of the trade-off between the quantization and the channel noise. In order to enhance the performance of the proposed system, a new UEP scheme that limits the error propagation due to variable length encoding is used. This scheme works by packing the output bits of the JPEG coder into slots of fixed size.","PeriodicalId":191890,"journal":{"name":"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121927386","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Joint source-channel coding using space-filling curves for bandwidth compression 联合源信道编码利用空间填充曲线进行带宽压缩

Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672258

Sae-Young Chung, M. Trott

引用次数: 1

Context models for palette images 调色板图像的上下文模型

Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672159

Paul J. Ausbeck

引用次数: 21

Higher compression from the Burrows-Wheeler transform by modified sorting 改进的排序提高了Burrows-Wheeler变换的压缩率

Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672253

B. Chapin, S. Tate

{"title":"Higher compression from the Burrows-Wheeler transform by modified sorting","authors":"B. Chapin, S. Tate","doi":"10.1109/DCC.1998.672253","DOIUrl":"https://doi.org/10.1109/DCC.1998.672253","url":null,"abstract":"Summary form only given. The Burrows-Wheeler transform (BWT) compression technique is based on sorting substrings of the input, and has a performance rivalling the best previously known techniques. We show that the ordering used in the sorting stage of the BWT, an aspect hitherto ignored, can have a significant impact on the size of the compressed data. We modify the sorting order in two separate ways. First, we try reordering the symbol alphabet, and doing a standard sort based on the permuted character set. This is particularly interesting because the BWT's sensitivity to alphabet ordering is fairly unique among general-purpose compression schemes. Previous techniques, including statistical techniques (such as the PPM algorithms) and dictionary techniques (represented by LZ77, LZ78, and their descendants), are largely based on pattern matching which is entirely independent of the encoding used for the source alphabet. On files in which the alphabet is arbitrarily ordered, such as ASCII text and certain domain-specific encoding; such as the geo file from the Calgary Compression Corpus, this technique improved the compression ratio of the BWT-based compression algorithm. On the other hand, data which already had a significant alphabet ordering, such as image data, showed little improvement with this technique. The second modified sorting technique was to modify the sorting algorithm itself to order strings in a manner analogous to reflected Gray codes. In particular, we alternated increasing and decreasing order on the second character position, changing whenever the character in the first position changed.","PeriodicalId":191890,"journal":{"name":"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129055764","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 42

Grouping algorithm for lossless data compression 分组算法的无损数据压缩

Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672316

N. Tadayon, G. Feng, T. Rao, E. Hinds

{"title":"Grouping algorithm for lossless data compression","authors":"N. Tadayon, G. Feng, T. Rao, E. Hinds","doi":"10.1109/DCC.1998.672316","DOIUrl":"https://doi.org/10.1109/DCC.1998.672316","url":null,"abstract":"Summary form only given. There are in fact two main parts in this paper. One is a modification to context-tree weighting algorithm known as CTW, and the other is a new algorithm called grouping. In the CTW method, we consider a binary tree as a context-tree T/sub D/, where each node s in this tree has length l(s) with 0/spl ges/l(s)/spl ges/D for a source generating a sequence of binary digits. There are counts a/sub s/, and b/sub s/, for each node s of T/sub D/ denoting the number of zeros and ones respectively. Each internal node s of the tree has two children 0s and 1s. The root of the tree corresponds to memoryless model /spl lambda/ and each node corresponds to a prefix sequence. The second part of the paper, introduces a new algorithm that considers all different binary trees of length /spl ges/D as complete sets of alphabets for a binary source. By using the KT estimator for each of these alphabet models, we find the probability distribution gained by all different complete extended alphabets. By grouping these models, we define the coding distribution as the average of the probabilities for all the models. We have demonstrated a quick algorithm for this idea and call this approach a grouping algorithm. This approach also breaks the extended alphabet model probability distribution into the non-extended one. Note that the result of this algorithm will produce at most log M(D) more code words than the optimal selection of strings of length at most D, as letters of the alphabet.","PeriodicalId":191890,"journal":{"name":"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130331410","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

The Z-coder adaptive binary coder z编码器自适应二进制编码器

Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672124

L. Bottou, P. Howard, Yoshua Bengio

引用次数: 56

Minimum message length hidden Markov modelling 最小消息长度隐马尔可夫建模

Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672145

T. Edgoose, L. Allison

引用次数: 2

Feature preserving lossy image compression using nonlinear PDEs 基于非线性偏微分方程的特征保留有损图像压缩

Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1117/12.325724

T. Chan, Haotian Zhou

引用次数: 9

The multiple description rate region for high resolution source coding 多描述率区域用于高分辨率源编码

Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672141

T. Linder, R. Zamir, K. Zeger

{"title":"The multiple description rate region for high resolution source coding","authors":"T. Linder, R. Zamir, K. Zeger","doi":"10.1109/DCC.1998.672141","DOIUrl":"https://doi.org/10.1109/DCC.1998.672141","url":null,"abstract":"Consider encoding a memoryless source using two descriptions, the first at rate R/sub 1/ and distortion d/sub 1/, the second at rate R/sub 2/ and distortion d/sub 2/. Combining the two descriptions the source can be reconstructed with distortion d/sub 0/. For a Gaussian source of variance /spl sigma//sup 2/, Ozarow (1980) found an explicit characterization of the region R*(/spl sigma//sup 2/; d/sub 1/,d/sub 2/,d/sub 0/)/spl sub/R/sup 2/ of achievable rate pairs (R/sub 1/, R/sub 2/) with given mean squared distortions d/sub 1/, d/sub 2/, and d/sub 0/. This is the only case for which the multiple description rate-distortion region is completely known. We show that for a general real valued source X and a locally quadratic distortion measure of the form /spl rho/(x,x/spl circ/)=w(x)/sup 2/(x-x/spl circ/)/sup 2/+o((x-x/spl circ/)/sup 2/), the region of admissible rate pairs is arbitrary well approximated in the limit of small distortions by the region R*(P/sub X/2/sup 2E{log m(X)}/; d/sub 1/,d/sub 2/,d/sub 0/) where R*(/spl sigma//sup 2/; d/sub 1/,/sub 2/, d/sub 0/) denotes the multiple description rate region of a Gaussian source with variance /spl sigma//sup 2/, and where P/sub X/ is the entropy-power of the source. Applications to companding quantization are also considered.","PeriodicalId":191890,"journal":{"name":"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131616250","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 21

Lossless compression of binary audio signals 无损压缩二进制音频信号

Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672321

R. V. D. Vleuten, Fons Bruekers

引用次数: 1