发布求助
文献互助 智能选刊 最新文献

Proceedings DCC 2000. Data Compression Conference最新文献

筛选
英文 中文
Modifications of uniform quantization applied in wavelet coder 小波编码器中均匀量化的改进
Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838169
A. Przelaskowski
{"title":"Modifications of uniform quantization applied in wavelet coder","authors":"A. Przelaskowski","doi":"10.1109/DCC.2000.838169","DOIUrl":"https://doi.org/10.1109/DCC.2000.838169","url":null,"abstract":"An algorithm of wavelet domain data quantization aimed at improving compression efficiency is presented. Threshold data selection is proposed as a more effective uniform quantization modification than zero-zone increasing. To fit adaptively the threshold value to local image features, the estimation of the significance expectation for each wavelet coefficient was included in the thresholding procedure. The remaining data are uniformly quantized without any changes of bin boundaries. As a result, a more effective low-cost quantization scheme was constructed. It allows us to significantly increase the compression efficiency of images. An experimental rate-distortion curve shows the same distortion for decreased bit rates even up to 20% in comparison to standard uniform quantization. Such a quantization technique was applied in a wavelet coder with optimised schemes of decomposition and zerotree based coding. Its compression efficiency is competitive with the most efficient methods across all natural images tested.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"5 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":"123801684","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}
引用次数: 2
Some notes on the context mapping function in lossless data compression 关于无损数据压缩中上下文映射函数的一些注意事项
Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838200
N. Ekstrand, B. Smeets
{"title":"Some notes on the context mapping function in lossless data compression","authors":"N. Ekstrand, B. Smeets","doi":"10.1109/DCC.2000.838200","DOIUrl":"https://doi.org/10.1109/DCC.2000.838200","url":null,"abstract":"One of the major challenges when applying (serial) universal source coding to 2-dimensional data, e.g., images, is to determine suitable context data. For this reason the concept of context mapping function (CMF) has been introduced. In this paper we discuss the foundation for CMF as well an off-line construction method via a combinatorial optimization method.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"10 3 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":"122294398","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
A modification to the Huffman coding of JPEG's baseline compression algorithm 对JPEG基线压缩算法的霍夫曼编码的改进
Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838204
G. Lakhani
{"title":"A modification to the Huffman coding of JPEG's baseline compression algorithm","authors":"G. Lakhani","doi":"10.1109/DCC.2000.838204","DOIUrl":"https://doi.org/10.1109/DCC.2000.838204","url":null,"abstract":"Summary form only given. In a DCT block of a compressed image, the density of non-zero AC coefficients and their size decrease as the block is scanned in the zigzag order. This paper presents a minor modification to the Huffman coding phase of the JPEG baseline algorithm to exploit this redundancy for further compression. Our encoder divides each block into two roughly equal halves (bands) and codes each band using a separate code table. It moves the EOB (end-of-block) marker to the middle of the sequence of non-zero AC coefficients and then replaces it by one of two split markers, whose selection depends on whether the number of non-zero AC coefficients is even or odd. No marker is needed at the end of a block. The major difference between this approach and the spectral selection method of the JPEG progressive mode is that the band boundary is flexible in our approach (i.e., it can vary from block to block).","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"80 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":"128223325","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}
引用次数: 2
Analysis of optimal filter banks for multiple description coding 多描述编码的最优滤波器组分析
Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838172
P. Dragotti, S. Servetto, M. Vetterli
{"title":"Analysis of optimal filter banks for multiple description coding","authors":"P. Dragotti, S. Servetto, M. Vetterli","doi":"10.1109/DCC.2000.838172","DOIUrl":"https://doi.org/10.1109/DCC.2000.838172","url":null,"abstract":"We study the problem of multiple description (MD) coding of stationary Gaussian sources with memory. First, we compute an approximate rate distortion region for these sources, which we prove to be asymptotically tight at high rates: this region generalizes the standard MD rate distortion region for memoryless sources. Then we develop an algorithm for the design of optimal biorthogonal filter banks for MD coding. Finally. We present some experimental results, where we measure the deviation from optimality of our proposed system. For almost uncorrelated sources the gap between the performance of our proposed system and the ideal bounds is quite high, on the other hand for highly correlated sources this gap is reduced, due to the ability of our system to take advantage of the memory in the source. In this case, in realistic scenarios where finite complexity/delay is an issue, the subband coding approach is competitive with other approaches such as the decorrelating transform followed by MD scalar quantizers.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"39 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":"129322316","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
Optimal subtractive dither for near-lossless compression 近无损压缩的最佳减法抖动
Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838162
M. Klimesh
{"title":"Optimal subtractive dither for near-lossless compression","authors":"M. Klimesh","doi":"10.1109/DCC.2000.838162","DOIUrl":"https://doi.org/10.1109/DCC.2000.838162","url":null,"abstract":"Subtractive dither is a technique which may be used to reduce the occurrence of compression artifacts from near-lossless compression. Standard subtractive dither incurs a cost, however, in the form of an increase in rate and distortion, and by giving the reconstructed signal an overall grainy appearance. It is possible to compromise between the costs and benefits of dithering by using dither signals which tend to take on smaller values than the standard dither signal. For reasonable cost and benefit metrics, the optimal dither signals are shown to be those which are uniform on intervals of the form [-k/2,k/2], where k/spl epsiv/[0,q] and q is the quantization step size. Additional results are given under more general assumptions.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"36 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":"114311410","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}
引用次数: 1
Text categorization using compression models 使用压缩模型的文本分类
Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838202
E. Frank, Chang Chui, I. Witten
{"title":"Text categorization using compression models","authors":"E. Frank, Chang Chui, I. Witten","doi":"10.1109/DCC.2000.838202","DOIUrl":"https://doi.org/10.1109/DCC.2000.838202","url":null,"abstract":"Summary form only given. Test categorization is the assignment of natural language texts to predefined categories based on their concept. The use of predefined categories implies a \"supervised learning\" approach to categorization, where already-classified articles which effectively define the categories are used as \"training data\" to build a model that can be used for classifying new articles that comprise \"the data\". Typical approaches extract features from articles and use the feature vectors as input to a machine learning scheme that learns how to classify articles. The features are generally words. It has often been observed that compression seems to provide a very promising alternative approach to categorization. The overall compression of an article with respect to different models can be compared to see which one it fits most closely. Such a scheme has several potential advantages: it yields an overall judgement on the document as a whole, rather than discarding information by pre-selecting features it avoids the messy and rather artificial problem of defining word boundaries; it deals uniformly with morphological variants of words; depending on the model (and its order), it can take account of phrasal effects that span word boundaries; it offers a uniform way of dealing with different types of documents for example, arbitrary files in a computer system; it generally minimizes arbitrary decisions that inevitably need to be taken to render any learning scheme practical.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"24 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":"114512005","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}
引用次数: 102
A novel codec for thin client computing 一种用于瘦客户机计算的新颖编解码器
Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838141
B. O. Christiansen, K. Schauser, M. Münke
{"title":"A novel codec for thin client computing","authors":"B. O. Christiansen, K. Schauser, M. Münke","doi":"10.1109/DCC.2000.838141","DOIUrl":"https://doi.org/10.1109/DCC.2000.838141","url":null,"abstract":"In this paper, we describe thin client compression (TCC), a novel codec for screendumps and sequences of such images that exploits both local and global redundancy as well as interframe redundancy. Our method extends textual image compression to non-bilevel images, and uses three piecewise-constant models to separately code bilevel marks, non-bilevel marks, and the residue. It also speeds up pattern matching and substitution by exploiting the absence of noise in synthetic images, and shares its codebook across images. Our method compresses a series of test images 2.6 to 8.2 times better than state-of-the-art methods. Its speed is adequate for interactive logins, and it achieves the best end-to-end latency over low bandwidth connections.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"74 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":"127188168","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
Symbol dictionary design for the JBIG2 standard JBIG2标准的符号字典设计
Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838143
Y. Ye, D. Schilling, P. Cosman, H. Ko
{"title":"Symbol dictionary design for the JBIG2 standard","authors":"Y. Ye, D. Schilling, P. Cosman, H. Ko","doi":"10.1109/DCC.2000.838143","DOIUrl":"https://doi.org/10.1109/DCC.2000.838143","url":null,"abstract":"The JBIG2 standard for lossy and lossless bi-level image coding is a very flexible encoding strategy based on pattern matching techniques. The encoder collects a set of symbols in a dictionary and encodes a page by reference to the dictionary symbols. JBIG2 allows the encoder to view all symbols and choose a good set for the dictionary. We propose a two-pass technique for choosing the dictionary entries, and discuss the trade-offs in bit allocation that these choices entail. The proposed dictionary design technique outperforms simpler dictionary formation techniques by up to 7-9% and 10-18% for lossless and lossy compression, respectively. In the lossy case, we further point out one way to significantly speed up the symbol bitmap compression procedure.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"5 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":"127826264","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}
引用次数: 15
Applications of YK algorithm to the Internet transmission of Web-data: implementation issues and modifications YK算法在网络数据传输中的应用:实现问题及修改
Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838193
A. Banerji, E. Yang
{"title":"Applications of YK algorithm to the Internet transmission of Web-data: implementation issues and modifications","authors":"A. Banerji, E. Yang","doi":"10.1109/DCC.2000.838193","DOIUrl":"https://doi.org/10.1109/DCC.2000.838193","url":null,"abstract":"Summary form only given. Recently, Yang and Kieffer (2000) proposed a novel lossless grammar-based data compression algorithm, called the YK algorithm, in which a greedy sequential grammar transform is applied to the original data to construct an irreducible context free grammar, which is encoded indirectly by using an arithmetic coder. The basic implementation of the YK encoding algorithm consists of a sequentially iterative application of three fundamental steps: parsing, arithmetic encoding, and updating. This paper proposes five modifications of the basic YK algorithm, motivated by applications of the algorithm to the Internet transmission of Web-data. 1) Fast YK encoder: The parsing operation is a major step of the YK algorithm. A variant of the tree data structure is proposed for fast parsing. This is applicable for real-time compression of IP datagrams. 2) Pre-defined source statistics: known source statistics can be exploited to improve compression efficiency, which is particularly effective for small IP datagrams with a known structure. 3) Pre-defined grammar: starting with a \"typical\" pre-defined grammar can significantly improve the compression efficiency for applications such as HTML Web-page compression. 4) Memory constrained implementation: during YK compression, as the length of the data sequence increases, the grammar also continues to grow in size, which can potentially exhaust the available memory in the system. This paper proposes a way to check memory requirement by reusing variables in the grammar, once a user-chosen limit on grammar size is reached. 5) Error handling capability: the paper identifies all possible contingencies that can arise when an erroneous bit-stream is fed to the YK decoder, and provides explicit ways to handle these. This is important in applications where compressed IP datagrams are transmitted over unreliable links.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"8 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":"116955037","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
Robust video coding for packet networks with feedback 基于反馈的分组网络鲁棒视频编码
Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838185
Rui Zhang, S. Regunathan, K. Rose
{"title":"Robust video coding for packet networks with feedback","authors":"Rui Zhang, S. Regunathan, K. Rose","doi":"10.1109/DCC.2000.838185","DOIUrl":"https://doi.org/10.1109/DCC.2000.838185","url":null,"abstract":"Robustness to packet loss is a critical requirement for video communication over packet switched networks. Intra-coding is an important tool to mitigate the effects of packet loss by limiting error propagation. This work proposes an algorithm for intra/inter coding mode selection, while utilizing the feedback channel that carries acknowledgement information about received packets. The overall distortion in frame reconstruction at the decoder due to quantization, error concealment (after packet loss) and error propagation is estimated at pixel-level precision, and is dynamically refined based on the feedback information. The estimate is then integrated into a rate-distortion (RD) framework for optimal selection of coding mode for each macroblock. Simulation results demonstrate that precise distortion estimation enables the coder to achieve substantial and consistent gain in PSNR over known state-of-the-art feedback-based mode selection modes.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"35 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":"116671297","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书