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

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

筛选
英文 中文
Lossless and Near-Lossless Audio Compression Using Integer-Reversible Modulated Lapped Transforms 无损和近无损音频压缩使用整数可逆调制重叠变换
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.51
Henrique S. Malvar
{"title":"Lossless and Near-Lossless Audio Compression Using Integer-Reversible Modulated Lapped Transforms","authors":"Henrique S. Malvar","doi":"10.1109/DCC.2007.51","DOIUrl":"https://doi.org/10.1109/DCC.2007.51","url":null,"abstract":"We present a simple lossless audio codec, composed of an integer-reversible modulated lapped transform (MLT) followed by a backward-adaptive run-length/Golomb-Rice (RLGR) encoder. Its compression performance matches those of state-of-the-art predictive codecs, and it has the advantage that its compressed bitstream contains frequency-domain data that can be used for applications such as search, identification, and visualization. Its compression gain can be improved through a novel data model based on cross-block smoothed spectral magnitude estimates. Its bitstream can be transcoded into a lossy format, for transfers to portable players, at about twice the speed of other codecs. The codec also supports a near-lossless mode, which allows for an extra factor of two in compression without noticeable distortions","PeriodicalId":234035,"journal":{"name":"2007 Data Compression Conference (DCC'07)","volume":"21 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":"115336427","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
Samplify: Real-time Compression for Electronic Measurements 采样:实时压缩电子测量
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.69
Al Wegener
{"title":"Samplify: Real-time Compression for Electronic Measurements","authors":"Al Wegener","doi":"10.1109/DCC.2007.69","DOIUrl":"https://doi.org/10.1109/DCC.2007.69","url":null,"abstract":"This paper describes the Samplify family of lossless and lossy real-time compression algorithms for FPGAs and ASICs, operating at rates up to 40 Gsamp/sec, which achieve efficient, cost-effective compression of between 2:1 and 8:1. Compression for measurements reduces bandwidth and storage requirements in automated test equipment (ATE), medical imaging, oscilloscope, and other mixed-signal test applications.","PeriodicalId":234035,"journal":{"name":"2007 Data Compression Conference (DCC'07)","volume":"47 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":"116642720","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
A New Approach to Decoding of BCH and Reed-Solomon Codes Using Syzygy BCH码和Reed-Solomon码的协同译码新方法
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.5
Il Ho Kim, H. Ko
{"title":"A New Approach to Decoding of BCH and Reed-Solomon Codes Using Syzygy","authors":"Il Ho Kim, H. Ko","doi":"10.1109/DCC.2007.5","DOIUrl":"https://doi.org/10.1109/DCC.2007.5","url":null,"abstract":"A new approach to decoding of BCH and Reed-Solomon codes by using syzygy modules of matricies is introduced. The decoding procedure reduces the computational complexity roughly by half by introducing syzygy modules since the number of variables in each step is reduced by half. The decoding of binary BCH codes can be viewed as the special case of the decoding of nonbinary BCH or Reed-Solomon codes.","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":"125269101","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
Normalized maximum likelihood model of order-1 for the compression of DNA sequences DNA序列压缩的1阶归一化极大似然模型
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.60
G. Korodi, I. Tabus
{"title":"Normalized maximum likelihood model of order-1 for the compression of DNA sequences","authors":"G. Korodi, I. Tabus","doi":"10.1109/DCC.2007.60","DOIUrl":"https://doi.org/10.1109/DCC.2007.60","url":null,"abstract":"We present the NML model for classes of models with memory described by first order dependencies. The model is used for efficiently locating and encoding the best regressor present in a dictionary. By combining the order-1 NML with the order-0 NML model the resulting algorithm achieves a consistent improvement over the earlier order-0 NML algorithm, and it is demonstrated to have superior performance on the practical compression of the human genome","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":"128557770","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}
引用次数: 39
Multiple Description Coding for Stationary and Ergodic Sources
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.56
Jun Chen, C. Tian, S. Diggavi
{"title":"Multiple Description Coding for Stationary and Ergodic Sources","authors":"Jun Chen, C. Tian, S. Diggavi","doi":"10.1109/DCC.2007.56","DOIUrl":"https://doi.org/10.1109/DCC.2007.56","url":null,"abstract":"We consider the problem of multiple description (MD) coding for stationary sources with the squared error distortion measure. The MD rate region is derived for the stationary and ergodic Gaussian sources, and is shown to be achievable with a practical transform lattice quantization scheme. Moreover, the proposed scheme is asymptotically optimal at high resolution for all stationary sources with finite differential entropy rate","PeriodicalId":234035,"journal":{"name":"2007 Data Compression Conference (DCC'07)","volume":"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":"124349222","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
Image Coding on Quincunx Lattice with Adaptive Lifting and Interpolation 基于Quincunx格的自适应提升插值图像编码
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.47
Xiangjun Zhang, Xiaolin Wu, Feng Wu
{"title":"Image Coding on Quincunx Lattice with Adaptive Lifting and Interpolation","authors":"Xiangjun Zhang, Xiaolin Wu, Feng Wu","doi":"10.1109/DCC.2007.47","DOIUrl":"https://doi.org/10.1109/DCC.2007.47","url":null,"abstract":"Considering that quincunx lattice is a more efficient spatial sampling scheme than square lattice, we investigate a new approach of image coding for quincunx sample arrangement. The key findings are: 1) adaptive directional lifting is particularly suited to decorrelate samples on quincunx lattice, and 2) quincunx samples can be processed by a 2D piecewise autoregressive model to reproduce the image of conventional square pixel grid, while preserving high frequency spatial features well. By incorporating these two techniques into the encoder and decoder respectively, we are able to improve the performance of JPEG 2000 image codec at low to modest bit rates. Since an image can be easily split into quincunx segments, this work has significance for multiple description image/video coding as well","PeriodicalId":234035,"journal":{"name":"2007 Data Compression Conference (DCC'07)","volume":"23 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":"122734751","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}
引用次数: 38
Type-Based Compression of XML Data 基于类型的XML数据压缩
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.79
C. League, Kenjone Eng
{"title":"Type-Based Compression of XML Data","authors":"C. League, Kenjone Eng","doi":"10.1109/DCC.2007.79","DOIUrl":"https://doi.org/10.1109/DCC.2007.79","url":null,"abstract":"The extensible markup language XML has become indispensable in many areas, but a significant disadvantage is its size: tagging a set of data increases the space needed to store it, the bandwidth needed to transmit it, and the time needed to parse it. We present a new compression technique based on the document type, expressed as a Relax NG schema. Assuming the sender and receiver agree in advance on the document type, conforming documents can be transmitted extremely compactly. On several data sets with high tag density this technique compresses better than other known XML-aware compressors, including those that consider the document type","PeriodicalId":234035,"journal":{"name":"2007 Data Compression Conference (DCC'07)","volume":"601 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":"133366155","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
High Throughput Compression of Double-Precision Floating-Point Data 双精度浮点数据的高吞吐量压缩
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.44
Martin Burtscher, P. Ratanaworabhan
{"title":"High Throughput Compression of Double-Precision Floating-Point Data","authors":"Martin Burtscher, P. Ratanaworabhan","doi":"10.1109/DCC.2007.44","DOIUrl":"https://doi.org/10.1109/DCC.2007.44","url":null,"abstract":"This paper describes FPC, a lossless compression algorithm for linear streams of 64-bit floating-point data. FPC is designed to compress well while at the same time meeting the high throughput demands of scientific computing environments. On our thirteen datasets, it achieves a substantially higher average compression ratio than BZIP2, DFCM, FSD, GZIP, and PLML At comparable compression ratios, it compresses and decompresses 8 to 300 times faster than the other five algorithms","PeriodicalId":234035,"journal":{"name":"2007 Data Compression Conference (DCC'07)","volume":"24 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":"130785942","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}
引用次数: 89
On Compression of Encrypted Video 关于加密视频的压缩
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.61
D. Schonberg, Chuohao Yeo, S. Draper, K. Ramchandran
{"title":"On Compression of Encrypted Video","authors":"D. Schonberg, Chuohao Yeo, S. Draper, K. Ramchandran","doi":"10.1109/DCC.2007.61","DOIUrl":"https://doi.org/10.1109/DCC.2007.61","url":null,"abstract":"We consider video sequences that have been encrypted uncompressed. Since encryption masks the source, traditional data compression algorithms are rendered ineffective. However, it has been shown that through the use of distributed source-coding techniques, the compression of encrypted data is in fact possible. This means that it is possible to reduce data size without requiring that the data be compressed prior to encryption. Indeed, under some reasonable conditions, neither security nor compression efficiency need be sacrificed when compression is performed on the encrypted data (Johnson et al., 2004). In this paper we develop an algorithm for the practical lossless compression of encrypted gray scale video. Our method is based on considering the temporal correlations in the video. This move to temporal dependence builds on our previous work on memoryless sources, and one- and two-dimensional Markov sources. For comparison, a motion-compensated lossless video encoder can compress each unencrypted frame of the standard \"Foreman\" test video sequence by about 57%. Our algorithm can compress the same frames, after encryption, by about 33%","PeriodicalId":234035,"journal":{"name":"2007 Data Compression Conference (DCC'07)","volume":"25 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":"124955070","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
A Modified BISK Algorithm for 3D Dual-TreeWavelet Transform Coding 三维双树小波变换编码的改进BISK算法
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.4
Joseph B. Boettcher, J. Fowler
{"title":"A Modified BISK Algorithm for 3D Dual-TreeWavelet Transform Coding","authors":"Joseph B. Boettcher, J. Fowler","doi":"10.1109/DCC.2007.4","DOIUrl":"https://doi.org/10.1109/DCC.2007.4","url":null,"abstract":"In this paper presents a video-coding system that does not perform explicit ME/MC but instead relies on the DDWT to isolate moving signal features. To counteract the redundancy of the DDWT, a noise-shaping process increases the sparsity of the transform coefficients, resulting in a high degree of spatiotemporally coherent regions of insignificant coefficients. The transform coefficients are coded with binary set-partitioning using k-d trees (BISK) in an algorithm (DDWT-BISK) that exploits both the within-subband spatiotemporal coherency as well as cross-subband correlation to achieve efficient coding. Whereas a prior DDWT-based coder (DDWTVC2) exploits correlation as it exists across subbands in the DDWT, our DDWT-BISK coder additionally exploits coherent regions of insignificant coefficients that occur within subbands, a coherence that must necessarily be substantial due to the sparsity imposed by the noise-shaping process.","PeriodicalId":234035,"journal":{"name":"2007 Data Compression Conference (DCC'07)","volume":"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":"116665154","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
首页 上一页 下一页 尾页
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学术官方微信
小红书