发布求助
文献互助 智能选刊 最新文献

2007 Data Compression Conference (DCC'07)最新文献

筛选
英文 中文
Gaussian Golomb Codes 高斯高斯戈洛姆码
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.40
Seishi Takamura, Y. Yashima
{"title":"Gaussian Golomb Codes","authors":"Seishi Takamura, Y. Yashima","doi":"10.1109/DCC.2007.40","DOIUrl":"https://doi.org/10.1109/DCC.2007.40","url":null,"abstract":"This paper tackles this problem by mapping the normal distribution into the geometric distribution before applying Golomb codes, which is optimal for geometric distributions. In our mapping, a pair of normally-distributed i.i.d. integers (say (x,y)) is concatenated and then mapped to one natural number z(x,y). The conditions that z shall satisfy are: minx,y Z(x,y)=0, l(x,y)<l(a,b)=>z(x,y)<z(a,b) and z(x,y)=z(a,b)< => (x,y) = (a,b), where l(x,y) is an arbitrary distance measure between the origin and the grid point (x,y), such as the Euclidean norm. The mapping can be easily obtained using a computer program. In addition, if the upper- and lower- bounds of the source is known, pre-calculated mapping table can be stored in the memory because it is independent of source statistics. Of course, this table is not needed to be downloaded/transmitted. After this mapping, z is made geometrically-distributed and conventional Golomb codes can be efficiently applied.","PeriodicalId":234035,"journal":{"name":"2007 Data Compression Conference (DCC'07)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124680684","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}
引用次数: 2
New fast search algorithm for base layer of H.264 scalable video coding extension 基于H.264可扩展视频编码扩展的基础层快速搜索算法
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.58
Livio Lima, D. Alfonso, L. Pezzoni, R. Leonardi
{"title":"New fast search algorithm for base layer of H.264 scalable video coding extension","authors":"Livio Lima, D. Alfonso, L. Pezzoni, R. Leonardi","doi":"10.1109/DCC.2007.58","DOIUrl":"https://doi.org/10.1109/DCC.2007.58","url":null,"abstract":"In this contribution, a fast search motion estimation algorithm for H.264/AVC SVC (scalable video coding) base layer with hierarchical B-frame structure for temporal decomposition is presented and compared with fast search motion estimation algorithm in JSVM software, that is the reference software for H.264/AVC SVC. The proposed technique is a block-matching based motion estimation algorithm working in two steps, called Coarse search and Fine search. The Coarse search is performed for each frame in display order, and for each 16x16 macroblock chooses the best motion vector at half pel accuracy. Fine search is performed for each frame in encoding order and finds the best prediction for each block type, reference frame and direction, choosing the best motion vector at quarter pel accuracy using R-D optimization. Both Coarse and Fine Search test 3 spatial and 3 temporal predictors, and add to the best one a set of updates.","PeriodicalId":234035,"journal":{"name":"2007 Data Compression Conference (DCC'07)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132375551","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}
引用次数: 2
Bit Allocation Based on Motion Vector Analysis for H.264/AVC H.264/AVC中基于运动矢量分析的比特分配
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.17
H. M. Mohammed, Nikolaus Färber, Herbert Thoma
{"title":"Bit Allocation Based on Motion Vector Analysis for H.264/AVC","authors":"H. M. Mohammed, Nikolaus Färber, Herbert Thoma","doi":"10.1109/DCC.2007.17","DOIUrl":"https://doi.org/10.1109/DCC.2007.17","url":null,"abstract":"In this paper we present a bit allocation approach based on motion vector analysis for improved rate-distortion performance. Bit allocation is done at the macroblock level such that the macroblock with high priority is coded finely and the one with low priority is coded coarsely. In order to calculate macroblock priorities, first reference counts for each pixel are determined through motion vector analysis. A reference count of a pixel is defined as total number of pixels in the remaining GOP which use that pixel as a reference. Then macroblock wise reference counts is obtained by summing the pixel wise reference counts, which are then scaled and prioritized. Based upon the priority value the given fixed quant of each frame is modulated at the macroblock level. The algorithm is applied to H.264/AVC encoding and PSNR gains of up to 1.4 dB are achieved","PeriodicalId":234035,"journal":{"name":"2007 Data Compression Conference (DCC'07)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114210695","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
A Fast Lossless Codec of Continuous-Tone Images for Thin Client Computing 用于瘦客户端计算的连续色调图像的快速无损编解码器
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.3
Chun Yang, Yan Niu, Yubin Xia, Xu Cheng
{"title":"A Fast Lossless Codec of Continuous-Tone Images for Thin Client Computing","authors":"Chun Yang, Yan Niu, Yubin Xia, Xu Cheng","doi":"10.1109/DCC.2007.3","DOIUrl":"https://doi.org/10.1109/DCC.2007.3","url":null,"abstract":"Summary form only given. We propose a fast and efficient lossless codec of continuous-tone images, SPEDIC (simple predictor and edge detector based image codec), which is uniquely suitable for coding screen updates generated by multimedia applications in thin client computing systems. A codec for thin client computing should take account of the tradeoff between compression ratio and coding complexity, because screen update images in thin client computing should be sent from server to client in a timely fashion. We argue that by combining similar but simpler building blocks of the state-of-the-art methods, a little inferior compression ratio of JPEG-LS (the standard for lossless image compression today) can be attained with much lower coding complexity.","PeriodicalId":234035,"journal":{"name":"2007 Data Compression Conference (DCC'07)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116244555","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
Transmission Over Slowly Fading Channels Using Unreliable Quantized Feedback 使用不可靠量化反馈的慢衰落信道传输
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.78
S. Ekbatani, F. Etemadi, H. Jafarkhani
{"title":"Transmission Over Slowly Fading Channels Using Unreliable Quantized Feedback","authors":"S. Ekbatani, F. Etemadi, H. Jafarkhani","doi":"10.1109/DCC.2007.78","DOIUrl":"https://doi.org/10.1109/DCC.2007.78","url":null,"abstract":"We study the problem of maximizing the expected rate over a slowly fading channel with quantized channel state information at the transmitter (CSIT). This problem has been recently studied in the literature assuming a noiseless feedback link. In this work, we consider a more realistic model, where the feedback link suffers from fading, as well as the limited power allocated to the feedback signals. Our scheme considers a finite-state model to capture the fading in the feedback link. We solve the rate maximization problem with different power control strategies at the transmitter. A channel optimized sealer quantizer (COSQ) is designed to incorporate feedback in our transmission scheme. Unlike the conventional COSQs where the objective is to reconstruct the source, our proposed quantizer is designed to optimize the expected rate of the forward link. For a high quality feedback channel, the proposed system performs close to the noiseless feedback case, while its performance converges to the no-feedback scenario as the feedback channel quality degrades","PeriodicalId":234035,"journal":{"name":"2007 Data Compression Conference (DCC'07)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123806140","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}
引用次数: 28
Bounds on Redundancy in Constrained Delay Arithmetic Coding 约束延迟算术编码中的冗余界
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.19
O. Shayevitz, E. Meron, M. Feder, R. Zamir
{"title":"Bounds on Redundancy in Constrained Delay Arithmetic Coding","authors":"O. Shayevitz, E. Meron, M. Feder, R. Zamir","doi":"10.1109/DCC.2007.19","DOIUrl":"https://doi.org/10.1109/DCC.2007.19","url":null,"abstract":"We address the problem of a finite delay constraint in an arithmetic coding system. Due to the nature of the arithmetic coding process, source sequences causing arbitrarily large encoding or decoding delays exist. Therefore, to meet a finite delay constraint, it is necessary to intervene with the normal flow of the coding process, e.g., to insert fictitious symbols. This results in an inevitable coding rate redundancy. In this paper, we derive an upper bound on the achievable redundancy for a memoryless source. We show that this redundancy decays exponentially as a function of the delay constraint, and thus it is clearly superior to block to variable methods in that aspect. The redundancy-delay exponent is shown to be lower bounded by log(1/alpha), where alpha is the probability of the most likely source symbol. Our results are easily applied to practical problems such as the compression of English text","PeriodicalId":234035,"journal":{"name":"2007 Data Compression Conference (DCC'07)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128429903","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}
引用次数: 2
Power Preserving 2:1 Bandwidth Reduction Mappings 保电2:1减带宽映射
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.65
A. Ingber, M. Feder
{"title":"Power Preserving 2:1 Bandwidth Reduction Mappings","authors":"A. Ingber, M. Feder","doi":"10.1109/DCC.2007.65","DOIUrl":"https://doi.org/10.1109/DCC.2007.65","url":null,"abstract":"In this work we consider dimension reducing mappings that can be used for joint source-channel coding (JSCC) systems. In such systems, the source coding and the channel coding is performed as a single operation. Although it is known by Shannon's separation theorem that asymptotically JSCC is not required for attaining the optimal performance, utilizing such schemes is beneficial for practical reasons such as delay and implementation simplicity. We specifically focus on the bandwidth reduction case, where the bandwidth of the data is greater than the bandwidth of the channel. More specifically, we focus on bandwidth reduction mappings, where the JSCC operation is performed using a single nonlinear operation. A modification of the spiral mapping is presented, so the power at the output is proportional to that of the input","PeriodicalId":234035,"journal":{"name":"2007 Data Compression Conference (DCC'07)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130607634","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
Spectral Predictors 光谱预测
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.72
Lorenzo Ibarria, Peter Lindstrom, J. Rossignac
{"title":"Spectral Predictors","authors":"Lorenzo Ibarria, Peter Lindstrom, J. Rossignac","doi":"10.1109/DCC.2007.72","DOIUrl":"https://doi.org/10.1109/DCC.2007.72","url":null,"abstract":"Many scientific, imaging, and geospatial applications produce large high-precision scalar fields sampled on a regular grid. Lossless compression of such data is commonly done using predictive coding, in which weighted combinations of previously coded samples known to both encoder and decoder are used to predict subsequent nearby samples. In hierarchical, incremental, or selective transmission, the spatial pattern of the known neighbors is often irregular and varies from one sample to the next, which precludes prediction based on a single stencil and fixed set of weights. To handle such situations and make the best use of available neighboring samples, we propose a local spectral predictor that offers optimal prediction by tailoring the weights to each configuration of known nearby samples. These weights may be precomputed and stored in a small lookup table. We show that predictive coding using our spectral predictor improves compression for various sources of high-precision data","PeriodicalId":234035,"journal":{"name":"2007 Data Compression Conference (DCC'07)","volume":"30 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131372926","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
Distortion-Complexity Optimization of the H.264/MPEG-4 AVC Encoder using the GBFOS Algorithm 基于GBFOS算法的H.264/MPEG-4 AVC编码器失真复杂度优化
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.33
R. Vanam, E. Riskin, S. Hemami, R. Ladner
{"title":"Distortion-Complexity Optimization of the H.264/MPEG-4 AVC Encoder using the GBFOS Algorithm","authors":"R. Vanam, E. Riskin, S. Hemami, R. Ladner","doi":"10.1109/DCC.2007.33","DOIUrl":"https://doi.org/10.1109/DCC.2007.33","url":null,"abstract":"The H.264/ACV standard provides significant improvements in performance over earlier video coding standards at the cost of increased complexity. Our challenge is to determine H.264 parameter settings that have low complexity but still offer high video quality. In this paper, we propose two fast algorithms for finding the H.264 parameter settings that take about 1% and 8%, respectively, of the number of tests required by an exhaustive search. Both the fast algorithms result in a maximum decrease in peak-signal-to-noise ratio of less than 0.71 dB for different data sets and bitrates","PeriodicalId":234035,"journal":{"name":"2007 Data Compression Conference (DCC'07)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116656779","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}
引用次数: 29
Memory-Efficient Image Codec Using Line-based Backward Coding of Wavelet Trees 基于小波树的行反向编码的高效图像编解码器
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.55
L. Ye, Jiangling Guo, B. Nutter, S. Mitra
{"title":"Memory-Efficient Image Codec Using Line-based Backward Coding of Wavelet Trees","authors":"L. Ye, Jiangling Guo, B. Nutter, S. Mitra","doi":"10.1109/DCC.2007.55","DOIUrl":"https://doi.org/10.1109/DCC.2007.55","url":null,"abstract":"Wavelet tree-based image compression algorithms have excellent rate distortion performance. However, they have a major drawback in their memory consumption. A new approach based on backward coding of wavelet trees (BCWT) has been recently developed. Although the BCWT algorithm itself uses much less memory than the SPIHT algorithm, the total system memory usage in BCWT coding is still high due to the large memory consumption of the wavelet transform. In this paper, the line-based BCWT algorithm is presented, which utilizes the line-based wavelet transform to achieve BCWT coding. Due to the backward coding feature of the BCWT algorithm, the line-based BCWT algorithm can significantly reduce the overall system memory usage. Depending upon the image size, the memory usage of the line-based BCWT algorithm can be less than 1% of the memory usage of the SPIHT algorithm. Compared with the original BCWT algorithm, the line-based BCWT algorithm can use less than 2% of the memory that the BCWT algorithm consumes, thus making this algorithm extremely suitable for implementation on resource-limited platforms","PeriodicalId":234035,"journal":{"name":"2007 Data Compression Conference (DCC'07)","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116051652","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
首页 上一页 下一页 尾页
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学术官方微信
小红书