Proceedings DCC 2002. Data Compression Conference最新文献_第8页

Iterated denoising for image recovery 图像恢复的迭代去噪

Proceedings DCC 2002. Data Compression Conference Pub Date : 2002-04-02 DOI: 10.1109/DCC.2002.999938

O. Guleryuz

引用次数: 29

PPM: one step to practicality PPM:向实用性迈出一步

Proceedings DCC 2002. Data Compression Conference Pub Date : 2002-04-02 DOI: 10.1109/DCC.2002.999958

D. A. Shkarin

引用次数: 182

Computational complexity management of motion estimation in video encoders 视频编码器中运动估计的计算复杂度管理

Proceedings DCC 2002. Data Compression Conference Pub Date : 2002-04-02 DOI: 10.1109/DCC.2002.1000026

Yafan Zhao, I. Richardson

引用次数: 13

Less redundant codes for variable size dictionaries 可变大小字典的冗余代码较少

Proceedings DCC 2002. Data Compression Conference Pub Date : 2002-04-02 DOI: 10.1109/DCC.2002.1000024

Zhen Yao, N. Rajpoot

{"title":"Less redundant codes for variable size dictionaries","authors":"Zhen Yao, N. Rajpoot","doi":"10.1109/DCC.2002.1000024","DOIUrl":"https://doi.org/10.1109/DCC.2002.1000024","url":null,"abstract":"Summary form only given. We report on a family of variable-length codes with less redundancy than the flat code used in most of the variable size dictionary-based compression methods. The length of codes belonging to this family is still bounded above by [log/sub 2/ |D|] where |D| denotes the dictionary size. We describe three of these codes, namely, the balanced code, the phase-in-binary code (PB), and the depth-span code (DS). As the name implies, the balanced code is constructed by a height balanced tree, so it has the shortest average codeword length. The corresponding coding tree for the PB code has an interesting property that it is made of full binary phases, and thus the code can be computed efficiently using simple binary shifting operations. The DS coding tree is maintained in such a way that the coder always finds the longest extendable codeword and extends it until it reaches the maximum length. It is optimal with respect to the code-length contrast. The PB and balanced codes have almost similar improvements, around 3% to 7% which is very close to the relative redundancy in flat code. The DS code is particularly good in dealing with files with a large amount of redundancy, such as a running sequence of one symbol. We also did some empirical study on the codeword distribution in the LZW dictionary and proposed a scheme called dynamic block shifting (DBS) to further improve the codes' performance. Experiments suggest that the DBS is helpful in compressing random sequences. From an application point of view, PB code with DBS is recommended for general practical usage.","PeriodicalId":420897,"journal":{"name":"Proceedings DCC 2002. Data Compression Conference","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114284435","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

Compression techniques for active video content 活动视频内容的压缩技术

Proceedings DCC 2002. Data Compression Conference Pub Date : 2002-04-02 DOI: 10.1109/DCC.2002.1000009

A. Neogi, T. Chiueh

{"title":"Compression techniques for active video content","authors":"A. Neogi, T. Chiueh","doi":"10.1109/DCC.2002.1000009","DOIUrl":"https://doi.org/10.1109/DCC.2002.1000009","url":null,"abstract":"Summary for only given. Conventional digital video playback systems provide only limited user interactivity, mostly in the form of VCR-like controls. In this model, the temporal ordering and the spatial viewpoints of the video streams being viewed are completely determined at authoring time. In contrast, we have defined a form of interactive video called active video (see http://www.ecsl.cs.sunysb.edu//spl sim/anindya/avs/avs.html, 2002), which supports hyper-linking among related video sequences and interpolation of video sequences with neighboring viewpoints, to offer end users the additional flexibility of choosing the sequencing and the viewing angle (even virtual ones) at playback time. However, active video has a substantially higher storage and transmission cost due to multiple time-synchronized video streams capturing the dynamic scene and the pixel-level correspondence maps encoding the spatial association among the frame-pairs of all adjacent streams. The maps are interpolated at run-time to generate virtual views. We describe and evaluate the following three compression techniques that alleviate the storage and network transmission costs of active video: spatial video compression; lossy map compression; lossless map compression.","PeriodicalId":420897,"journal":{"name":"Proceedings DCC 2002. Data Compression Conference","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114426549","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

Zero-error source coding with maximum distortion criterion 最大失真准则的零误差源编码

Proceedings DCC 2002. Data Compression Conference Pub Date : 2002-04-02 DOI: 10.1109/DCC.2002.999947

E. Tuncel, P. Koulgi, S. Regunathan, K. Rose

引用次数: 10

Progressive image communication over binary channels with additive bursty noise 具有加性突发噪声的二进制信道上的渐进图像通信

Proceedings DCC 2002. Data Compression Conference Pub Date : 2002-04-02 DOI: 10.1109/DCC.2002.999965

F. Behnamfar, F. Alajaji, T. Linder

引用次数: 4

Improved behaviour of tries by the "symmetrization" of the source 通过源的“对称化”改进了尝试的行为

Proceedings DCC 2002. Data Compression Conference Pub Date : 2002-04-02 DOI: 10.1109/DCC.2002.999975

Y. Reznik, W. Szpankowski

引用次数: 2

Low bit rate image coding in the scale space 尺度空间中的低比特率图像编码

Proceedings DCC 2002. Data Compression Conference Pub Date : 2002-04-02 DOI: 10.1109/DCC.2002.999941

Xin Li

引用次数: 13

Low-complexity lossless and fine-granularity scalable near-lossless compression of color images 彩色图像的低复杂度无损和细粒度可伸缩近无损压缩

Proceedings DCC 2002. Data Compression Conference Pub Date : 1900-01-01 DOI: 10.1109/DCC.2002.1000020

R. van der Vleuten

{"title":"Low-complexity lossless and fine-granularity scalable near-lossless compression of color images","authors":"R. van der Vleuten","doi":"10.1109/DCC.2002.1000020","DOIUrl":"https://doi.org/10.1109/DCC.2002.1000020","url":null,"abstract":"Summary form only given. We present a method that extends lossless compression with the feature of fine-granularity scalable near lossless compression while preserving the high compression efficiency and low complexity exhibited by dedicated lossless compression methods when compared to the scalable compression methods developed for lossy image compression. The method operates by splitting the image pixel values into their most significant bits (MSB) and least significant bits (LSB). The MSB are losslessly compressed by a dedicated lossless compression method (e.g. JPEG-LS). The LSB are compressed by a scalable encoder, i.e. in such a way that their description may be truncated at any desired point. We also present a method to automatically and adaptively determine the MSB/LSB split point such that a scalable bit string is obtained without affecting the compression efficiency and without producing compression artefacts for near-lossless compression. To determine the split point, first a low complexity DPCM-type prediction is carried out on the original pixel values to obtain the prediction error signal. Next, the split point is computed from the average value of the magnitude of this signal. Finally, applying a (lossless) color transform to decorrelate the image color components before compressing them provides a higher (lossless) compression ratio.","PeriodicalId":420897,"journal":{"name":"Proceedings DCC 2002. Data Compression Conference","volume":"386 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117266982","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}

引用次数: 13