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

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

Chia-Yuan Teng

{"title":"Compression of SMIL documents","authors":"Chia-Yuan Teng","doi":"10.1109/DCC.2000.838219","DOIUrl":"https://doi.org/10.1109/DCC.2000.838219","url":null,"abstract":"Summary form only given. The World Wide Web Consortium (W3C) standard synchronized multimedia integration language (SMIL) is an HTML-like mark-up language to describe temporal behavior and presentation layout for multimedia objects. SMIL is widely used in today's Internet. Many video clips send SMIL documents to clients before transmitting video and audio streams. Data compression is a process to reduce the number of bits in a representation of data. It can save storage space and reduce bandwidth requirement. Data compression technologies may be classified into two categories: lossless and lossy. The compression technology that can recover data perfectly from the compressed bits is called lossless compression. The one that cannot is called lossy compression. There are many lossless data compression algorithms, such as Ziv-Lempel methods, that have been developed in recent years. However, SMIL document compression performance with such methods is not very impressive because they do not exploit the special format of the SMIL document. As a result, the rate to compress a SMIL document is almost the same as that to compress English text, i.e., 2-4 bits/char. For better compression, a method based on a new parsing technology is proposed. The proposed compression algorithm contains two major procedures: parsing and coding. Parsing is a procedure to segment a SMIL document into non-overlapping phrases (a string of consecutive characters). Coding is a procedure to assign a codeword to the phrase. Both the phrase and codeword are of variable length.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"16 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":"116917223","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

Improving scene cut quality for real-time video decoding 提高实时视频解码的场景剪切质量

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

G. Motta, J. Storer, B. Carpentieri

{"title":"Improving scene cut quality for real-time video decoding","authors":"G. Motta, J. Storer, B. Carpentieri","doi":"10.1109/DCC.2000.838187","DOIUrl":"https://doi.org/10.1109/DCC.2000.838187","url":null,"abstract":"We address the problem of improving the scene cut quality in fixed bit-rate real-time video decoding such as is used in the H.263 and MPEG standards. In low bandwidth applications, scene cuts can cause the bits required to encode a single frame to greatly exceed the target average bits per frame, and necessitate the skipping of other frames to provide sufficient time to transmit the scene cut frame. We present an optimal algorithm for minimizing the number of skipped frames and keep the decoding synchronized. Although the algorithm requires additional encoding complexity, there is no change in decoding complexity (in fact, no change to the decoder at all). Experimental results, obtained with a simplified strategy within the framework of H.263+ video encoding, confirm that the method provides an effective alternative to current frame skipping strategies. The overall quality in the presence of scene cuts is improved with respect the TMN-8 rate control. Although the overall bit rate benefits from our method, our focus is to improve the quality of the video where scene cuts occur (by reducing skipped frames and improving decoder synchronization). The approach here can be combined with more sophisticated rate controls, as, for example, the newer rate-distortion optimized TMN-10 and TMN-11.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"9 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":"131010724","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

Implementing the context tree weighting method for text compression 实现文本压缩的上下文树加权方法

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

K. Sadakane, Takumi Okazaki, H. Imai

引用次数: 44

Image compression using lossless coding on VQ indexes 图像压缩使用无损编码对VQ索引

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

Y. Gong, M. Fan, Chien-Min Huang

引用次数: 3

An efficient low-bit rate motion compensation technique based on quadtree 一种有效的基于四叉树的低比特率运动补偿技术

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

H. Mahmoud, M. Bayoumi

引用次数: 3

A measure of information 信息的度量

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

M. Titchener

{"title":"A measure of information","authors":"M. Titchener","doi":"10.1109/DCC.2000.838175","DOIUrl":"https://doi.org/10.1109/DCC.2000.838175","url":null,"abstract":"Modern information theory is founded on the ideas of Hartley and Shannon, amongst others. From a practitioners standpoint. Shannon's probabilistic framework carries certain impediments for the practical measurement of information, such as requiring a priori knowledge of a source's characteristics. Moreover, such a statistical formulation of entropy is an asymptotic limit, meaningful only within the context of an ensemble of messages. It thus fails to address the notion of an individual string having information content in of itself. However Cherry (1953) demonstrated that Shannon's entropy could be viewed equivalently as a measure of the average number of selections required to identify each message symbol from the alphabet. Here the terminology contrasts with Shannon's probabilistic formulation. With the process of counting selection steps appearing to be meaningful for individual, isolated, finite strings. We explore this alternative approach in the context of a recursive hierarchical pattern copying (RHPC) algorithm. We use the measure of the complexity of finite strings, in terms of the number of steps required to recursively construct the string from its alphabet. From this we compute an effective rate of steps-per-symbol required for linearly constructing the string. By Cherry's interpretation of Shannon's entropy we infer this as giving asymptotic equivalence between the two approaches, but perhaps the real significance of this new way to measure information, is its applicability and usefulness in respect of evaluating individual finite strings.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"60 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":"124228064","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}

引用次数: 47

Universal finite memory machines for coding binary sequences 编码二进制序列的通用有限存储器

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

Doron Rajwan, M. Feder

引用次数: 15

Move-to-front and inversion coding 移动到前面和反转编码

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

Z. Arnavut

引用次数: 46

Distributed source coding: symmetric rates and applications to sensor networks 分布式源编码:对称速率和应用到传感器网络

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

S. Pradhan, K. Ramchandran

引用次数: 194

PPM*-style context sorting compression method using a prefix list PPM*风格的上下文排序压缩方法使用前缀列表

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

Suguru Itagaki, H. Yokoo

{"title":"PPM*-style context sorting compression method using a prefix list","authors":"Suguru Itagaki, H. Yokoo","doi":"10.1109/DCC.2000.838203","DOIUrl":"https://doi.org/10.1109/DCC.2000.838203","url":null,"abstract":"Summary form only given. We present a new implementation of the context sorting data compression method (Yokoo, 1997), which is an on-line adaptive algorithm for text compression. Our key idea is to utilize a new data structure called a prefix list (Yokoo, 1999). The original context sorting compression method, which uses neither explicit modeling nor arithmetic coding can be viewed as a symbol ranking text compressor. In the method presented here, in contrast, we form a context model with the frequency distribution to predict the current symbol. Our context model can exploit contexts of unlimited length, and it is combined with arithmetic coding. In these respects, the proposed method can also be viewed as giving an implementation of PPM* (Cleary and Teahan, 1997). Our space requirement is linear in the string length without depending on the context order. The prefix list is a dynamic data structure, which was proposed primarily to maintain a set of contexts in reverse lexicographic order. We can easily gather previous contexts according to the similarity to the current context. Predicted symbols can also be enumerated as the following symbols in those contexts. While enumerating those predicted symbols, we can completely simulate PPM*. If a set of contexts whose similarities to the current context are d or larger gives only one prediction, then their common d-symbol suffix is said to be a deterministic context. In our method, we begin the PPM mechanism with the shortest deterministic context if any, or with the contexts most similar to the current one otherwise. An escape symbol is emitted each time the similarity between the current, context and the existing context pointed to by a pointer in the prefix list decreases.","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":"130887930","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