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

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

筛选
英文 中文
Applying Tunstall Coding in the existing SEED format for Seismographic Data 采用现有SEED格式的Tunstall编码处理地震数据
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.14
E. S. Hong, Shu-Fang Newman
{"title":"Applying Tunstall Coding in the existing SEED format for Seismographic Data","authors":"E. S. Hong, Shu-Fang Newman","doi":"10.1109/DCC.2007.14","DOIUrl":"https://doi.org/10.1109/DCC.2007.14","url":null,"abstract":"The Standard for the Exchange of Earthquake Data (SEED) is a commonly used file format for recording seismographic data. The data description language (DDL) is part of the specification of the SEED format; it is used to describe the way in which the data has been encoded in the SEED file. All SEED files contain a piece of DDL code that describes how to read the data contained in the file. In this project, we explore the best possible way of compressing seismographic data losslessly under the constraint that it must be describable in DDL. Since DDL is not a Turing-complete language, it is impossible to implement many standard compression algorithms with it. However, we show it is possible to implement a modified Tunstall code under DDL that produces files that are on average 14% smaller than the traditionally used Steim2 compression technique. We also compare our results with a standard linear predictive coding scheme (which is not implementable in DDL) and show that our technique is on average 18% worse on the same set of files.","PeriodicalId":234035,"journal":{"name":"2007 Data Compression Conference (DCC'07)","volume":"72 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":"127367812","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
Fast Decoding of Fibonacci Encoded Texts 斐波那契编码文本的快速解码
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.38
S. T. Klein
{"title":"Fast Decoding of Fibonacci Encoded Texts","authors":"S. T. Klein","doi":"10.1109/DCC.2007.38","DOIUrl":"https://doi.org/10.1109/DCC.2007.38","url":null,"abstract":"This work deals with ways to accelerate the processing, concentrating on the decoding of Fibonacci encoded texts, by adapting a method originally suggested for the fast decoding of Huffman codes, which suffer from the same problem as the variable length Fibm codes. The method uses a set of partial decoding tables that are prepared in advance and depend only on the code, not on the actual text to be decoded, by means of which the decoding is then performed by blocks of k bits at a time, rather than bit per bit","PeriodicalId":234035,"journal":{"name":"2007 Data Compression Conference (DCC'07)","volume":"2 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":"126861795","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}
引用次数: 10
High-Rate Analysis of Systematic Lossy Error Protection of a Predictively Encoded Source 预测编码源系统有损错误保护的高速率分析
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.45
S. Rane, D. Rebollo-Monedero, B. Girod
{"title":"High-Rate Analysis of Systematic Lossy Error Protection of a Predictively Encoded Source","authors":"S. Rane, D. Rebollo-Monedero, B. Girod","doi":"10.1109/DCC.2007.45","DOIUrl":"https://doi.org/10.1109/DCC.2007.45","url":null,"abstract":"We consider a first-order Markov source, which is predictively encoded using a DPCM-style encoder. The quantized compressed prediction residual is transmitted over an erasure channel. Additionally, a Wyner-Ziv encoded version of the prediction residual is transmitted in order to provide error resilience. When the symbols from the first transmission are erased by the channel, this second description is decoded, and limits the maximum distortion that can occur. Since the quantization step size used in the second description is, in general, larger than that used in the main transmission, error protection is lossy. Using high-rate quantization theory, we derive expressions for the rate and the end-to-end distortion incurred by this system. We show that, compared to conventional lossless forward error correction, this lossy error protection scheme is robust in the sense that it allows the received signal quality to degrade gracefully when the erasure probability increases","PeriodicalId":234035,"journal":{"name":"2007 Data Compression Conference (DCC'07)","volume":"11 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":"115557889","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
Compressed Delta Encoding for LZSS Encoded Files LZSS编码文件的压缩增量编码
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.22
S. T. Klein, Dana Shapira
{"title":"Compressed Delta Encoding for LZSS Encoded Files","authors":"S. T. Klein, Dana Shapira","doi":"10.1109/DCC.2007.22","DOIUrl":"https://doi.org/10.1109/DCC.2007.22","url":null,"abstract":"We explore the full compressed delta encoding problem in compressed texts, defined as the problem of constructing a delta file directly from the two given compressed files, without decompressing. We concentrate on the case where the given files are compressed using LZSS and propose solutions for the special cases involving substitutions only","PeriodicalId":234035,"journal":{"name":"2007 Data Compression Conference (DCC'07)","volume":"7 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":"132478896","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
Edge-Based Prediction for Lossless Compression of Hyperspectral Images 基于边缘的高光谱图像无损压缩预测
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.36
S. Jain, D. Adjeroh
{"title":"Edge-Based Prediction for Lossless Compression of Hyperspectral Images","authors":"S. Jain, D. Adjeroh","doi":"10.1109/DCC.2007.36","DOIUrl":"https://doi.org/10.1109/DCC.2007.36","url":null,"abstract":"We present two algorithms for error prediction in lossless compression of hyperspectral images. The algorithms are context-based and non-linear, and use a one-band look-ahead, thus requiring a minimal storage buffer. The first algorithm (NPHI) predicts the pixel in the current band based on the information from its context. Prediction contexts are defined based on the neighboring causal pixels in the current band and the corresponding co-located causal pixels in the reference band. EPHI extends NPHI using edge-based analysis. Prediction is performed by classifying the pixels into edge and non-edge pixels. Each pixel is then predicted using information from pixels in the same edge class within the context. Empirical results show that the proposed methods produce competitive results when compared with other state-of-the-art algorithms with comparable complexity. On average, the edge-based technique (EPHI) produced the best overall result, over the images in the test dataset","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":"134318794","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}
引用次数: 15
Half-Pel Accurate Motion-Compensated Orthogonal Video Transforms 半像素精确运动补偿正交视频变换
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.43
M. Flierl, B. Girod
{"title":"Half-Pel Accurate Motion-Compensated Orthogonal Video Transforms","authors":"M. Flierl, B. Girod","doi":"10.1109/DCC.2007.43","DOIUrl":"https://doi.org/10.1109/DCC.2007.43","url":null,"abstract":"Motion-compensated lifted wavelets have received much interest for video compression. While they are biorthogonal, they may substantially deviate from orthonormality due to motion compensation, even if based on an orthogonal or near-orthogonal wavelet. A temporal transform for video sequences that maintains orthonormality while permitting flexible motion compensation would be very desirable. We have recently introduced such a transform for integer-pel accurate motion compensation from one previous frame. In this paper, we extend this idea to half-pel accurate motion compensation. Orthonormality is maintained for arbitrary half-pel motion compensation by cascading a sequence of incremental orthogonal transforms. The half-pel intensity values are obtained by averaging neighboring integer-pel positions. Depending on the number of averaged integer-pel values, we use different types of incremental transforms. The cascade of incremental transforms allows us to choose in each step the optimal type of incremental transform and, hence, the optimal half-pel position. Half-pel motion-compensated blocks of arbitrary shape and size can be used as the granularity of the cascade can be as small as one pixel. The new half-pel accurate motion-compensated orthogonal video transform compares favorably with the integer-pel accurate orthogonal transform","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":"130874097","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}
引用次数: 15
An Enhanced Robust Entropy Coder for Video Codecs Based on Context-Adaptive Reversible VLC 基于上下文自适应可逆VLC的增强鲁棒熵编码器
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.13
Qiang Wang, Debin Zhao, Siwei Ma, Wen Gao
{"title":"An Enhanced Robust Entropy Coder for Video Codecs Based on Context-Adaptive Reversible VLC","authors":"Qiang Wang, Debin Zhao, Siwei Ma, Wen Gao","doi":"10.1109/DCC.2007.13","DOIUrl":"https://doi.org/10.1109/DCC.2007.13","url":null,"abstract":"This paper proposes an enhanced RVLC coder, context-adaptive reversible variable length coder (CRVLC), for DCT coefficients by using the techniques of data sub-partitioning and context modeling. The data sub-partitioning means that the data part of DCT coefficients is split into several small sub-partitions. As each sub-partition can be reversibly decoded by RVLC, more data as well as higher error resilience can be obtained. The context modeling exploits the correlation of DCT coefficients for further compression. This modeling defines the contexts by hierarchical-dependent information. The information is also available in the backward decoding, so that it supports the reversible decoding. And with it the data outputted by CRVLC can be naturally placed into multiple sub-partitions.","PeriodicalId":234035,"journal":{"name":"2007 Data Compression Conference (DCC'07)","volume":"60 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":"133013002","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
Comparison of Text Models for BWT BWT文本模型的比较
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.21
J. Lánský, K. Chernik, Z. Vlckova
{"title":"Comparison of Text Models for BWT","authors":"J. Lánský, K. Chernik, Z. Vlckova","doi":"10.1109/DCC.2007.21","DOIUrl":"https://doi.org/10.1109/DCC.2007.21","url":null,"abstract":"Burrows-Wheeler Transform (BWT) is a compression method, which reorders an input string into the the form, which is preferable to another compression. Usually, Move-To-Front transform and then Huffman coding is used to the permutated string. This work is to compare the single file parsing methods used on input text files by means of Burrows-Wheeler Transform for different languages (English, Czech, and German). Since present methods based on BWT use different block sizes and moreover, they are oriented to the compression of one element type - what makes harder the mutual comparison, we modified the method to be able to compress using all required elements and to have the block size 5 MB, which is more than size of any test input file.","PeriodicalId":234035,"journal":{"name":"2007 Data Compression Conference (DCC'07)","volume":"15 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":"124221618","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
An Efficient Implementation of Adaptive Prefix Coding 自适应前缀编码的一种有效实现
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.12
Yakov Nekrich
{"title":"An Efficient Implementation of Adaptive Prefix Coding","authors":"Yakov Nekrich","doi":"10.1109/DCC.2007.12","DOIUrl":"https://doi.org/10.1109/DCC.2007.12","url":null,"abstract":"The goal of the prefix coding is to assign codewords to elements of the input alphabet A, so that no codeword is a prefix of another one, and the total length of the encoded message S is minimized. In the case of static prefix coding, symbol frequencies are known in advance. In the case of adaptive (or dynamic) prefix coding, every symbol Si is encoded before the next symbol Si+1 is read.","PeriodicalId":234035,"journal":{"name":"2007 Data Compression Conference (DCC'07)","volume":"11 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":"124540295","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
Optimal Source-Channel Decoder for Correlated Markov Sources over Additive Markov Channels 加性马尔可夫信道上相关马尔可夫信源的最优信道解码器
2007 Data Compression Conference (DCC'07) Pub Date : 2007-03-27 DOI: 10.1109/DCC.2007.64
M. A. Haleem, K.P. Subbalakshmi
{"title":"Optimal Source-Channel Decoder for Correlated Markov Sources over Additive Markov Channels","authors":"M. A. Haleem, K.P. Subbalakshmi","doi":"10.1109/DCC.2007.64","DOIUrl":"https://doi.org/10.1109/DCC.2007.64","url":null,"abstract":"In this paper we propose an optimal joint source channel decoder (JSCD) for two mutually correlated sources each having memory that can be represented by first order Markov processes, and are transmitted through channels with memory representing slow fading wireless channels. We use the additive Markov channel (AMC) model and multiple access source codes (MASC)","PeriodicalId":234035,"journal":{"name":"2007 Data Compression Conference (DCC'07)","volume":"108 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":"116014479","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
下一页 尾页
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学术官方微信
小红书