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

2010 Data Compression Conference最新文献

筛选
英文 中文
Local Modeling for WebGraph Compression WebGraph压缩的局部建模
2010 Data Compression Conference Pub Date : 2010-03-24 DOI: 10.1109/DCC.2010.59
V. Anh, Alistair Moffat
{"title":"Local Modeling for WebGraph Compression","authors":"V. Anh, Alistair Moffat","doi":"10.1109/DCC.2010.59","DOIUrl":"https://doi.org/10.1109/DCC.2010.59","url":null,"abstract":"We describe a simple hierarchical scheme for webgraph compression, which supports efficient in-memory and from-disk decoding of page neighborhoods, for neighborhoods defined for both incoming and outgoing links. The scheme is highly competitive in terms of both compression effectiveness and decoding speed.","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":"129719987","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}
引用次数: 11
On the Adaptive Coefficient Scanning of JPEG XR/HD Photo JPEG XR/HD图像的自适应系数扫描
2010 Data Compression Conference Pub Date : 2010-03-24 DOI: 10.1109/DCC.2010.13
Vanessa Testoni, M. H. M. Costa, D. Kirovski, Henrique S. Malvar
{"title":"On the Adaptive Coefficient Scanning of JPEG XR/HD Photo","authors":"Vanessa Testoni, M. H. M. Costa, D. Kirovski, Henrique S. Malvar","doi":"10.1109/DCC.2010.13","DOIUrl":"https://doi.org/10.1109/DCC.2010.13","url":null,"abstract":"We explore several local and global strategies for adaptive scan ordering of transform coefficients in JPEG XR/HD Photo. This codec applies a global adaptive scan-order heuristic with respect to an effective localized predictor. The global ordering heuristic, although simple, performs as well as localized techniques that are computationally significantly more complex. We conclude that effective localized prediction not only minimizes but also essentially randomizes coefficient residuals, so that a global statistic is sufficient to deliver near-optimal compression performance.","PeriodicalId":299459,"journal":{"name":"2010 Data Compression Conference","volume":"264 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":"134209404","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
Batch-Pipelining for H.264 Decoding on Multicore Systems 多核系统上H.264解码的批处理流水线
2010 Data Compression Conference Pub Date : 2010-03-24 DOI: 10.1109/DCC.2010.57
Tang-Hsun Tu, Chih-wen Hsueh
{"title":"Batch-Pipelining for H.264 Decoding on Multicore Systems","authors":"Tang-Hsun Tu, Chih-wen Hsueh","doi":"10.1109/DCC.2010.57","DOIUrl":"https://doi.org/10.1109/DCC.2010.57","url":null,"abstract":"Pipelining has been applied in many area to improve performance by overlapping executions of computing stages. However, it is difficult to apply on H.264/AVC decoding in frame level, because the bitstreams are encoded with lots of dependencies and little parallelism is left to be explored. Therefore, many researches can only adopt hardware assistance. Fortunately, pure software pipelining can be applied on H.264/AVC decoding in macroblock level with reasonable performance gain. However, the pipeline stages might need to synchronize with other stages and incur lots of extra overhead. Moreover, the overhead becomes relatively larger as the stages themselves are executed faster with better hardware and software optimization. We first group multiple stages into larger groups as ”batched” pipelining to execute concurrently in multicore systems. The stages in different groups might not need to synchronize to each other so that it incurs little overhead and can be highly scalable. Therefore, a novel effective batch-pipeline (BP) approach for H.264/AVC decoding on multicore systems is proposed. Moreover, because of its flexibility, BP can be used with other hardware approaches or software technologies to further improve performance. To optimize our approach, we analyze how to group the macroblocks and derive close-form formulas to guide the grouping. We also conduct various experiments on various bitstreams to verify our approach. The results show that it can speed up to 93% and achieve up to 249 and 70 FPS for 720P and 1080P resolutions, respectively, on a 4-core machine over a published optimized H.264 decoder.We believe our batch-pipelining approach creates a new effective direction for multimedia software codec development.","PeriodicalId":299459,"journal":{"name":"2010 Data Compression Conference","volume":"22 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":"129968441","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
A Lossless Circuit Layout Image Compression Algorithm for Maskless Lithography Systems 一种无掩模光刻系统的无损电路布局图像压缩算法
2010 Data Compression Conference Pub Date : 2010-03-24 DOI: 10.1109/DCC.2010.17
Jeehong Yang, S. Savari
{"title":"A Lossless Circuit Layout Image Compression Algorithm for Maskless Lithography Systems","authors":"Jeehong Yang, S. Savari","doi":"10.1109/DCC.2010.17","DOIUrl":"https://doi.org/10.1109/DCC.2010.17","url":null,"abstract":"We introduce a transform-based technique to represent a circuit layout image so that 1) it typically leads to better compression ratios for maskless lithography systems than Block C4, the state-of-the-art compression scheme for this application, and 2) it permits faster encoding and less complex decoding than Block C4, while 3) it requires a similar amount of memory for decoding.","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":"124283748","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
Smart JPIP Proxy Server with Prefetching Strategies 具有预取策略的智能jip代理服务器
2010 Data Compression Conference Pub Date : 2010-03-24 DOI: 10.1109/DCC.2010.16
J. L. Monteagudo-Pereira, Francesc Aulí Llinàs, J. Serra-Sagristà, Joan Bartrina-Rapesta
{"title":"Smart JPIP Proxy Server with Prefetching Strategies","authors":"J. L. Monteagudo-Pereira, Francesc Aulí Llinàs, J. Serra-Sagristà, Joan Bartrina-Rapesta","doi":"10.1109/DCC.2010.16","DOIUrl":"https://doi.org/10.1109/DCC.2010.16","url":null,"abstract":"Remote browsing of images is receiving much attention lately, mostly in niche applications like geographical information systems or in the telemedicine scenery. Interactive transmission of compressed images has been identified as the most competitive approach, being JPIP, JPEG2000 Interactive Protocol, a key-enabler for these situations. Also, it has been reported that JPIP Proxy Servers help to increase the transmission performance, and that prefetching strategies help to lower responsiveness time. In this paper we contribute a smart JPIP Proxy Server that, thanks to a prefetching strategy undertaken during idle transmission times, largely improves the viewing experience of the final user because of its anticipation of future navigation requests. Experimental results are reported for a remote sensing and a medical environment, respectively performing panning and zoom in, showing enhanced performance in both cases.","PeriodicalId":299459,"journal":{"name":"2010 Data Compression Conference","volume":"68 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":"124461771","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
Spatially Scalable Video Coding Based on Hybrid Epitomic Resizing 基于混合缩影大小调整的空间可伸缩视频编码
2010 Data Compression Conference Pub Date : 2010-03-24 DOI: 10.1109/DCC.2010.20
Qijun Wang, R. Hu, Zhongyuan Wang
{"title":"Spatially Scalable Video Coding Based on Hybrid Epitomic Resizing","authors":"Qijun Wang, R. Hu, Zhongyuan Wang","doi":"10.1109/DCC.2010.20","DOIUrl":"https://doi.org/10.1109/DCC.2010.20","url":null,"abstract":"Scalable video coding (SVC) is considered as a potentially promising solution to enable the adaptability of video to heterogonous networks and various devices. In spatially scalable video encoder, how to resize the captured high-resolution video to get low-resolution video has great effect on the quality of experience (QoE) in the clients receiving low-resolution video. In this paper, we propose a new resizing algorithm called hybrid epitomic resizing (HER), which can make the resized image preserve the same ‘physical’ resolution with original image by the way of utilizing texture similarity inside image and highlight regions of interest while avoiding potential artifacts. For hybrid epitomic resizing, we also design two new inter-layer prediction methods to eliminate the redundancy between adjacent spatial layers instead of conventional inter-layer prediction. Experimental results show that HER can get resized images with perceptually much better quality and the performance of new inter-layer prediction are comparable to that of conventional inter-layer prediction in H.264 SVC.","PeriodicalId":299459,"journal":{"name":"2010 Data Compression Conference","volume":"21 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":"121004615","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
Analysis of LDPC Codes for Compression of Nonuniform Sources with Side Information Using Density Evolution 用密度演化分析LDPC码对带边信息非均匀源的压缩
2010 Data Compression Conference Pub Date : 2010-03-24 DOI: 10.1109/DCC.2010.65
R. K. Bhattar, K. Ramakrishnan, K. Dasgupta
{"title":"Analysis of LDPC Codes for Compression of Nonuniform Sources with Side Information Using Density Evolution","authors":"R. K. Bhattar, K. Ramakrishnan, K. Dasgupta","doi":"10.1109/DCC.2010.65","DOIUrl":"https://doi.org/10.1109/DCC.2010.65","url":null,"abstract":"In this paper, we explore the use of LDPC codes for nonuniform sources under distributed source coding paradigm. Our analysis reveals that several capacity approaching LDPC codes indeed do approach the Slepian-Wolf bound for nonuniform sources as well. The Monte Carlo simulation results show that highly biased sources can be compressed to 0.049 bits/sample away from Slepian-Wolf bound for moderate block lengths.","PeriodicalId":299459,"journal":{"name":"2010 Data Compression Conference","volume":"6 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":"122131390","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
Stationary and Trellis Encoding for IID Sources and Simulation IID源的平稳和栅格编码及其仿真
2010 Data Compression Conference Pub Date : 2010-03-24 DOI: 10.1109/DCC.2010.8
Mark Z. Mao, R. Gray
{"title":"Stationary and Trellis Encoding for IID Sources and Simulation","authors":"Mark Z. Mao, R. Gray","doi":"10.1109/DCC.2010.8","DOIUrl":"https://doi.org/10.1109/DCC.2010.8","url":null,"abstract":"Necessary conditions for asymptotically optimal sliding-block or stationary codes for source coding and rate-constrained simulation are presented and applied to a design technique for trellis-encoded source coding and rate constrained simulation of memoryless sources.","PeriodicalId":299459,"journal":{"name":"2010 Data Compression Conference","volume":"54 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":"122321417","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
Rate Distortion Bounds for Binary Erasure Source Using Sparse Graph Codes 使用稀疏图码的二进制擦除源的率失真界
2010 Data Compression Conference Pub Date : 2010-03-24 DOI: 10.1109/DCC.2010.95
Grégory Demay, V. Rathi, L. Rasmussen
{"title":"Rate Distortion Bounds for Binary Erasure Source Using Sparse Graph Codes","authors":"Grégory Demay, V. Rathi, L. Rasmussen","doi":"10.1109/DCC.2010.95","DOIUrl":"https://doi.org/10.1109/DCC.2010.95","url":null,"abstract":"We consider lower bounds on the rate-distortion performance for the binary erasure source(BES) introduced by Martinian and Yedidia, using sparse graph codes for compression. Ourapproach follows that of Kudekar and Urbanke, where lower bounds on the rate distortionperformance of low-density generator matrix (LDGM) codes for the binary symmetric source(BSS) are derived. They introduced two methods for deriving lower bounds, namely the countingmethod and the test channel method. Based on numerical results they observed that the twomethods lead to the same bound. We generalize these two methods for the BES and prove thatindeed both methods lead to identical rate-distortion bounds for the BES and hence, also forthe BSS.","PeriodicalId":299459,"journal":{"name":"2010 Data Compression Conference","volume":"25 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":"128017580","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
A Fast Compact Prefix Encoding for Pattern Matching in Limited Resources Devices 一种用于有限资源设备模式匹配的快速压缩前缀编码
2010 Data Compression Conference Pub Date : 2010-03-24 DOI: 10.1109/DCC.2010.80
S. Harrusi, A. Averbuch, N. Rabin
{"title":"A Fast Compact Prefix Encoding for Pattern Matching in Limited Resources Devices","authors":"S. Harrusi, A. Averbuch, N. Rabin","doi":"10.1109/DCC.2010.80","DOIUrl":"https://doi.org/10.1109/DCC.2010.80","url":null,"abstract":"A fast compact prefix encoding for pattern matching in limited resources devices","PeriodicalId":299459,"journal":{"name":"2010 Data Compression Conference","volume":"8 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":"116879462","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学术官方微信
小红书