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

筛选
英文 中文
Linear-time construction of optimal context trees 最优上下文树的线性时间构造
Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672167
H. Helfgott, M. Cohn
{"title":"Linear-time construction of optimal context trees","authors":"H. Helfgott, M. Cohn","doi":"10.1109/DCC.1998.672167","DOIUrl":"https://doi.org/10.1109/DCC.1998.672167","url":null,"abstract":"We show how to construct an optimal context tree for a given plaintext and context order. Our algorithm runs in time linear in the size of the plaintext and the size of the context, and consumes space linear in the size of the plaintext. We evaluate the algorithm's performance on the CCITT test set for bilevel images with the Euclidean-norm context order.","PeriodicalId":191890,"journal":{"name":"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)","volume":"15 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":"125121363","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}
引用次数: 9
Adaptive wavelet transforms for image coding using lifting 自适应小波变换图像编码使用提升
Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672259
Roger Claypool, G. Davis, W. Sweldens, Richard Baraniuk
{"title":"Adaptive wavelet transforms for image coding using lifting","authors":"Roger Claypool, G. Davis, W. Sweldens, Richard Baraniuk","doi":"10.1109/DCC.1998.672259","DOIUrl":"https://doi.org/10.1109/DCC.1998.672259","url":null,"abstract":"Summary form only given. Image compression relies on efficient representations of images, and within smooth image regions, the wavelet transform provides such a representation. However, near edges, wavelet coefficients decay slowly and are expensive to code. We focus on improving the transform by incorporating adaptivity. Construction of nonlinear filter banks has been discussed, but the question of how to utilize the nonlinearities remained. We answer this question by describing our transform via lifting. Lifting provides a spatial domain framework for the wavelet transform. In the lifting formalism, wavelet coefficients are seen as prediction residuals from a linear prediction operation. Wavelet coefficients are large near edges because the linear predictors are built to interpolate low order polynomials. Our goal is to avoid this problem by adapting the predictor based on local image properties. In smooth regions of the image, we use high order polynomial predictors. We adaptively reduce the prediction order to avoid attempting to predict values across discontinuities.","PeriodicalId":191890,"journal":{"name":"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)","volume":"4 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":"125195729","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
Practical multi-resolution source coding: TSVQ revisited 实用的多分辨率源编码:TSVQ重访
Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672131
M. Effros
{"title":"Practical multi-resolution source coding: TSVQ revisited","authors":"M. Effros","doi":"10.1109/DCC.1998.672131","DOIUrl":"https://doi.org/10.1109/DCC.1998.672131","url":null,"abstract":"Consider a multi-resolution source code for describing a stationary source at L resolutions. The description at the first resolution is given at rate R/sub 1/ and achieves an expected distortion no greater than D/sub 1/. The description at the second resolution includes both the first description and a refining description of rate R/sub 2/ and achieves expected distortion no greater than D/sub 2/, and so on. Previously derived multi-resolution source coding bounds describe the family of achievable rate and distortion vectors ((R/sub 1/, R/sub 2/, ..., R/sub L/), (D/sub 1/, D/sub 2/, D/sub L/)). By examining these multi-resolution rate-distortion bounds, we gain insight into the problem of practical multi-resolution source coding. These insights lead to a new multi-resolution source code based on the tree-structured vector quantizer. This paper covers the algorithm, its optimal design, and preliminary experimental results.","PeriodicalId":191890,"journal":{"name":"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)","volume":"514 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":"117039418","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}
引用次数: 27
Low bit-rate video coding with trellis source codes 低比特率视频编码与网格源代码
Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672304
Magatho A. Mello, T. Fischer
{"title":"Low bit-rate video coding with trellis source codes","authors":"Magatho A. Mello, T. Fischer","doi":"10.1109/DCC.1998.672304","DOIUrl":"https://doi.org/10.1109/DCC.1998.672304","url":null,"abstract":"Summary form only given. A novel trellis coded quantisation (TCQ) encoding method is introduced that uses a hard thresholding operation to partition the zig-zag scanned coefficients into two classes: significant, |x|/spl ges/T, and insignificant, |x|<T, where T is a threshold. Only significant coefficients are TCQ encoded, the remainder being scaler quantized to zero. Aside from improved rate-distortion performance, the thresholding reduces the algorithmic complexity, since it is only the (relatively few) significant DCT coefficients that need be trellis encoded. However, to achieve a significant portion of the available granular gain, it is necessary to TCQ encode a large number of coefficients. Thus, an entire GOB is jointly encoded. An arithmetic code is used to encode the sequence of zero-runs and non-zero TCQ codeword indices. Comparing the performance of the new method to Telenor's H.263 algorithm for intra- and inter-frame coding, at medium to large encoding rates, the new method provides improvements of up to about 1 dB. At small encoding rates the combination of diminishing granular gain available over scalar quantization, the relatively few significant DCT coefficients in a typical group of blocks, and the overhead of truncating the arithmetic coding after each frame, causes the new method to perform no better than, and sometimes worse than, the H.263 algorithm, for encoding in the inter-frame mode.","PeriodicalId":191890,"journal":{"name":"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)","volume":"34 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":"126585997","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
Accurate subband coding with low resolution quantization 精确子带编码与低分辨率量化
Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672192
Z. Cvetković
{"title":"Accurate subband coding with low resolution quantization","authors":"Z. Cvetković","doi":"10.1109/DCC.1998.672192","DOIUrl":"https://doi.org/10.1109/DCC.1998.672192","url":null,"abstract":"Redundant signal expansions exhibit robustness to degradation by additive noise, at a degree which is proportional to expansion redundancy. This property can be exploited for obtaining accurate signal representations with low resolution quantization, and it has been used in oversampled A/D conversion. A problem with this approach to source coding is that the bit-rate increases linearly with expansion redundancy giving poor rate-distortion performances. Entropy coding schemes that could remedy the problem of fast increase of the bit-rate have not yet been studied in general. An example of a redundant expansion which is amenable to efficient encoding of quantized samples is discussed. A quantitative characterization of noise reduction properties of redundant expansions is given first. Then, a subband coding scheme based on overcomplete short-time Fourier expansions and low resolution quantization is discussed. This scheme allows for efficient lossless encoding of quantized expansion coefficients, with a logarithmic increase of the bit-rate with redundancy. Thus, it attains an exponential error decay in the bit-rate.","PeriodicalId":191890,"journal":{"name":"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)","volume":"41 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":"126792805","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}
引用次数: 5
Embedded trellis coded quantization 嵌入式网格编码量化
Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672135
H. Brunk, N. Farvardin
{"title":"Embedded trellis coded quantization","authors":"H. Brunk, N. Farvardin","doi":"10.1109/DCC.1998.672135","DOIUrl":"https://doi.org/10.1109/DCC.1998.672135","url":null,"abstract":"Embedded trellis coded quantization (E-TCQ) is introduced as an embedded quantization technique which achieves good rate-distortion performance for reasonable computational complexity. The performance of E-TCQ is investigated for memoryless Gaussian, Laplacian, and uniform sources. E-TCQ is shown to outperform multi-stage TCQ. For Gaussian and Laplacian sources the performance of ETCQ shows large gains over the performance of scalar embedded quantizers. In the case of a Gaussian source, the performance loss of E-TCQ compared with TCQ decreases with increasing number of trellis states.","PeriodicalId":191890,"journal":{"name":"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)","volume":"37 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":"122041239","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
Control structure efficiency enhancement for predictive video coding 预测视频编码控制结构效率的提高
Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672324
R. Wright, E. Keenan, M. Mannucci, M. Rajan, T. Hanratty, J. Dumer
{"title":"Control structure efficiency enhancement for predictive video coding","authors":"R. Wright, E. Keenan, M. Mannucci, M. Rajan, T. Hanratty, J. Dumer","doi":"10.1109/DCC.1998.672324","DOIUrl":"https://doi.org/10.1109/DCC.1998.672324","url":null,"abstract":"Summary form only given. To achieve superior video compression performance it is generally necessary to base the encoding decisions on a local scale, instead of the traditional frame-by-frame approach. Partitioning schemes for optimal frame subdivision have been proposed. Unfortunately, a full local approach that leads to inhomogeneous partitioning of the frame encounters the serious problem of dealing with an increase of side information, particularly in the area of very low bit-rate compression where a relatively large overhead can possibly erode the benefits of the local analysis. Our approach adopts a moderate position, which can still retain some of the advantages of variable block size while keeping the overhead to a bare minimum. The idea is to subdivide a frame in a fixed number of square panels that we call \"megablocks.\" All decisions relative to intra (I) or inter (P) coding are made at the megablock level. These decisions pertain to motion block size and degree of error quantization in the P-mode as well as vector and scalar quantization of subbands in the I-mode. The key to the improved performance of the megablock partitioning scheme is the joint cost minimization of motion field and quantized error information. In very low bit rate video coding, the cost of transmitting motion vectors consumes a significant fraction of the total bit budget. The megablock structure permits the use of variable size motion blocks without incurring the cost associated with motion segmentation or a full quadtree approach.","PeriodicalId":191890,"journal":{"name":"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)","volume":"38 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":"114092525","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
FACOLA-face coder based on location and attention facola -基于位置和注意力的面部编码器
Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672328
Debin Zhao, Y. Chan, Wen Gao
{"title":"FACOLA-face coder based on location and attention","authors":"Debin Zhao, Y. Chan, Wen Gao","doi":"10.1109/DCC.1998.672328","DOIUrl":"https://doi.org/10.1109/DCC.1998.672328","url":null,"abstract":"Summary form only given. FACOLA (face coder based on location and attention) is proposed for potential applications such as compression of face pictures used in IC and ID cards. The face locator locates a face in an image using template matching and eigenface techniques. The attention detector detects high attention and low attention in the located face according to their different frequency characteristics. For high attention, usually high quality or lossless coding is required. The DCT is not suitable for such a case because it will not lead to an efficient compaction of the image energy and variable length coding (VLC) cannot be done efficiently. So a DPCM coder with three directional predictors is presented instead of the DCT. The prediction difference is quantized and the entropy coded DPCM coder supports lossless and lossy compression. The DCT coder is adopted for low attention and non-face area compression using different quantization factors.","PeriodicalId":191890,"journal":{"name":"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)","volume":"146 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":"128430376","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
Lossless compression of pre-press images using linear color decorrelation 使用线性色彩去相关的印前图像的无损压缩
Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672320
S. V. Assche, W. Philips, I. Lemahieu
{"title":"Lossless compression of pre-press images using linear color decorrelation","authors":"S. V. Assche, W. Philips, I. Lemahieu","doi":"10.1109/DCC.1998.672320","DOIUrl":"https://doi.org/10.1109/DCC.1998.672320","url":null,"abstract":"Summary form only given. In the pre-press industry color images have both a high spatial and a high color resolution. Such images require a considerable amount of storage space and impose long transmission times. Data compression is desired to reduce these storage and transmission problems. Because of the high quality requirements in the pre-press industry only lossless compression is acceptable. Most existing lossless compression schemes operate on gray-scale images. In this case the color components of color images must be compressed independently. However, higher compression ratios can be achieved by exploiting inter-color redundancies. We present a new technique for exploiting inter-component redundancies. The technique is based on a modified Karhunen-Loeve transform (KLT) scheme in combination with a novel quantization scheme that guarantees losslessness. The KLT decorrelates the color components. It is recomputed on a block by block basis and is therefore spatially adaptive. Spatial redundancies are removed using predictive techniques (lossless JPEG predictor no. 7 and the CALIC-predictor). The data which remains after the (spatial and color) decorrelation should be entropy-coded, but in the current implementation of our scheme only the entropy of the remaining data is computed. Note that in each block some block-dependent information must be sent, such as entropy-coder initialization information and KLT-descriptors (i.e., the rotation angles of the orthogonal KLT-matrix).","PeriodicalId":191890,"journal":{"name":"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)","volume":"36 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":"133786049","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
Transmission error robust fractal coding using a model-residual approach 基于模型残差法的传输误差鲁棒分形编码
Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225) Pub Date : 1998-03-30 DOI: 10.1109/DCC.1998.672164
M. Novak
{"title":"Transmission error robust fractal coding using a model-residual approach","authors":"M. Novak","doi":"10.1109/DCC.1998.672164","DOIUrl":"https://doi.org/10.1109/DCC.1998.672164","url":null,"abstract":"The robustness of a fractal code generated by model-residual fractal image coding algorithms is discussed. The code, representing a transformation, is transmitted through a binary symmetric channel introducing random bit errors. These bit errors introduce errors in the transformation and in the decoded image. It is shown that the effects on the decoded image are limited, and that it is possible to approximately calculate the effects of the errors if the characteristics of the transmission channel are known.","PeriodicalId":191890,"journal":{"name":"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)","volume":"13 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":"115276913","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信