Proceedings DCC 2000. Data Compression Conference最新文献_第5页

Single-bit oversampled A/D conversion with exponential accuracy in the bit-rate 单比特过采样A/D转换与指数精度的比特率

Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838174

Z. Cvetković, I. Daubechies

引用次数: 20

Multiple description lattice vector quantization: variations and extensions 多重描述点阵矢量量化:变化与扩展

Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838188

Jonathan A. Kelner, Vivek K Goyal, J. Kovacevic

引用次数: 43

Joint source-channel soft decoding of Huffman codes with turbo-codes 带涡轮码的霍夫曼码源信道联合软译码

Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838148

Lionel Guivarch, J. Carlach, P. Siohan

引用次数: 52

Compressed domain texture classification from a modified EZW symbol stream 压缩域纹理分类从一个修改EZW符号流

Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838226

B. Wilson, M. Bayoumi

引用次数: 1

A spatially coherent discrete wavelet transform - accessing the localization property for data compression 一种空间相干离散小波变换——获取数据压缩的局部化特性

Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838211

Kunal Mukherjee, A. Mukherjee

引用次数: 0

On the average redundancy rate of the Lempel-Ziv code with k-error protocol 基于k-error协议的Lempel-Ziv码的平均冗余率

Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838177

G. Louchard, W. Szpankowski

引用次数: 41

A three-layer, two description image coder 一个三层，两种描述图像编码器

Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838224

F. Ware, J. Gibson

{"title":"A three-layer, two description image coder","authors":"F. Ware, J. Gibson","doi":"10.1109/DCC.2000.838224","DOIUrl":"https://doi.org/10.1109/DCC.2000.838224","url":null,"abstract":"Summary form only given. We propose a new DCT-based image coder that provides a balance in three areas: compression, progressive coding, and robustness. We design a unique form of progressive coding. The scheme is described as a three-layer, two description image coder because it provides three levels of progressive coding where the last two layers refine the image independent of each other. This is the first image (source) coder of this type. Our coding technique increases robustness to lost information when compared to traditional progressive coding methods, and it maintains progressivity. The proposed coding technique implements two levels of coefficient scaling. The goal of the first level of coefficient scaling is to obtain a coarse representation of the original DCT coefficients by using large quantization step sizes. Next, the coarse representation of each DCT block is subtracted from the original, producing a quantization error or residual, which is quantized with smaller step sizes. At this point, we have two quantized representations taken from the original DCT coefficients. To create two layers of image refinement, the residual data is divided into two descriptions such that adding either description to the coarse representation provides a significant improvement in image quality. Thus, the coding scheme creates three layers of successive refinement of image quality, where the first layer provides a coarse or base level of quality and the two following layers provide independent, full image descriptions for refinement. We show that the proposed layered image coding scheme provides good performance for practical packet erasure rates experienced in the two refinement layers.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129073300","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

Compression of biological sequences by greedy off-line textual substitution 生物序列的贪婪离线文本替换压缩

Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838154

A. Apostolico, S. Lonardi

{"title":"Compression of biological sequences by greedy off-line textual substitution","authors":"A. Apostolico, S. Lonardi","doi":"10.1109/DCC.2000.838154","DOIUrl":"https://doi.org/10.1109/DCC.2000.838154","url":null,"abstract":"We follow one of the simplest possible steepest descent paradigms. This consists of performing repeated stages in each one of which we identify a substring of the current version of the text yielding the maximum compression, and then replace all those occurrences except one with a pair of pointers to the untouched occurrence. This is somewhat dual with respect to the bottom up vocabulary buildup scheme considered by Rubin. This simple scheme already poses some interesting algorithmic problems. In terms of performance, the method does outperform current Lempel-Ziv implementations in most of cases. Here we show that, on biological sequences, it beats all other generic compression methods and approaches the performance of methods specifically built around some peculiar regularities of DNA sequences, such as tandem repeats and palindromes, that are neither distinguished nor treated selectively here. The most interesting performances, however, are obtained in the compression of entire groups of genetic sequences forming families with similar characteristics. This is becoming a standard and useful way to group sequences in a growing number of important specialized databases. On such inputs, the approach presented here yields scores that are not only better than those of any other method, but also improve increasingly with increasing input size. This is to be attributed to a certain ability to capture distant relationships among the sequences in a family.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"163 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116553914","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}

引用次数: 79

Data compression with truncated suffix trees 使用截断后缀树进行数据压缩

Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838212

J. Na, Kunsoo Park

引用次数: 7

Channel decoding using inter- and intra-correlation of source encoded frames 信道解码利用源编码帧的内部和内部相关

Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838150

C. Veaux, P. Scalart, A. Gilloire

引用次数: 5