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

Multi-resolution adaptation of the SPIHT algorithm for multiple description 多分辨率自适应SPIHT算法的多重描述

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

N. Varnica, M. Fleming, M. Effros

{"title":"Multi-resolution adaptation of the SPIHT algorithm for multiple description","authors":"N. Varnica, M. Fleming, M. Effros","doi":"10.1109/DCC.2000.838170","DOIUrl":"https://doi.org/10.1109/DCC.2000.838170","url":null,"abstract":"Multiple description codes are data compression algorithms designed with the goal of minimizing the distortion caused by data loss in packet-based or diversity communications systems. Recently, techniques that achieve multiple description coding by combining embedded source codes with unequal error protection channel codes have become popular in the literature. These codes allow for data reconstruction with any subset of the transmitted packets and achieve progressively better source reconstructions as more and more packets are decoded. The given methods may be applied to any embedded source description. While applicability to all embedded source codes provides great flexibility, this separation approach begs the question of whether better performance could be achieved by taking advantage of the internal structure of a particular embedded code. In this paper, we investigate an extremely simple method for using an embedded source code's internal state information in the construction of a multiple description code. In particular, we protect an embedded SPIHT bitstream by adding to that bitstream periodic descriptions of state information from the encoder, and we demonstrate how the state information can be used to recover lost bits. For low probabilities of network packet loss, the proposed algorithm achieves performance within 0.35 dB of the performance of a more sophisticated channel coding algorithm when both algorithms are applied to same SPIHT embedded source code.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"21 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":"114415782","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}

引用次数: 10

Separate source and channel rate selection for video over ATM 独立的源和通道速率选择视频在ATM上

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

Yan Yang, S. Hemami

