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

Hard-decision in COVQ over waveform channels 波形信道上COVQ的难判定

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

J. L. Pérez-Córdoba, A. Rubio, J. López-Soler, M. C. Benítez

引用次数: 1

Wavelet coding of 3-D shape data using space-frequency quantization 三维形状数据的空频量化小波编码

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

Daisuke Murata, T. Otake, A. Kawanaka

{"title":"Wavelet coding of 3-D shape data using space-frequency quantization","authors":"Daisuke Murata, T. Otake, A. Kawanaka","doi":"10.1109/DCC.2000.838198","DOIUrl":"https://doi.org/10.1109/DCC.2000.838198","url":null,"abstract":"Summary form only given. Efficient representations of three dimensional object shape have attracted wide attention for transmission of computer graphics data and for interactive design in manufacturing. Polygonal meshes which consist of connectivity data of the vertices and their geometry data are often used for representing an object shape. The connectivity of the vertices is efficiently coded with generalized triangle stripes and several generalized meshes. However the geometry data with a larger value than the connectivity data is compressed by changing the step size of scalar quantization and applying one-dimensional prediction coding. We propose a data compression method applying the wavelet transform and hierarchical quantization for geometry data structured by a quadrilateral mesh. The geometry data is transformed to multi-scale wavelet coefficients of the same number as original data by applying a shape-adaptive wavelet transform along two axes of the quadrilateral mesh. The wavelet coefficients are entropy coded by optimal combined zerotree quantization, which takes into account dependency of the coefficients at similar position in each scale, with scalar quantization of the remaining coefficients. The performance of the proposed method is evaluated using two metrics based on shape distortion and normal vector distortion of reconstructed geometry data. The experimental results using range data of a statue surface measured at the same intervals along circular and altitude directions in circular cylindrical coordinates show that the new method has good performance compared to conventional methods.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"12 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":"115402821","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

Using compression to identify acronyms in text 使用压缩来识别文本中的缩写词

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

Stuart A. Yeates, D. Bainbridge, I. Witten

引用次数: 63

Optimal packetization of embedded bitstreams 嵌入式比特流的最佳分组

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

Xiaolin Wu, Zixiang Xiong

引用次数: 0

On zonal morphological approach to natural language texts processing 区域形态学在自然语言文本处理中的应用

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

D. V. Shlepakov, L. N. Shlepakov

{"title":"On zonal morphological approach to natural language texts processing","authors":"D. V. Shlepakov, L. N. Shlepakov","doi":"10.1109/DCC.2000.838218","DOIUrl":"https://doi.org/10.1109/DCC.2000.838218","url":null,"abstract":"Summary form only given. We discuss some actual problems of natural language processing. We consider the flexile language case. We propose a zonal morphologically based model instead of the traditional word based one. If we deal with flexile language there should be an interim layer of language units. We assume that the morphs layer should be considered. It seems to be natural and non-restrictive. By their word order we divide them into four categories or zones: prefixes (P), roots (R), suffices (S), and endings (E). We introduce a new term, namely semantic coverage. Semantic coverage is an analogue of the compact set over all possible words domain. We survey some aspects of the architecture of the morphological processing system. We consider modified Huffman coding that is used in facsimile hardware. We know that a facsimile machine processes only black and white pixel series. Furthermore, they alternate constantly. We may map black and white pixel series to morphological zones. Huffman coding prefixes can be redefined to fit the four zone structure. Another way to fit the facsimile paradigm is the two step appliance of Huffman coding, i.e., we join zones by pairs then apply the coding inside joint pairs, and finally, we use the coding for outside pairs. We note that branching of the multi-level system should be reasonable. All modifications of the basic architecture should influence the root part only. The variable part of the root zone is regulated by a threshold for overflow control. Other parts should be considered as unchangeable because of their constancy as morphological units of the language. The perspectives and problems of flexile language text processing are discussed too.","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":"114447260","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

RD-optimization of hierarchical structured adaptive vector quantization for video coding 视频编码中分层结构自适应矢量量化的rd优化

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

M. Wagner, D. Saupe

{"title":"RD-optimization of hierarchical structured adaptive vector quantization for video coding","authors":"M. Wagner, D. Saupe","doi":"10.1109/DCC.2000.838223","DOIUrl":"https://doi.org/10.1109/DCC.2000.838223","url":null,"abstract":"Summary form only given. This poster contains two contributions to very-low-bitrate video coding. First, we show that in contrast to common practice incremental techniques for rate-distortion optimization such as the generalized BFOS algorithm may clearly outperform the standard technique based on Lagrangian multipliers. This is relevant in cases where the computation of RD points has a low complexity. An implementation independent performance measure is used for comparison and run-time experiments are provided. Second, we report on recent progress of our ongoing research evaluating the prospects of adaptive vector quantization (AVQ) for very-low-bitrate video coding. In contrast to conventional state-of-the-art video coding based on entropy coding of motion compensated residual frames in the frequency domain, adaptive vector quantization offers the potential to adapt its codebooks to the changing statistics of image sequences. The basic building blocks of our current AVQ video codec are: (1) block-based coding in the wavelet domain where wavelet coefficients correspond to (overlapping) spatial regions; (2) hierarchical organization of the wavelet coefficients using quadtree structures; (3) three way coding mode decision for each block (block replenishment, product code vector quantization, new VQ block with codebook update); and (4) rigorous rate/distortion optimization for all coding choices (image partition and block coding mode). This video codec does not apply motion compensation, however. A comparison with standard transform coding (H.263) shows that in spite of the improvements of our coder over previously published AVQ video coders it still shows a performance gap of about 1 dB for some test sequences.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"47 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":"126640535","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}

引用次数: 6

Prediction by grammatical match 语法匹配预测

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

J. M. Lake

{"title":"Prediction by grammatical match","authors":"J. M. Lake","doi":"10.1109/DCC.2000.838155","DOIUrl":"https://doi.org/10.1109/DCC.2000.838155","url":null,"abstract":"We present prediction by grammatical match (PGM), a new general purpose adaptive text compression framework successfully blending finite-context and general context-free models. A PGM compressor operates incrementally by parsing a prefix of the input text, generating a set of analyses; these analyses are scored according to encoding cost, the cheapest is selected, and sent through an order k PPM encoder. PGM's primary innovations include the use of a generalized PPM in selection and coding; the simultaneous use of multiple context-free grammars; the use of lexical left-corner derivations (LLCD); and an aggressive algorithm for constructing an LR(O) parsable metalanguage for LLCD. LLCD are a hybrid of bottom-up and top-down descriptions that represent grammatical information implicitly with each lexeme. The constructed metalanguage extends this to include explicit top-down steps to resolve local ambiguities in at most one strictly grammatical symbol. These properties combine to deliver excellent compression. On a test corpus of about 1 MB of Scheme program text, PGM with a generic Scheme grammar required about 26% fewer bits than PPM to represent the entire corpus, with reductions on individual files reaching as high as 55%. In addition, PGM enriches the time-compression-memory tradeoff options, since a low order PGM can achieve bpc rates comparable to high order PPM at considerable savings in space. PGM compression operates in expected linear time and space for many kinds of grammars. PGM decompression operates in guaranteed linear time and space.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"141 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":"124881559","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}

引用次数: 7

Statistical models for term compression 术语压缩的统计模型

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

J. Cheney

{"title":"Statistical models for term compression","authors":"J. Cheney","doi":"10.1109/DCC.2000.838197","DOIUrl":"https://doi.org/10.1109/DCC.2000.838197","url":null,"abstract":"Summary form only given. Computing systems frequently deal with symbolic tree data structures, which are also known as terms in universal algebra and logic. Our goal is to develop universal, effective and efficient term compression techniques superior to specialized or universal compression techniques currently available. Our approach is to use knowledge of term structure to build accurate universal statistical models of terms. These models can compress terms faster or more effectively than comparable sequential methods. We present two statistical term models that are related to Markov random fields over trees. These models gather statistical information about parent-child symbol relationships in terms. Huffman or arithmetic codes generated from these probability estimates are used to encode the terms. In the first model, a symbol's value is predicted by the value of its parent symbol alone. Thus, in compressing a subterm of the form t+u, the +operator would be used to select a specialized code for the root symbols of subterms t and u. The second model also uses the symbol's argument position as a predictor. For example, in compressing t+u, we would make different probability estimates for the first and second arguments, and use one code to encode the first children of + and another code for the second children. It might be the case that t+1 (but not 1+t) occurs frequently for many different terms t, in which case we could give 1 a shorter code as the second child of +. We have not achieved our goal of improved term compression, but we believe that more sophisticated and more effective techniques remain to be investigated. For example one improvement would be to make a term version of PPM in which contexts are ancestor symbols in the term rather than predecessors in a sequence. Our implementation could be viewed as a first step in that direction.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"26 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":"124477804","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

SPIHT-NC: network-conscious zerotree encoding SPIHT-NC:网络感知零树编码

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

S. Iren, P. Amer

引用次数: 2

PPM performance with BWT complexity: a new method for lossless data compression 具有BWT复杂度的PPM性能:一种无损数据压缩的新方法

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

M. Effros

引用次数: 33