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

Effect of image activity on lossy and lossless coding performance 图像活动对有损和无损编码性能的影响

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

S. Saha, V. Vemuri

引用次数: 4

Summary structures for frequency queries on large transaction sets 对大型事务集进行频率查询的摘要结构

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

Dow-Yung Yang, Akshay Johar, A. Grama, W. Szpankowski

{"title":"Summary structures for frequency queries on large transaction sets","authors":"Dow-Yung Yang, Akshay Johar, A. Grama, W. Szpankowski","doi":"10.1109/DCC.2000.838182","DOIUrl":"https://doi.org/10.1109/DCC.2000.838182","url":null,"abstract":"As large-scale databases become commonplace, there has been significant interest in mining them for commercial purposes. One of the basic tasks that underlies many of these mining operations is querying of transaction sets for frequencies of specified attribute values. The size of these databases makes it important to develop summary structures capable of high compression ratios as well as supporting fast frequency queries. The nature of the problem and its differences with respect to traditional text compression allows very high compression ratios. In this paper, we propose a binary trie-based summary structure for representing transaction sets. We demonstrate that this trie structure, when augmented with an appropriate set of horizontal pointers, can support frequency queries several orders of magnitude faster than raw transaction data. We improve the memory characteristics of our scheme by compressing the trie into a Patricia trie and demonstrate that this does not have a significant adverse effect on frequency query time. We further reduce the size of this trie by selectively pruning branches to compute a \"dominant\" trie that is capable of approximate frequency querying. The complement trie called the \"deviant\" trie is also useful in many data mining applications. Recompressing the \"dominant\" trie into a Patricia trie results in further compression of the trie. Finally, we demonstrate that our binary compressed trie structure has better memory (compression) characteristics compared to related schemes. We support our claims with experimental results on datasets from the IBM synthetic association data generator.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"76 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":"127939254","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}

引用次数: 11

Iterative source/channel-decoding using reversible variable length codes 使用可逆可变长度码的迭代源/信道解码

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

R. Bauer, J. Hagenauer

引用次数: 65

Seismic data compression using GenLOT: towards "optimality"? 地震数据压缩使用GenLOT:朝着“最优”?

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

L. Duval, V. Bui-Tran, Truong Q. Nguyen, T. Tran

{"title":"Seismic data compression using GenLOT: towards \"optimality\"?","authors":"L. Duval, V. Bui-Tran, Truong Q. Nguyen, T. Tran","doi":"10.1109/DCC.2000.838199","DOIUrl":"https://doi.org/10.1109/DCC.2000.838199","url":null,"abstract":"Summary form only given. Seismic data compression is desirable in geophysics for both storage and transmission stages. Wavelet coding methods have generated interesting developments, including a real-time field test trial in the North Sea in 1995. Previous work showed that GenLOT with basic optimization also outperforms state-of-the-art biorthogonal wavelet coders for seismic data. In this paper, we focus on the problem of filter bank optimization using various properties of seismic data. It is often desirable to evaluate the compression performance of a transform on a set of data using a priori objective measures, to reduce extensive testings by selecting only good a priori transforms, and to tailor transforms to the statistical properties of the data set. In the scope of this work, we use symmetric AR models up to order 4 to obtain an average model of the horizontal and vertical signals of a seismic stack section. Rosten et al. (1999), have already shown that order 1 or 2 models give good results in filter bank optimization for non-unitary filter banks, using coding gain optimization. Several other criteria may be used for transform optimization. Following the theory in Tran and Nguyen (1999), we use a weighted combination of C/sub o/=k/sub C/C/sub C/+k/sub S/C/sub S/+k/sub d/C/sub D/ of coding gain, stopband attenuation and DC leakage minimization functions.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"191 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":"129871549","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}

引用次数: 3

An overview of JPEG-2000 JPEG-2000概述

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

M. Marcellin, M. Gormish, A. Bilgin, M. Boliek

引用次数: 454

Arithmetic coding for low power embedded system design 低功耗嵌入式系统的算术编码设计

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

H. Lekatsas, W. Wolf, J. Henkel

引用次数: 17

Rate distortion behavior of threshold-based nonlinear approximations 基于阈值的非线性近似的速率畸变行为

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

C. Weidmann, M. Vetterli

引用次数: 7

Bit rate and local quality control for on-board satellite image compression 星载卫星图像压缩的比特率和局部质量控制

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

D. L. Guen, S. Pateux, C. Labit, G. Moury, D. Lebedeff

引用次数: 0

A new method for optimal rate allocation for progressive image transmission over noisy channels 噪声信道上渐进图像传输最优速率分配的新方法

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

Minyi Zhao, Aydin Alatan, A. Akansu

引用次数: 17

Complexity-scalable transform coding using variable complexity algorithms 复杂性-可扩展的转换编码使用可变复杂度算法

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

W. Pan, Antonio Ortega

{"title":"Complexity-scalable transform coding using variable complexity algorithms","authors":"W. Pan, Antonio Ortega","doi":"10.1109/DCC.2000.838166","DOIUrl":"https://doi.org/10.1109/DCC.2000.838166","url":null,"abstract":"In applications where compression has to be performed under varying complexity constraints (e.g., with hardware having to operate in reduced power mode) it is beneficial to design compression algorithms that allow some degree of complexity scalability. In this paper we explore complexity scalability for transform coding algorithms. We show that a variable complexity algorithm (VCA), which uses energy thresholds to determine the number of coefficients to be computed for each input, is preferable to other alternatives such as a pruned transform, where the same number of coefficients is computed for the whole image. We show that the benefits include not only a higher degree of scalability, but also increased compression performance, as we take advantage of the energy classification that is needed for VCA operation and design quantizers that match each class. We provide expressions for the average complexity as well as rate/distortion relations for a generic N-point VCA transform. For a two point case, we present closed-form relations describing the variance changes in two classes. In addition, rate-distortion-complexity relations are also empirically obtained. We apply VCA to eight-point KLT and 8/spl times/8 DCT in the JPEG framework and experiments show that the VCA approach is superior in rate/distortion performance at low rates compared to the standard transform coding techniques.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"14 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":"134481139","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}

引用次数: 16