{"title":"Separate source and channel rate selection for video over ATM","authors":"Yan Yang, S. Hemami","doi":"10.1109/DCC.2000.838228","DOIUrl":"https://doi.org/10.1109/DCC.2000.838228","url":null,"abstract":"Summary form only given. Rate control is essential to ensure high quality video transmission over asynchronous transfer mode networks: source and channel rates cannot violate buffer or network traffic constraints. To date, source and channel rate selection have been performed jointly because the rates appear to be interdependent. However these rates can be separated, allowing sequential source and channel rate selection without the need for iteration. This work considers source and channel rate selection for variable-bit-rate (VBR) video coding subject to both buffer and channel constraints (known as C-VBR) for real-time transmission over an ATM network with a leaky bucket (LB) traffic policing mechanism. Source rates are selected to minimize distortion variation (MDV) to achieve consistent video quality while channel rates are selected to submit smooth traffic to the network. It has been previously shown that VBR rate control can be simplified to constant-bit-rate (CBR) rate control using the concept of the virtual buffer (i.e., the encoder buffer combined with the LB). This work shows that a similar simplification can be made for MDV rate control by additionally allowing virtual buffer underflow.","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":"114873367","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

Semantic progressive transmission for deep space communications 深空通信的语义递进传输

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

R. Manduchi, S. Dolinar, F. Pollara, A. Matache

{"title":"Semantic progressive transmission for deep space communications","authors":"R. Manduchi, S. Dolinar, F. Pollara, A. Matache","doi":"10.1109/DCC.2000.838208","DOIUrl":"https://doi.org/10.1109/DCC.2000.838208","url":null,"abstract":"Summary form only given. We present an integrated system for the intelligent progressive transmission of data for deep space communications. This work is motivated by the realization that much more information can be collected by imaging and remote sensing equipment than can be transmitted through downlink channels. The goal of this work was to extend the idea of progressive transmission by incorporating semantic value to the \"importance\" attributes of encoded data. In particular, we define a simple measure of science return based on information theoretic considerations as well as on the estimated scientific value of the transmitted data. The task of determining the relative scientific importance of segments of data is carried out by an onboard science processing module, designed according to guidelines provided by the remote user (the science community). This module pre-processes the image and provides input to the progressive encoder in the form of a suitable \"classification map\". By combining the semantic characterization produced by the science processing module with the content-blind data organization criteria of the traditional progressive encoder, we obtain a new measure of the importance of each segment of data. Algorithms that best utilize the available resources can thus be designed and their performances in terms of science return assessed.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"225 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":"131444702","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

Low-complexity scalable image compression 低复杂度可扩展图像压缩

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

R. V. D. Vleuten, R. Kleihorst

引用次数: 10

Trees, windows and tiles for wavelet image compression 树，窗口和瓦片的小波图像压缩

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

Wee Sun Lee

{"title":"Trees, windows and tiles for wavelet image compression","authors":"Wee Sun Lee","doi":"10.1109/DCC.2000.838168","DOIUrl":"https://doi.org/10.1109/DCC.2000.838168","url":null,"abstract":"We investigate the task of compressing an image by using different probability models for compressing different regions of the image. In an earlier paper, we introduced a class of probability models for images, the k-rectangular tiling of an image, which is formed by partitioning the image into k rectangular regions and generating the coefficients within each region by using a probability model selected from a finite class C of probability models. We also describe a computationally efficient sequential probability assignment algorithm that is able to code an image with a code length that is close to the code length produced by the best model in the class. In this paper, we investigate the performance of the algorithm experimentally on the task of compressing wavelet subbands. We compare the method with compression methods that aim to compress as well as the best pruning of a quadtree and compression methods that exploit the local statistics in a window around the coefficient being compressed. For a class C consisting of a small number of Laplacian distributions and the uniform distribution, we find that the best tiling method works best, but the difference in performance is significant for only a few of the images tested.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"302 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":"128624621","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

Switching between two on-line list update algorithms for higher compression of Burrows-Wheeler transformed data 在两种在线列表更新算法之间切换，以提高Burrows-Wheeler转换数据的压缩

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

B. Chapin

引用次数: 33

QccPack: an open-source software library for quantization, compression, and coding QccPack:一个用于量化、压缩和编码的开源软件库

Proceedings DCC 2000. Data Compression Conference Pub Date : 2000-03-28 DOI: 10.1117/12.411554

J. Fowler

引用次数: 134

Wavelet-based lossy compression of turbulence data 基于小波的湍流数据有损压缩

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

John P. Wilson

引用次数: 5

FEC and pseudo-ARQ for receiver-driven layered multicast of audio and video 接收端驱动的音频和视频分层多播FEC和伪arq

Proceedings DCC 2000. Data Compression Conference Pub Date : 1999-05-01 DOI: 10.1109/DCC.2000.838184

P. Chou, A. Mohr, Albert Wang, S. Mehrotra

{"title":"FEC and pseudo-ARQ for receiver-driven layered multicast of audio and video","authors":"P. Chou, A. Mohr, Albert Wang, S. Mehrotra","doi":"10.1109/DCC.2000.838184","DOIUrl":"https://doi.org/10.1109/DCC.2000.838184","url":null,"abstract":"We consider the problem of joint source/channel coding of real-time sources, such as audio and video, for the purpose of multicasting over the Internet. The sender injects into the network multiple source layers and multiple channel (parity) layers, some of which are delayed relative to the source. Each receiver subscribes to the number of source layers and the number of channel layers that optimizes the source-channel rate allocation for that receiver's available bandwidth and packet loss probability. We augment this layered FEC system with layered ARQ. Although feedback is normally problematic in broadcast situations, ARQ is simulated by having the receivers subscribe and unsubscribe to the delayed channel coding layers to receive missing information. This pseudo-ARQ scheme avoids an implosion of repeat requests at the sender, and is scalable to an unlimited number of receivers. We show gains of up to 18 dB on channels with 20% loss over systems without error control, and additional gains of up to 13 dB when FEC is augmented by pseudo-ARQ in a hybrid system. The hybrid system is controlled by an optimal policy for a Markov decision process.","PeriodicalId":218804,"journal":{"name":"Proceedings DCC 2000. Data Compression Conference","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126925348","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}

引用次数: 70