Proceedings DCC '95 Data Compression Conference最新文献_第4页

Byte-aligned bitmap compression 字节对齐位图压缩

Proceedings DCC '95 Data Compression Conference Pub Date : 1995-03-28 DOI: 10.1109/DCC.1995.515586

G. Antoshenkov

{"title":"Byte-aligned bitmap compression","authors":"G. Antoshenkov","doi":"10.1109/DCC.1995.515586","DOIUrl":"https://doi.org/10.1109/DCC.1995.515586","url":null,"abstract":"Summary form only given. Bitmap compression reduces storage space and transmission time for unstructured bit sequences like in inverted files, spatial objects, etc. On the down side, the compressed bitmaps loose their functional properties. For example, checking a given bit position, set intersection, union, and difference can be performed only after full decoding, thus causing a many-folded operational speed degradation. The proposed byte-aligned bitmap compression method (BBC) aims to support fast set operations on the compressed bitmap formats and, at the same time, to retain a competitive compression rate. To achieve this objective, BBC abandons the traditional approach of encoding run-lengths (distances between two ones separated by zeros). Instead, BBC deals only with byte aligned byte-size bitmap portions that are easy to fetch, store, AND, OR, and convert. The bitmap bytes are classified as gaps containing only zeros or only ones and maps containing a mixture of both. We also introduced a simple extension mechanism for existing methods to accommodate a dual-gap (zeros and ones) run-length encoding. With this extension, encoding of long \"one\" sequences becomes as efficient and better than arithmetic encoding.","PeriodicalId":107017,"journal":{"name":"Proceedings DCC '95 Data Compression Conference","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117143086","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}

引用次数: 210

Optimal representation of motion fields for video compression 视频压缩运动场的最佳表示

Proceedings DCC '95 Data Compression Conference Pub Date : 1995-03-28 DOI: 10.1109/DCC.1995.515530

J. V. Gísladóttir, M. Orchard

引用次数: 0

Classified conditional entropy coding of LSP parameters LSP参数的分类条件熵编码

Proceedings DCC '95 Data Compression Conference Pub Date : 1995-03-28 DOI: 10.1109/DCC.1995.515545

Junchen Du, S.P. Kim

{"title":"Classified conditional entropy coding of LSP parameters","authors":"Junchen Du, S.P. Kim","doi":"10.1109/DCC.1995.515545","DOIUrl":"https://doi.org/10.1109/DCC.1995.515545","url":null,"abstract":"Summary form only given. A new LSP speech parameter compression scheme is proposed which uses conditional probability information through classification. For efficient compression of speech LSP parameter vectors it is essential that higher order correlations are exploited. The use of conditional probability information has been hindered by high complexity of the information. For example, a LSP vector has 34 bit representation at 4.8 K bps CELP coding (FS1016 standard). It is impractical to use the first order probability information directly since 2/sup 34//spl ap/1.7/spl times/10/sup 10/ number of probability tables would be required and training of such information would be practically impossible. In order to reduce the complexity, we reduce the input alphabet size by classifying the LSP vectors according to their phonetic relevance. In other words, speech LSP parameters are classified into groups representing loosely defined various phonemes. The number of phoneme groups used was 32 considering the ambiguity of similar phonemes and background noises. Then conditional probability tables are constructed for each class by training. In order to further reduce the complexity, split-VQ has been employed. The classification is achieved through vector quantization with a mean squared distortion measure in the LSP domain.","PeriodicalId":107017,"journal":{"name":"Proceedings DCC '95 Data Compression Conference","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114516216","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 error correcting codes based on cooperative play of the game of "twenty questions with a liar" 基于合作玩“说谎者二十问”游戏的自适应纠错码

Proceedings DCC '95 Data Compression Conference Pub Date : 1995-03-28 DOI: 10.1109/DCC.1995.515574

E. Lawler, S. Sarkissian

{"title":"Adaptive error correcting codes based on cooperative play of the game of \"twenty questions with a liar\"","authors":"E. Lawler, S. Sarkissian","doi":"10.1109/DCC.1995.515574","DOIUrl":"https://doi.org/10.1109/DCC.1995.515574","url":null,"abstract":"Summary form only given. The existence of a noiseless, delayless feedback channel permits the transmitter to detect transmission errors at the time they occur. Such a feedback channel does not increase channel capacity, but it does permit the use of adaptive codes with significantly enhanced error correction capabilities. It is well known that codes of this type can be based on cooperative play of the game of \"twenty questions with a liar\". However, it is perhaps not so well appreciated that it is practicable to implement codes of this type on general purpose computers. We describe a simple and fast implementation in which the transmitter makes reference to a fully worked out game tree. In the worst case, storage requirements grow exponentially with block length. For many cases of interest, storage requirements are not excessive. For example, a 4-error correcting code with 8 information bits and 13 check bits requires only 103.2 kilobytes of storage. By contrast, an 8-error correcting code with 6 information bits and 25 check bits requires 21.2 megabytes of storage. However, no nonadaptive code is capable of correcting as many as 8 errors when 6 information bits are encoded in a block of length 31.","PeriodicalId":107017,"journal":{"name":"Proceedings DCC '95 Data Compression Conference","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115722315","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

Coding with partially hidden Markov models 部分隐马尔可夫模型编码

Proceedings DCC '95 Data Compression Conference Pub Date : 1995-03-28 DOI: 10.1109/DCC.1995.515499

Søren Forchhammer, J. Rissanen

引用次数: 8

An efficient variable length coding scheme for an IID source 一个有效的可变长度编码方案的IID源

Proceedings DCC '95 Data Compression Conference Pub Date : 1995-03-28 DOI: 10.1109/DCC.1995.515508

K. Cheung, A. Kiely

{"title":"An efficient variable length coding scheme for an IID source","authors":"K. Cheung, A. Kiely","doi":"10.1109/DCC.1995.515508","DOIUrl":"https://doi.org/10.1109/DCC.1995.515508","url":null,"abstract":"In this article we examine a scheme that uses two alternating Huffman codes to encode a discrete independent and identically distributed source with a dominant symbol. One Huffman code encodes the length of runs of the dominant symbol, the other encodes the remaining symbols. We call this combined strategy alternating runlength Huffman (ARH) coding. This is a popular scheme, used for example in the efficient pyramid image coder (EPIC) subband coding algorithm. Since the runlengths of the dominant symbol are geometrically distributed, they can be encoded using the Huffman codes identified by Golomb (1966) and later generalized by Gallager and Van Voorhis (1975). This runlength encoding allows the most likely symbol to be encoded using less than one bit per sample, providing a simple method for overcoming a drawback of prefix codes-that the redundancy approaches one as the largest symbol probability P approaches one. For ARH coding, the redundancy approaches zero as P approaches one. Comparing the average code rate of ARH with direct Huffman coding we find that: 1. If P<1/3, ARH is less efficient than Huffman coding. 2. If 1/3/spl les/P<2/5, ARH is less than or equally efficient as Huffman coding, depending on the source distribution. 3. If 2/5/spl les/P/spl les/0.618, ARH and Huffman coding are equally efficient. 4. If P>0.618, ARH is more efficient than Huffman coding. We give examples of applying ARH coding to some specific sources.","PeriodicalId":107017,"journal":{"name":"Proceedings DCC '95 Data Compression Conference","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114840373","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}

引用次数: 5

Efficient error free chain coding of binary documents 有效的无错误链编码二进制文件

Proceedings DCC '95 Data Compression Conference Pub Date : 1995-03-28 DOI: 10.1109/DCC.1995.515502

Robert R V Estes, Ralph Algazi

引用次数: 29

A parallel vector quantization algorithm for SIMD multiprocessor systems SIMD多处理器系统的并行矢量量化算法

Proceedings DCC '95 Data Compression Conference Pub Date : 1995-03-28 DOI: 10.1109/DCC.1995.515589

H.J. Lee, J.C. Liu, A. Chan, C. Chui

引用次数: 8

Compression of data traffic in packet-based LANs 在基于分组的局域网中压缩数据流量

Proceedings DCC '95 Data Compression Conference Pub Date : 1995-03-28 DOI: 10.1109/DCC.1995.515540

K. Pawlikowski, T. Bell, H. Emberson, P. Ashton

{"title":"Compression of data traffic in packet-based LANs","authors":"K. Pawlikowski, T. Bell, H. Emberson, P. Ashton","doi":"10.1109/DCC.1995.515540","DOIUrl":"https://doi.org/10.1109/DCC.1995.515540","url":null,"abstract":"Abstract only given; substantially as follows. Data compression is very commonly used to improve the performance of telecommunications systems. In local-area networks compression technology can help reduce transmission bottlenecks if the network transmits data slower than the computers can generate it. Network designers need to have accurate models of the network traffic in order to plan network capacity. When designing networks, one must take into account not only the amount of traffic, but also the nature of the traffic. The authors are particularly concerned with communication systems that are packet-based, and with how compression changes the statistical properties of packet sizes. They also discuss how adaptive compression can be used with connectionless protocols, which pose serious synchronization difficulties. They have collected large quantities of data from a live network, and have simulated the effect of compressing the data using several different techniques. Relevant statistics of the simulated system have been calculated, allowing to characterize data compression as a stochastic transformation of teletraffic. Compression can improve throughput in packet-based networks by decreasing the size and number of packets. When applied to individual packets, not only is the mean packet size reduced, but the variance also decreases. Compression has the potential to give significant performance improvements.","PeriodicalId":107017,"journal":{"name":"Proceedings DCC '95 Data Compression Conference","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123559139","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

Quadtree based JBIG compression 基于四叉树的JBIG压缩

Proceedings DCC '95 Data Compression Conference Pub Date : 1995-03-28 DOI: 10.1109/DCC.1995.515500

B. Fowler, R. Arps, A. Gamal, D. Yang

引用次数: 4