Data Compression Conference (DCC'06)最新文献

筛选
英文 中文
Compression of LC/MS proteomic data LC/MS蛋白质组学数据压缩
Data Compression Conference (DCC'06) Pub Date : 2006-06-22 DOI: 10.1109/CBMS.2006.2
A. Miguel, J. F. Keane, Jeffrey R. Whiteaker, Heidi Zhang, A. Paulovich
{"title":"Compression of LC/MS proteomic data","authors":"A. Miguel, J. F. Keane, Jeffrey R. Whiteaker, Heidi Zhang, A. Paulovich","doi":"10.1109/CBMS.2006.2","DOIUrl":"https://doi.org/10.1109/CBMS.2006.2","url":null,"abstract":"Summary form only given. The unrelenting growth of liquid chromatography-mass spectrometry (LC-MS) based proteomic data to gigabytes per sample and terabytes per experiment motivates this investigation into compression methods suited to MS signal sources. Compression is needed to facilitate storage, searching, archiving, retrieval, and communication of proteomic MS data. We demonstrate compression techniques that reduce the average file size by a factor of 25 without any loss of accuracy. We have designed two main methods to code the MS data. The first method predicts the mass-to-charge ratio based on the intensity values and encodes the residual with bzip2. The second algorithm maps the original intensity values onto a universal grid and either directly encodes them with bzip2 or applies an arithmetic coder to the results of run-length coding. The latter method achieves the highest compression ratios","PeriodicalId":109225,"journal":{"name":"Data Compression Conference (DCC'06)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133961856","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
The B-coder: an improved binary arithmetic coder and probability estimator b编码器:一种改进的二进制算术编码器和概率估计器
Data Compression Conference (DCC'06) Pub Date : 2006-03-28 DOI: 10.1109/DCC.2006.76
B. Kelly, D. Brailsford
{"title":"The B-coder: an improved binary arithmetic coder and probability estimator","authors":"B. Kelly, D. Brailsford","doi":"10.1109/DCC.2006.76","DOIUrl":"https://doi.org/10.1109/DCC.2006.76","url":null,"abstract":"Summary form only given. A binary arithmetic coder (BAC) can be used to efficiently encode a stream of more-probable (MPS) and less-probable (LPS) symbols. In this work, we describe two improvements to BAC and combine them to form the B-coder. The first improvement concerns the representation of the LPS probability while the second improvement concerns obtaining the estimate of the LPS probability","PeriodicalId":109225,"journal":{"name":"Data Compression Conference (DCC'06)","volume":"465 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115444486","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
Encoding the /spl lscr//sub p/ ball from limited measurements 从有限的测量中编码/spl lscr//sub p/ ball
Data Compression Conference (DCC'06) Pub Date : 2006-03-28 DOI: 10.1109/DCC.2006.86
E. Candès, J. Romberg
{"title":"Encoding the /spl lscr//sub p/ ball from limited measurements","authors":"E. Candès, J. Romberg","doi":"10.1109/DCC.2006.86","DOIUrl":"https://doi.org/10.1109/DCC.2006.86","url":null,"abstract":"We address the problem of encoding signals which are sparse, i.e. signals that are concentrated on a set of small support. Mathematically, such signals are modeled as elements in the /spl lscr//sub p/ ball for some p < 1. We describe a strategy for encoding elements of the /spl lscr//sub p/ ball which is universal in that 1) the encoding procedure is completely generic, and does not depend on p (the sparsity of the signal), and 2) it achieves near-optimal minimax performance simultaneously for all p < 1. What makes our coding procedure unique is that it requires only a limited number of nonadaptive measurements of the underlying sparse signal; we show that near-optimal performance can be obtained with a number of measurements that is roughly proportional to the number of bits used by the encoder. We end by briefly discussing these results in the context of image compression.","PeriodicalId":109225,"journal":{"name":"Data Compression Conference (DCC'06)","volume":"350 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115676873","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}
引用次数: 25
Compression of multilingual aligned texts 压缩多语言对齐文本
Data Compression Conference (DCC'06) Pub Date : 2006-03-28 DOI: 10.1109/DCC.2006.15
Ehud S. Conley, S. T. Klein
{"title":"Compression of multilingual aligned texts","authors":"Ehud S. Conley, S. T. Klein","doi":"10.1109/DCC.2006.15","DOIUrl":"https://doi.org/10.1109/DCC.2006.15","url":null,"abstract":"Summary form only given. Multilingual text compression depends primarily on the ability to match the corresponding parts of related texts by identifying semantic correspondences across the various sub-texts, a task generally referred to as text alignment. Savings in storage space can be obtained by replacing words and phrases with pointers to their translations, determined by any alignment algorithm. The suggested method was tested on an English-French corpus of the European Union. The French part was compressed using pointers towards the English part. The obtained compression rate (22.0%) is similar to the performances of Bzip and HuffWord and better than that of Gzip. However, Bzip and Gzip's performances degrade when small sub-sections are processed separately, which makes them inappropriate for systems which often decode only small pieces","PeriodicalId":109225,"journal":{"name":"Data Compression Conference (DCC'06)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123282951","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
MST for lossy compression of image sets MST用于图像集的有损压缩
Data Compression Conference (DCC'06) Pub Date : 2006-03-28 DOI: 10.1109/DCC.2006.48
C. Nielsen, Xiaobo Li
{"title":"MST for lossy compression of image sets","authors":"C. Nielsen, Xiaobo Li","doi":"10.1109/DCC.2006.48","DOIUrl":"https://doi.org/10.1109/DCC.2006.48","url":null,"abstract":"Summary form only given. This paper presents an algorithm for organizing and compressing groups of similar images using a minimum spanning tree (MST). Called IsMST, it supports content based image retrieval (CBIR) and facilitates better compression performance that is attained using JPEG2000 on each image individually. Preliminary experimental results show that the gains in compression and accuracy of the data organization of the data sets using IsMST are encouraging","PeriodicalId":109225,"journal":{"name":"Data Compression Conference (DCC'06)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129007857","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}
引用次数: 20
Compressed by the suffix tree 由后缀树压缩
Data Compression Conference (DCC'06) Pub Date : 2006-03-28 DOI: 10.1109/DCC.2006.11
M. Senft
{"title":"Compressed by the suffix tree","authors":"M. Senft","doi":"10.1109/DCC.2006.11","DOIUrl":"https://doi.org/10.1109/DCC.2006.11","url":null,"abstract":"A close inspection of Fiala and Green's implementation of Ziv-Lempel'77 dictionary compression method reveals a surprising inefficiency. The match they are searching for from the root down the suffix tree can be obtained for free from the suffix tree construction algorithm! This observation suggests that the output of this compression method is in a way just a description of the suffix tree construction for the input string. If taken one step further this leads to the idea that there exists a whole family of compression methods replacing the input string with a description of the suffix tree construction for this string. This family contains some (multi-)dictionary methods not dissimilar to those of Bloom or Hoang et.al., as well as some prediction by partial matching variants. We give the general description of this family along with details about some of its members, discuss implementation issues and show some early experimental results. A possible application to other suffix structures like the compact directed acyclic word graph is also outlined.","PeriodicalId":109225,"journal":{"name":"Data Compression Conference (DCC'06)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123636139","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
Noise immunity for 1:N and M:1 nonlinear mappings for source-channel coding 源信道编码中1:N和M:1非线性映射的抗噪性
Data Compression Conference (DCC'06) Pub Date : 2006-03-28 DOI: 10.1109/DCC.2006.53
Pål Anders Floor, T. Ramstad
{"title":"Noise immunity for 1:N and M:1 nonlinear mappings for source-channel coding","authors":"Pål Anders Floor, T. Ramstad","doi":"10.1109/DCC.2006.53","DOIUrl":"https://doi.org/10.1109/DCC.2006.53","url":null,"abstract":"Summary form only given. We compute the noise components in 1:N dimension expanding (error protection) and M:1 dimension reducing (lossy compression) systems for memoryless Gaussian sources transmitted over AWGN channels. A theory for dimension reducing systems was developed wherein the source- and channel coders are combined into one nonlinear operation and the parametric curves are used to map the source onto the channel. For both systems we have two types of distortion. Results show that the 2:1 system works very well and that the 1:2 system is not as close to optimum but the gain compared to a linear system is approximately the same as in the 2:1 case. The solid graphs illustrate the characteristics of the two distortion contributions. The small noise contribution and approximation noise above the optimum point (increasing CSNR), and the threshold- and channel noise below the optimum point","PeriodicalId":109225,"journal":{"name":"Data Compression Conference (DCC'06)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114360886","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
Making the correct mistakes 犯正确的错误
Data Compression Conference (DCC'06) Pub Date : 2006-03-28 DOI: 10.1109/DCC.2006.46
D. Modha, N. Santhanam
{"title":"Making the correct mistakes","authors":"D. Modha, N. Santhanam","doi":"10.1109/DCC.2006.46","DOIUrl":"https://doi.org/10.1109/DCC.2006.46","url":null,"abstract":"We propose a new sequential, adaptive, quadratic-time algorithm for variable-rate lossy compression of memoryless sources at a fixed distortion. The algorithm uses approximate pattern matching and is modeled after the Lempel-Ziv algorithm. As a key new idea, the algorithm uses lower mutual information to carefully select \"good\" codewords. For Bernoulli sources with Hamming distortion, we empirically demonstrate that the algorithm (a) discovers the optimal reproduction type, (b) leads to absence of multiple matches, and (c) seems to approach the rate-distortion coding rate. Based on empirical observations, we formulate two conjectures that could imply that the algorithm is asymptotically optimal for memoryless sources.","PeriodicalId":109225,"journal":{"name":"Data Compression Conference (DCC'06)","volume":"271 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116835829","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 fast algorithm for lossless compression of data tables by reordering 一种基于重排序的数据表无损压缩快速算法
Data Compression Conference (DCC'06) Pub Date : 2006-03-28 DOI: 10.1109/DCC.2006.1
S. Vucetic
{"title":"A fast algorithm for lossless compression of data tables by reordering","authors":"S. Vucetic","doi":"10.1109/DCC.2006.1","DOIUrl":"https://doi.org/10.1109/DCC.2006.1","url":null,"abstract":"Summary form only given. An algorithm for lossless compression of tables with numeric attributes based on row ordering is proposed. Extensive experiments were performed on randomly generated and scientific multidimensional tables with numerical attributes. The results showed that ordering is useful for compression of moderately large to large tables with intrinsic dimensionality below 20 and with attributes represented with low to moderate precision. The benefits of the iterative ordering procedure are the largest on data tables with correlated attributes and heterogeneous attribute types","PeriodicalId":109225,"journal":{"name":"Data Compression Conference (DCC'06)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124013753","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
Non-asymptotic design of finite state universal predictors for individual sequences 单个序列的有限状态全称预测器的非渐近设计
Data Compression Conference (DCC'06) Pub Date : 2006-03-28 DOI: 10.1109/DCC.2006.54
A. Ingber, M. Feder
{"title":"Non-asymptotic design of finite state universal predictors for individual sequences","authors":"A. Ingber, M. Feder","doi":"10.1109/DCC.2006.54","DOIUrl":"https://doi.org/10.1109/DCC.2006.54","url":null,"abstract":"In this work we consider the problem of universal prediction of individual sequences where the universal predictor is a deterministic finite state machine, with a fixed, relatively small, number of states. We examine the case of self-information loss, where the predictions are probability assignments which is equivalent to universal data compression. While previous results in that area are asymptotic only, we examine a class of machine structures and find an optimal method for allocating the probabilities to the machine states which achieves minimal redundancy w.r.t. the constant predictors class. We show analytic bounds for the redundancy of machines from that class, and construct machines with redundancy that is arbitrarily close to these bounds. Finally, we compare our machines to previously proposed machines and show that our machine with 300 states achieves smaller redundancy than the best machine known so far with 6000 states.","PeriodicalId":109225,"journal":{"name":"Data Compression Conference (DCC'06)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126610774","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学术官方微信
小红书