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

2010 Data Compression Conference最新文献

筛选
英文 中文
Estimation-Theoretic Delayed Decoding of Predictively Encoded Video Sequences 预测编码视频序列的估计理论延迟解码
2010 Data Compression Conference Pub Date : 2010-03-24 DOI: 10.1109/DCC.2010.18
Jingning Han, Vinay Melkote, K. Rose
{"title":"Estimation-Theoretic Delayed Decoding of Predictively Encoded Video Sequences","authors":"Jingning Han, Vinay Melkote, K. Rose","doi":"10.1109/DCC.2010.18","DOIUrl":"https://doi.org/10.1109/DCC.2010.18","url":null,"abstract":"Current video coding schemes employ motion compensation to exploit the fact that the signal forms an auto-regressive process along the motion trajectory, and remove temporal redundancies with prior reconstructed samples via prediction. However, the decoder may, in principle, also exploit correlations with received encoding information of future frames. In contrast to current decoders that reconstruct every block immediately as the corresponding quantization indices are available, we propose an estimation-theoretic delayed decoding scheme which leverages quantization and motion information of one or more future frames to refine the reconstruction of the current block. The scheme, implemented in the transform domain, efficiently combines all available (including future) information in an appropriately derived conditional pdf, to obtain the optimal delayed reconstruction of each transform coefficient in the frame. Experiments demonstrate substantial gains over the standard H.264 decoder. The scheme learns the autoregressive model from information available to the decoder, and compatibility with the standard syntax and existing encoders is retained.","PeriodicalId":299459,"journal":{"name":"2010 Data Compression Conference","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127898060","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
A New Searchable Variable-to-Variable Compressor 一种新的可搜索变量对变量压缩器
2010 Data Compression Conference Pub Date : 2010-03-24 DOI: 10.1109/DCC.2010.25
N. Brisaboa, A. Fariña, Juan R. Lopez, G. Navarro, Eduardo Rodríguez López
{"title":"A New Searchable Variable-to-Variable Compressor","authors":"N. Brisaboa, A. Fariña, Juan R. Lopez, G. Navarro, Eduardo Rodríguez López","doi":"10.1109/DCC.2010.25","DOIUrl":"https://doi.org/10.1109/DCC.2010.25","url":null,"abstract":"Word-based compression over natural language text has shown to be a good choice to trade compression ratio and speed, obtaining compression ratios close to 30% and very fast decompression. Additionally, it permits fast searches over the compressed text using Boyer-Moore type algorithms. Such compressors are based on processing fixed source symbols (words) and assigning them variable-byte-length codewords, thus following a fixed-to-variable approach. We present a new variable-to-variable compressor (v2vdc) that uses words and phrases as the source symbols, which are encoded with a variable-length scheme. The phrases are chosen using the longest common prefix information on the suffix array of the text, so as to favor long and frequent phrases. We obtain compression ratios close to those of p7zip and ppmdi, overcoming bzip2, and 8-10 percentage points less than the equivalent word-based compressor. V2vdc is in addition among the fastest to decompress, and allows efficient direct search of the compressed text, in some cases the fastest to date as well.","PeriodicalId":299459,"journal":{"name":"2010 Data Compression Conference","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128079404","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
Data Compression Technology Dedicated to Distribution and Embedded Systems 专用于分布式和嵌入式系统的数据压缩技术
2010 Data Compression Conference Pub Date : 2010-03-24 DOI: 10.1109/DCC.2010.73
J. Odagiri, Noriko Itani, Y. Nakano, D. Culler
{"title":"Data Compression Technology Dedicated to Distribution and Embedded Systems","authors":"J. Odagiri, Noriko Itani, Y. Nakano, D. Culler","doi":"10.1109/DCC.2010.73","DOIUrl":"https://doi.org/10.1109/DCC.2010.73","url":null,"abstract":"In distribution and embedded systems, data compression is often used to reduce the size of flash RAM and transmission data, while a rapid decompression speed enables faster rebooting of the compressed program code. We have developed a new data compression algorithm with a high decompression speed and a good compression rate that is equivalent to zlib, the standard technology in use today. We created a LZSS-based algorithm by optimizing the parsing of data strings. LZSS is known as a high decompression speed algorithm useful for embedded systems, and optimal parsing is well known as a method for improving compression rates [1]. Previously, this combination had not been implemented because statistical code length varies during optimal parsing [1]. Our algorithm overcomes this problem by calculating the probability of the literal or the code ( distance and length ) solving the shortest path problem first. It then constructs a simple code set that enables fast decompression using those probabilities and solves the shortest path problem again. Experiments on the standard evaluation data and wireless sensor network program [2] demonstrated that we can achieve a high compression rate equivalent to zlib and a decompression speed that is twice as fast.","PeriodicalId":299459,"journal":{"name":"2010 Data Compression Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128283161","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
An Efficient Algorithm for Almost Instantaneous VF Code Using Multiplexed Parse Tree 一种基于多路解析树的几乎瞬时VF代码的高效算法
2010 Data Compression Conference Pub Date : 2010-03-24 DOI: 10.1109/DCC.2010.27
S. Yoshida, T. Kida
{"title":"An Efficient Algorithm for Almost Instantaneous VF Code Using Multiplexed Parse Tree","authors":"S. Yoshida, T. Kida","doi":"10.1109/DCC.2010.27","DOIUrl":"https://doi.org/10.1109/DCC.2010.27","url":null,"abstract":"Almost Instantaneous VF code proposed by Yamamoto and Yokoo in 2001, which is one of the variable-length-to-fixed-length codes, uses a set of parse trees and achieves a good compression ratio. However, it needs much time and space for both encoding and decoding than an ordinary VF code does. In this paper, we proved that we can multiplex the set of parse trees into a compact single tree and simulate the original encoding and decoding procedures. Our technique reduces the total number of nodes into O(2^l k - k2), while it is originally O(2^l k), where l and k are the codeword length and the alphabet size, respectively. The experimental results showed that we could encode and decode over three times faster for natural language texts by using this technique.","PeriodicalId":299459,"journal":{"name":"2010 Data Compression Conference","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128838491","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}
引用次数: 12
Data Compression Based on a Dictionary Method Using Recursive Construction of T-Codes 基于t码递归构造字典方法的数据压缩
2010 Data Compression Conference Pub Date : 2010-03-24 DOI: 10.1109/DCC.2010.68
K. Hamano, Hirosuke Yamamoto
{"title":"Data Compression Based on a Dictionary Method Using Recursive Construction of T-Codes","authors":"K. Hamano, Hirosuke Yamamoto","doi":"10.1109/DCC.2010.68","DOIUrl":"https://doi.org/10.1109/DCC.2010.68","url":null,"abstract":"We propose a new data compression scheme based on T-codes [3] using a dictionary method such that all phrases added to a dictionary have a recursive structure similar to T-codes. Our scheme can compress the Calgary Corpus more efficiently than known schemes based on T-codes [2] and the UNIX compress, a variant of LZ78.","PeriodicalId":299459,"journal":{"name":"2010 Data Compression Conference","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127828826","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
Segment-Parallel Predictor for FPGA-Based Hardware Compressor and Decompressor of Floating-Point Data Streams to Enhance Memory I/O Bandwidth 基于fpga的浮点数据流硬件压缩和解压缩的段并行预测器，以提高内存I/O带宽
2010 Data Compression Conference Pub Date : 2010-03-24 DOI: 10.1109/DCC.2010.44
K. Sano, Kazuya Katahira, S. Yamamoto
{"title":"Segment-Parallel Predictor for FPGA-Based Hardware Compressor and Decompressor of Floating-Point Data Streams to Enhance Memory I/O Bandwidth","authors":"K. Sano, Kazuya Katahira, S. Yamamoto","doi":"10.1109/DCC.2010.44","DOIUrl":"https://doi.org/10.1109/DCC.2010.44","url":null,"abstract":"This paper presents segment-parallel prediction for high-throughput compression and decompression of floating-point data streams on an FPGA-based LBM accelerator. In order to enhance the actual memory I/O bandwidth of the accelerator, we focus on the prediction-based compression of floating-point data streams. Although hardware implementation is essential to high-throughput compression, the feedback loop in the decompressor is a bottleneck due to sequential predictions necessary for bit reconstruction. We introduce a segment-parallel approach to the 1D polynomial predictor to achieve the required throughput for decompression. We evaluate the compression ratio of the segment-parallel cubic prediction with various encoders of prediction difference.","PeriodicalId":299459,"journal":{"name":"2010 Data Compression Conference","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123869812","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
Development of Optimum Lossless Compression Systems for Space Missions 用于航天任务的最佳无损压缩系统的开发
2010 Data Compression Conference Pub Date : 2010-03-24 DOI: 10.1109/DCC.2010.70
A. G. Villafranca, J. Portell, E. García–Berro
{"title":"Development of Optimum Lossless Compression Systems for Space Missions","authors":"A. G. Villafranca, J. Portell, E. García–Berro","doi":"10.1109/DCC.2010.70","DOIUrl":"https://doi.org/10.1109/DCC.2010.70","url":null,"abstract":"The scientific instruments included in modern space missions require high compression ratios in order to downlink all the acquired data to the ground. In many cases, this must be achieved without losses and the available processing power is modest. Algorithms requiring large amounts of data for their optimum operation cannot be used due to the limited reliability of the communications channel. Existing methods for lossless data compression often have difficulties in fulfilling such tight requirements. We present a method for the development of lossless compression systems achieving high compression ratios at a low processing cost while guaranteeing a reliable downlink. This is done using a two–stage compressor, with an adequate pre–processing stage followed by an entropy coder. The pre–processor should be tailored for each case and carefully evaluated. For the second stage, we analyze some existing solutions and we present a new entropy coder, which has comparable or even better performances than those offered by most coders and guarantees high ratios in front of outliers. Finally, we present the application of this method to the case of the Gaia mission and we present the results obtained.","PeriodicalId":299459,"journal":{"name":"2010 Data Compression Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128883840","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
A Flexible Multiple Description Coding Scheme Based on Rateless Codes 一种基于无速率码的灵活多描述编码方案
2010 Data Compression Conference Pub Date : 2010-03-24 DOI: 10.1109/DCC.2010.32
Ozgun Y. Bursalioglu, G. Caire
{"title":"A Flexible Multiple Description Coding Scheme Based on Rateless Codes","authors":"Ozgun Y. Bursalioglu, G. Caire","doi":"10.1109/DCC.2010.32","DOIUrl":"https://doi.org/10.1109/DCC.2010.32","url":null,"abstract":"The multiple description coding of an independent and identically distributed Gaussian source over bit error channels is considered. A novel practical multiple description coding scheme is proposed based on scalar embedded quantizers and rateless codes. A peer-to-peer network model is studied where users can receive different number of descriptions and an arbitrary large number of descriptions can be created and transmitted between peers. For this network model convex system optimization problems are defined and solved. The proposed scheme can be regarded as an efficient implementation of ``channel optimized quantization'', where the index assignment is obtained via a low-complexity linear function. The scheme is shown to be robust to bit errors and to achieve higher reconstruction signal-to-noise ratios when compared to previously reported designs.","PeriodicalId":299459,"journal":{"name":"2010 Data Compression Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124362118","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
On the Systematic Measurement Matrix for Compressed Sensing in the Presence of Gross Errors 存在严重误差的压缩感知系统测量矩阵研究
2010 Data Compression Conference Pub Date : 2010-03-24 DOI: 10.1109/DCC.2010.38
Zhi Li, Feng Wu, John Wright
{"title":"On the Systematic Measurement Matrix for Compressed Sensing in the Presence of Gross Errors","authors":"Zhi Li, Feng Wu, John Wright","doi":"10.1109/DCC.2010.38","DOIUrl":"https://doi.org/10.1109/DCC.2010.38","url":null,"abstract":"Inspired by syndrome source coding using linear error-correcting codes, we explore a new form of measurement matrix for compressed sensing. The proposed matrix is constructed in the systematic form [A I], where A is a randomly generated submatrix with elements distributed according to i.i.d. Gaussian, and I is the identity matrix. In the noiseless setting, this systematic construction retains similar property as the conventional Gaussian ensemble achieves. However, in the noisy setting with gross errors of arbitrary magnitude, where Gaussian ensemble fails catastrophically, systematic construction displays strong stability. In this paper, we prove its stable reconstruction property. We further show its l1-norm sparsity recovery property by proving its restricted isometry property (RIP). We also demonstrate how the systematic matrix can be used to design a family of lossy-to-lossless compressed sensing schemes where the number of measurements trades off the reconstruction distortions.","PeriodicalId":299459,"journal":{"name":"2010 Data Compression Conference","volume":"385 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121775307","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}
引用次数: 18
The Non-existence of Length-5 Perfect Slepian-Wolf Codes of Three Sources 长度为5的三源完美睡狼密码的不存在性
2010 Data Compression Conference Pub Date : 2010-03-24 DOI: 10.1109/DCC.2010.85
Samuel Cheng, Rick Ma
{"title":"The Non-existence of Length-5 Perfect Slepian-Wolf Codes of Three Sources","authors":"Samuel Cheng, Rick Ma","doi":"10.1109/DCC.2010.85","DOIUrl":"https://doi.org/10.1109/DCC.2010.85","url":null,"abstract":"We consider Slepian-Wolf (SW) coding of multiple sources and extend the packing bound and the notion of perfect code from conventional channel coding to SW coding with more than two sources. Moreover, we show that there does not exist perfect SW code of length-5 for three sources.","PeriodicalId":299459,"journal":{"name":"2010 Data Compression Conference","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116066929","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
首页 上一页 下一页 尾页
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学术官方微信
小红书