Proceedings DCC 2002. Data Compression Conference最新文献_第3页

Bit allocation in sub-linear time and the multiple-choice knapsack problem 次线性时间内的位分配与多选题背包问题

Proceedings DCC 2002. Data Compression Conference Pub Date : 2002-04-02 DOI: 10.1109/DCC.2002.999973

A. Mohr

引用次数: 21

An analysis of perceptual artifacts in MPEG scalable audio coding MPEG可扩展音频编码中感知伪影的分析

Proceedings DCC 2002. Data Compression Conference Pub Date : 2002-04-02 DOI: 10.1109/DCC.2002.999953

C. Creusere

{"title":"An analysis of perceptual artifacts in MPEG scalable audio coding","authors":"C. Creusere","doi":"10.1109/DCC.2002.999953","DOIUrl":"https://doi.org/10.1109/DCC.2002.999953","url":null,"abstract":"We study coding artifacts in MPEG-compressed scalable audio. Specifically, we consider the MPEG advanced audio coder (AAC) using bit slice scalable arithmetic coding (BSAC) as implemented in the MPEG 4 reference software. First, we perform human subjective testing using the comparison category rating (CCR) approach, quantitatively comparing the performance of scalable BSAC with the nonscalable TwinVQ and AAC algorithms. This testing indicates that scalable BSAC performs very poorly relative to TwinVQ at the lowest bitrate considered (16 kb/s), largely because of an annoying and seemingly random mid-range tonal signal that is superimposed onto the desired output. In order to understand better and quantify perceptually the various forms of distortion introduced into compressed audio at low bit rates, we apply two analysis techniques: Reng probing and time-frequency decomposition. The Reng probing technique is capable of separating the linear time-invariant component of a multirate system from its nonlinear and periodically time-varying components. Using this technique, we conclude that aliasing is probably not the cause of the annoying tonal signal; instead, time-frequency analysis indicates that its cause is most likely suboptimal bit allocation.","PeriodicalId":420897,"journal":{"name":"Proceedings DCC 2002. Data Compression Conference","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132494301","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}

引用次数: 4

Extended Golomb codes for binary Markov sources 二进制马尔可夫源的扩展Golomb代码

Proceedings DCC 2002. Data Compression Conference Pub Date : 2002-04-02 DOI: 10.1109/DCC.2002.999999

E. S. Hong, R. Ladner

引用次数: 0

The Link Database: fast access to graphs of the Web 链接数据库:快速访问Web图形

Proceedings DCC 2002. Data Compression Conference Pub Date : 2002-04-02 DOI: 10.1109/DCC.2002.999950

K. H. Randall, Raymie Stata, J. Wiener, Rajiv Wickremesinghe

{"title":"The Link Database: fast access to graphs of the Web","authors":"K. H. Randall, Raymie Stata, J. Wiener, Rajiv Wickremesinghe","doi":"10.1109/DCC.2002.999950","DOIUrl":"https://doi.org/10.1109/DCC.2002.999950","url":null,"abstract":"The Connectivity Server is a special-purpose database whose schema models the Web as a graph: a set of nodes (URL) connected by directed edges (hyperlinks). The Link Database provides fast access to the hyperlinks. To support easy implementation of a wide range of graph algorithms we have found it important to fit the Link Database into RAM. In the first version of the Link Database, we achieved this fit by using machines with lots of memory (8 GB), and storing each hyperlink in 32 bits. However, this approach was limited to roughly 100 million Web pages. This paper presents techniques to compress the links to accommodate larger graphs. Our techniques combine well-known compression methods with methods that depend on the properties of the Web graph. The first compression technique takes advantage of the fact that most hyperlinks on most Web pages point to other pages on the same host as the page itself. The second technique takes advantage of the fact that many pages on the same host share hyperlinks, that is, they tend to point to a common set of pages. Together, these techniques reduce space requirements to under 6 bits per link. While (de)compression adds latency to the hyperlink access time, we can still compute the strongly connected components of a 6 billion-edge graph in 22 minutes and run applications such as Kleinberg's HITS in real time. This paper describes our techniques for compressing the Link Database, and provides performance numbers for compression ratios and decompression speed.","PeriodicalId":420897,"journal":{"name":"Proceedings DCC 2002. Data Compression Conference","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115153502","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}

引用次数: 146

Turbo source coding: a noise-robust approach to data compression Turbo源编码:一种抗噪声的数据压缩方法

Proceedings DCC 2002. Data Compression Conference Pub Date : 2002-04-02 DOI: 10.1109/DCC.2002.1000008

P. Mitran, J. Bajcsy

引用次数: 50

Computing rate-distortion optimized policies for streaming media to wireless clients 计算无线客户端流媒体的率失真优化策略

Proceedings DCC 2002. Data Compression Conference Pub Date : 2002-04-02 DOI: 10.1109/DCC.2002.999943

Jacob Chakareski, B. Aazhang, P. Chou

引用次数: 50

Compression with side information using turbo codes 使用涡轮码压缩侧信息

Proceedings DCC 2002. Data Compression Conference Pub Date : 2002-04-02 DOI: 10.1109/DCC.2002.999963

A. Aaron, B. Girod

引用次数: 464

Compression of image block means for non-equal block size partition schemes using Delaunay triangulation and prediction 压缩图像块意味着使用Delaunay三角剖分和预测的非等块大小分区方案

Proceedings DCC 2002. Data Compression Conference Pub Date : 2002-04-02 DOI: 10.1109/DCC.2002.1000011

N. Ponomarenko, K. Egiazarian, V. Lukin, J. Astola

引用次数: 1

Diagnostically lossless compression of pipeline inspection data 诊断无损压缩管道检测数据

Proceedings DCC 2002. Data Compression Conference Pub Date : 2002-04-02 DOI: 10.1109/DCC.2002.1000016

W. Tham, Sandra I. Woolley, Sue Cribbs, Don Anderson

{"title":"Diagnostically lossless compression of pipeline inspection data","authors":"W. Tham, Sandra I. Woolley, Sue Cribbs, Don Anderson","doi":"10.1109/DCC.2002.1000016","DOIUrl":"https://doi.org/10.1109/DCC.2002.1000016","url":null,"abstract":"Summary form only given. All pipelines are subject to corrosion and require inspection in accordance with regulatory requirements to ensure human safety. Intelligent pipeline inspection gauges (PIGs) have provided reliable online inspection of pipelines, supplying operators with detailed information about pipeline condition. We present a method for the diagnostically lossless compression of pipeline inspection data and discuss important pipeline features, e.g. welds, cracks and erosion objects. The dataset, transverse field inspection (TFI) data, is a new type of pipeline inspection data in contrast to the traditional magnetic flux leakage (MFL) inspection data. The nature of the data makes feature preservation essential. TFI pipeline features have been collected, classified and analysed and examples are shown. Feature detection is desirable in order to identify regions of diagnostic interest. Incorporation of region-of-interest (ROI) into the SPIHT encoding scheme enables the allocation of a greater proportion of the total allowance of bits to the regions of the image identified as diagnostically significant. Our quality assessment is based on the preservation of important defect parameters to ensure diagnostically lossless performance. We present results comparing performance between ROI SPIHT and non-ROI SPIHT.","PeriodicalId":420897,"journal":{"name":"Proceedings DCC 2002. Data Compression Conference","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132589194","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

Quantizers with uniform encoders and channel optimized decoders 具有统一编码器和信道优化解码器的量化器

Proceedings DCC 2002. Data Compression Conference Pub Date : 2002-04-02 DOI: 10.1109/DCC.2002.999967

B. Farber, K. Zeger

引用次数: 0