Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)最新文献_第6页

A joint source-channel coding scheme for robust image transmission 一种鲁棒图像传输的联合信源信道编码方案

Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672244

V. Chande, N. Farvardin

{"title":"A joint source-channel coding scheme for robust image transmission","authors":"V. Chande, N. Farvardin","doi":"10.1109/DCC.1998.672244","DOIUrl":"https://doi.org/10.1109/DCC.1998.672244","url":null,"abstract":"Summary form only given. We propose a joint source-channel coding scheme for the transmission of images over noisy channels. In this scheme, the interaction between source coding and channel coding is through a small number of parameters. A robust source coder based on the classification of the discrete wavelet transform (DWT) coefficients of the image is coupled with a flexible error control scheme which uses a bank of channel codes. Robustness in the source coder is achieved by scalar quantization of the coefficients followed by robust arithmetic coding to check catastrophic propagation of errors. Robust arithmetic coding generates a sequence of equal-length packets of bits along with a small number of sensitive bits for synchronization. A bank of rate compatible punctured convolutional codes concatenated with an outer error detection code like CRC is used for providing unequal error protection. Error detection is useful for error masking while decoding. The sensitive bits are protected and transmitted separately. An iterative algorithm is developed for selection of source coding rates and channel codes for the sequences of DWT coefficients. The algorithm uses the probabilities of packet decoding errors for the different channel codes and the operational rate distortion performance of the sequences of coefficients for the joint allocation. The system has a high reliability as the sensitive information is kept small. Some simulation results are provided for the transmission of the 512/spl times/512 image Lenna over binary symmetric channels.","PeriodicalId":191890,"journal":{"name":"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123280234","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

A lossless 2-D image compression technique for synthetic discrete-tone images 一种用于合成离散色调图像的二维无损图像压缩技术

Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672166

J. M. Gilbert, R. Brodersen

引用次数: 19

A fast symbol coding scheme with specific application in bulk compression 一种适用于批量压缩的快速符号编码方案

Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672309

A. Palau, G. Mirchandani

引用次数: 1

Phrase hierarchy inference and compression in bounded space 有界空间中的短语层次推理和压缩

Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672146

C. Nevill-Manning, I. Witten

{"title":"Phrase hierarchy inference and compression in bounded space","authors":"C. Nevill-Manning, I. Witten","doi":"10.1109/DCC.1998.672146","DOIUrl":"https://doi.org/10.1109/DCC.1998.672146","url":null,"abstract":"Text compression by inferring a phrase hierarchy from the input is a technique that shows promise as a compression scheme and as a machine learning method that extracts some comprehensible account of the structure of the input text. Its performance as a data compression scheme outstrips other dictionary schemes, and the structures that it learns from sequences have been put to such eclectic uses as phrase browsing in digital libraries, music analysis, and inferring rules for fractal images. We focus attention on the memory requirements of the method. Since the algorithm operates in linear time, the space it consumes is at most linear with input size. The space consumed does in fact grow linearly with the size of the inferred hierarchy, and this makes operation on very large files infeasible. We describe two elegant ways of curtailing the space complexity of hierarchy inference, one of which yields a bounded space algorithm. We begin with a review of the hierarchy inference procedure that is embodied in the SEQUITUR program. Then we consider its performance on quite large files, and show how the compression performance improves as the file size increases.","PeriodicalId":191890,"journal":{"name":"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114501915","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}

引用次数: 14

Optimal multiple description transform coding of Gaussian vectors 高斯向量的最优多重描述变换编码

Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672173

Vivek K Goyal, J. Kovacevic

引用次数: 122

A low-complexity modeling approach for embedded coding of wavelet coefficients 小波系数嵌入编码的低复杂度建模方法

Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672180

E. Ordentlich, M. Weinberger, G. Seroussi

引用次数: 118

On-line sprite encoding with large global motion estimation 具有大全局运动估计的在线精灵编码

Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672272

Feng Wu, Wen Gao, Xiang YangZhou, Gao Peng, Chen Datong

{"title":"On-line sprite encoding with large global motion estimation","authors":"Feng Wu, Wen Gao, Xiang YangZhou, Gao Peng, Chen Datong","doi":"10.1109/DCC.1998.672272","DOIUrl":"https://doi.org/10.1109/DCC.1998.672272","url":null,"abstract":"Summary form only given. A sprite which is an image composed of pixels belonging to a video object visible throughout a video segment is a very important concept proposed by MPEG4. Because of the search region limitation in the global motion estimation, the performance of traditional sprite coding technology is not satisfactory in the case of fast camera motion. Only enlarging the search region is difficult to ensure the right motion estimation. An improved algorithm is proposed with enlarging the search region, predicting the motion of the current VOP (video object plane) and shortening the iterative time. Three main techniques are adopted in the new algorithm. They are: (1) enlarging search region; (2) weighting sum of absolute difference (SAD); and (3) shortening iteration. Two group experiments present a comparison between the original algorithm and the improved algorithm. The first group experiment shows the improved algorithm gets the same performance as the original algorithm in coding the general motion sequences. In the second group experiment, the Stefan background sequences which frame rates of 15 Hz, 10 Hz, 7.5 Hz, and 6 Hz are encoded in various transformations. The results given in a table show the coding performances of the algorithm are significantly improved.","PeriodicalId":191890,"journal":{"name":"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122534620","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

A new compression scheme for syntactically structured messages (programs) and its application to Java and the Internet 一种新的语法结构化消息(程序)压缩方案及其在Java和Internet上的应用

Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672266

P. Eck, Changsong Xie, R. Matzner

{"title":"A new compression scheme for syntactically structured messages (programs) and its application to Java and the Internet","authors":"P. Eck, Changsong Xie, R. Matzner","doi":"10.1109/DCC.1998.672266","DOIUrl":"https://doi.org/10.1109/DCC.1998.672266","url":null,"abstract":"Summary form only given. The immense demand of required network bandwidth to load computer programs like Java applets or applications within an acceptable time makes efficient compression schemes highly desirable. Syntax-oriented coding (SOC) is a new compression scheme that is able to eliminate redundancy caused by syntactical restrictions. Current compression schemes with a lexical view of the source cannot efficiently exploit knowledge of these restrictions. The paper illustrates the current state in transmitting Java applets (compiled bytecode) over the net, as well as the integration of SOC into this framework. The smart and seamless integration of SOC in the existing Java architecture is obvious. In the compression performance of SOC, the paper depicts the file sizes of various representations of a typical Java applet: the size (containing no comments) of the (ASCII-) source code, the size of the class file (bytecode), the size of the compressed (Ziv-Lempel coding) class file and the size of the SOC-code. Using SOC a compression ratio of more than 6 is obtained compared to the Java class file, and even if the class file is Ziv-Lempel coded a ratio of more than 4 is still reached, reducing required bandwidth by 75 percent.","PeriodicalId":191890,"journal":{"name":"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)","volume":"75 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123360534","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}

引用次数: 17

Universal data compression and linear prediction 通用数据压缩和线性预测

Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672225

M. Feder, A. Singer

引用次数: 11

Joint source channel matching for a wireless communications link 无线通信链路的联合源信道匹配

Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672230

S. Appadwedula, Douglas L. Jones, K. Ramchandran, I. Kozintsev

引用次数: 41