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

Proceedings DCC 2000. Data Compression Conference最新文献

筛选
英文 中文
Joint source/channel coding using arithmetic codes 联合源/信道编码使用算术编码
Proceedings DCC 2000. Data Compression Conference Pub Date : 2010-01-14 DOI: 10.1109/DCC.2000.838147
Billy D. Pettijohn, Khalid Sayood, Michael W. Hoffman
{"title":"Joint source/channel coding using arithmetic codes","authors":"Billy D. Pettijohn, Khalid Sayood, Michael W. Hoffman","doi":"10.1109/DCC.2000.838147","DOIUrl":"https://doi.org/10.1109/DCC.2000.838147","url":null,"abstract":"Reserving space for a symbol that is not in the source alphabet has been shown to provide excellent error detection. In this paper we show how to use this capability using a sequential decoder structure to provide powerful error correction capability. This joint source/channel coder design provides significant packet loss recovery with minimal overhead.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129240342","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
High performance Lempel-Ziv compression using optimized longest string parsing and adaptive Huffman window size 高性能Lempel-Ziv压缩使用优化的最长字符串解析和自适应霍夫曼窗口大小
Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838215
N. Rishe, A. Shaposhnikov, Alexander Vaschillo, Dmitry Vasilevsky, Shu‐Ching Chen
{"title":"High performance Lempel-Ziv compression using optimized longest string parsing and adaptive Huffman window size","authors":"N. Rishe, A. Shaposhnikov, Alexander Vaschillo, Dmitry Vasilevsky, Shu‐Ching Chen","doi":"10.1109/DCC.2000.838215","DOIUrl":"https://doi.org/10.1109/DCC.2000.838215","url":null,"abstract":"Summary form only given. We present optimizations that improve the compression and computational efficiency of Lempel-Ziv (LZ77) and Huffman algorithms. The compression performance of the LZ77 algorithm can be improved by using an optimized longest match parsing strategy. Another factor that can be considered is the size of the reference to the matching string, which can vary due to the secondary Huffman compression. We present an efficient parsing algorithm that considers both factors while minimizing the computational requirements. Our second optimization technique optimizes static Huffman encoding by efficiently dividing the input into blocks of varying size with uneven character frequency distributions.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"67 6 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":"125960652","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
Variable-to-fixed length codes: a geometrical approach to low-complexity source codes 可变到固定长度代码:一种低复杂度源代码的几何方法
Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838220
T. Tjalkens, F. Willems
{"title":"Variable-to-fixed length codes: a geometrical approach to low-complexity source codes","authors":"T. Tjalkens, F. Willems","doi":"10.1109/DCC.2000.838220","DOIUrl":"https://doi.org/10.1109/DCC.2000.838220","url":null,"abstract":"Summary form only given. We consider the coding of a binary IID source using variable-to-fixed length (VF) source codes. The goal is to design \"good\" codes of low complexity. A VF code maps variable length source sequences (segments) into fixed length code sequences (codewords). We conclude that Petry codes are an efficient implementation of Tunstall codes and moreover that by approximating the enumeration an even better trade-off between redundancy and complexity is achieved.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"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":"122128453","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
The skip-innovation model for sparse images 稀疏图像的跳跃创新模型
Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838144
P.J. Usbeck
{"title":"The skip-innovation model for sparse images","authors":"P.J. Usbeck","doi":"10.1109/DCC.2000.838144","DOIUrl":"https://doi.org/10.1109/DCC.2000.838144","url":null,"abstract":"On sparse images, contiguous runs of identical symbols often occur in the same coding context. This paper proposes a model for efficiently encoding such runs in a two-dimensional setting. Because it is model based, the method can be used with any coding scheme. An experimental coder using the model compresses CCITT facsimile documents 2% better than JBIG and is more than three times as fast. A low complexity application of the model is shown to dramatically improve the compression performance of JPEG-LS on structured material.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"42 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":"117309620","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
Adaptive post-processing for region-based fractal image compression 基于区域的分形图像压缩自适应后处理
Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838196
Yung-Ching Chang, Bin-Kai Shyu, Chuan-Yu Cho, Jia-Shung Wang
{"title":"Adaptive post-processing for region-based fractal image compression","authors":"Yung-Ching Chang, Bin-Kai Shyu, Chuan-Yu Cho, Jia-Shung Wang","doi":"10.1109/DCC.2000.838196","DOIUrl":"https://doi.org/10.1109/DCC.2000.838196","url":null,"abstract":"Summary form only given. Region-based fractal image compression (Chang et al., 1997) is an attractive variation of fractal image compression algorithm. By segmenting an image into variable sizes of quadtree blocks and then merging these blocks into regions, this algorithm has the potential to encode a still image with a very low bit rate. However, highly visible artifacts become annoying when the coding bit rate is low. A large number of studies have been done in the literature to improve the reconstructed image quality at low bit rates. In this paper, an adaptive image enhancement algorithm for region-based fractal image compression is proposed. By utilizing an algorithm to determine which pixels have to be smoothed, then applying different smoothing filters for various image areas, the proposed algorithm can significantly eliminate the annoying blocking artifacts for images coded with low bit rate.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"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":"128403241","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}
引用次数: 8
A new compression method for compressed matching 一种新的压缩匹配方法
Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838180
S. T. Klein, Dana Shapira
{"title":"A new compression method for compressed matching","authors":"S. T. Klein, Dana Shapira","doi":"10.1109/DCC.2000.838180","DOIUrl":"https://doi.org/10.1109/DCC.2000.838180","url":null,"abstract":"A practical adaptive compression algorithm based on LZSS is presented, which is especially constructed to solve the compressed pattern matching problem, i.e., pattern matching directly in a compressed text without decompressing.","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":"121792150","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}
引用次数: 34
Universal lattice-based quantizers for multiple descriptions 多描述的通用格量化器
Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838190
Y. Frank-Dayan, R. Zamir
{"title":"Universal lattice-based quantizers for multiple descriptions","authors":"Y. Frank-Dayan, R. Zamir","doi":"10.1109/DCC.2000.838190","DOIUrl":"https://doi.org/10.1109/DCC.2000.838190","url":null,"abstract":"Multiple description source coding is aimed at achieving graceful degradation in reconstruction with respect to losing portions of the code, with the cost of some redundancy. In this research we examine source coding schemes for two descriptions and three decoders based on entropy coded dithered (\"universal\") quantizers (ECDQ). We propose two techniques. The first is a two stage encoder, where the first stage produces two coarse descriptions, and the second stage produces a refinement code to be used only by the joint decoder. The second technique is a dithered and periodic version of a scalar quantizer with distributed cells for multiple descriptions proposed by Vaishampayan (1994). Both techniques are shown to be equivalent to additive noise channels. Analytical expressions for their performance are derived and compared to the optimal rate regions at both high and low resolutions. The first technique is conceptually simple and easily tuned to various parameters, but is inherently sub-optimal. The second technique is less versatile but shows promising results that resemble those of the ECDQ for single description encoding.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"122 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":"115649819","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
On the performance of BWT sorting algorithms BWT排序算法的性能研究
Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838157
J. Seward
{"title":"On the performance of BWT sorting algorithms","authors":"J. Seward","doi":"10.1109/DCC.2000.838157","DOIUrl":"https://doi.org/10.1109/DCC.2000.838157","url":null,"abstract":"In recent years lossless text compression based on the Burrows-Wheeler transform (BWT) has grown popular. The expensive activity during compression is sorting of all the rotations of the block of data to compress. Burrows and Wheeler (1994) describe an efficient implementation of rotation sorting but give little analysis of its performance. This paper addresses that need. We present the base algorithm using a more formal framework, describe two important optimisations not present in the original paper, and measure performance of the variants on a set of 14 files. For completeness, a tuned implementation of Sadakane's (1998) sorting algorithm was also tested. Merely measuring running times gives poor insight into the finer aspects of performance on contemporary machine architectures. We report measurements of instruction counts and cache misses for the algorithms giving a clearer picture of which variants perform well, and why.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"148 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":"114368505","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}
引用次数: 99
Protection of regions of interest against data loss in a generalized multiple description framework 在广义多重描述框架中保护感兴趣区域免受数据丢失
Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838209
A. Miguel, E. Riskin
{"title":"Protection of regions of interest against data loss in a generalized multiple description framework","authors":"A. Miguel, E. Riskin","doi":"10.1109/DCC.2000.838209","DOIUrl":"https://doi.org/10.1109/DCC.2000.838209","url":null,"abstract":"Summary form only given. We present a simple and efficient scheme for protecting a region of interest (ROI) in an image sent across generalized multiple description networks. To increase the probability that the ROI is received with high quality, we extend the unequal loss protection framework of MD-SPIHT by adding more redundancy to the ROI than to other parts of the image. The SPIHT algorithm orders data progressively and sends the globally important information first. By adding more redundancy to the earlier parts of the bit stream than to the later parts, MD-SPIHT protects data that are globally important to the image quality more than less important data. In this work, wavelet coefficients corresponding to the ROI are scaled by a large factor so that locally important information is sent in the earlier parts of the bit stream. As a result, the ROI is coded to a higher bit rate than the rest of the image and MD-SPIHT automatically assigns more redundancy to the localized ROI than to the background. Therefore, the ROI is heavily protected at the expense of lower protection in the background. The ROI has a higher probability of being received intact and its quality will be higher than the quality of the background. We show two cases in which 3 out of 8 descriptions are received for 35% redundancy assignment. Without ROI scaling, redundancy is spread to all parts of the image and the quality of the ROI is low. When the ROI is scaled, redundancy is concentrated in the ROI and the quality of the received ROI is higher.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"11 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":"114437158","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
Lattice quantization with side information 带边信息的点阵量化
Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1109/DCC.2000.838191
S. Servetto
{"title":"Lattice quantization with side information","authors":"S. Servetto","doi":"10.1109/DCC.2000.838191","DOIUrl":"https://doi.org/10.1109/DCC.2000.838191","url":null,"abstract":"We consider the design of lattice vector quantizers for the problem of coding Gaussian sources with uncoded side information available only at the decoder. The design of such quantizers can be reduced to the problem of finding an appropriate sublattice of a given lattice codebook. We study the performance of the resulting quantizers in the limit as the encoding rate becomes high, and we evaluate these asymptotics for three lattices of interest: the hexagonal lattice A/sub 2/, the Gosset lattice E/sub 8/, and the Leech lattice /spl Lambda//sub 24/. We also verify these asymptotics numerically, via computer simulations based on the lattice A/sub 2/. Surprisingly, the lattice E/sub 8/ achieves the best performance of all cases considered.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"17 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":"123920055","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}
引用次数: 75
下一页 尾页
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学术官方微信
小红书