{"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}
{"title":"A Flexible Multiple Description Coding Scheme Based on Rateless Codes","authors":"Ozgun Y. Bursalioglu, G. Caire","doi":"10.1109/DCC.2010.32","DOIUrl":"https://doi.org/10.1109/DCC.2010.32","url":null,"abstract":"The multiple description coding of an independent and identically distributed Gaussian source over bit error channels is considered. A novel practical multiple description coding scheme is proposed based on scalar embedded quantizers and rateless codes. A peer-to-peer network model is studied where users can receive different number of descriptions and an arbitrary large number of descriptions can be created and transmitted between peers. For this network model convex system optimization problems are defined and solved. The proposed scheme can be regarded as an efficient implementation of ``channel optimized quantization'', where the index assignment is obtained via a low-complexity linear function. The scheme is shown to be robust to bit errors and to achieve higher reconstruction signal-to-noise ratios when compared to previously reported designs.","PeriodicalId":299459,"journal":{"name":"2010 Data Compression Conference","volume":"1 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":"124362118","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}
{"title":"The Non-existence of Length-5 Perfect Slepian-Wolf Codes of Three Sources","authors":"Samuel Cheng, Rick Ma","doi":"10.1109/DCC.2010.85","DOIUrl":"https://doi.org/10.1109/DCC.2010.85","url":null,"abstract":"We consider Slepian-Wolf (SW) coding of multiple sources and extend the packing bound and the notion of perfect code from conventional channel coding to SW coding with more than two sources. Moreover, we show that there does not exist perfect SW code of length-5 for three sources.","PeriodicalId":299459,"journal":{"name":"2010 Data Compression Conference","volume":"28 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":"116066929","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}
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}
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}
{"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}
{"title":"Robust Detection and Lossless Compression of the Foreground in Magnetic Resonance Images","authors":"Andres Corvetto, Ana M. C. Ruedin, D. Acevedo","doi":"10.1109/DCC.2010.74","DOIUrl":"https://doi.org/10.1109/DCC.2010.74","url":null,"abstract":"We present a collection of techniques for robust detection of the foreground (as opposed to background) in a MR volumetric image. A novel voting strategy makes our compressor more reliable. The image in which the background has been assigned a zero value is then losslessly compressed by another collection of techniques including a novel ordering of blocks to exploit an adaptive arithmetic coder. The image is segmented into few classes. Quantized data (represented by an index map and a codebook) and quantization differences are encoded separately. Correlations between slices are reduced by differential coding of the index map for consecutive slices. Correlations in the 3 dimensions are further reduced by an integer wavelet transform and by class-contextual arithmetic encoding of the quantization differences. Our compressor outperforms JPEG-LS, JPEG2000, SPIHT, and 3D-SPIHT.","PeriodicalId":299459,"journal":{"name":"2010 Data Compression Conference","volume":"5 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":"123916181","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}
{"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}
{"title":"A Novel Frame Error Concealment Algorithm Based on Dynamic Texture Synthesis","authors":"Hao Chen, R. Hu, Dan Mao, Zhongyuan Wang","doi":"10.1109/DCC.2010.83","DOIUrl":"https://doi.org/10.1109/DCC.2010.83","url":null,"abstract":"Dynamic textures are sequences of frames of moving scenes that exhibit certain stationary properties in time, which have great significance in applications such as video production, virtual simulation and virtual walkthroughs. This paper presents an algorithm for dynamic texture extrapolation using for H.264 decoding system. The synthesized frames can be used by the decoder for whole frames loss error concealment. The simulation results show that the proposed whole frames loss error concealment algorithm achieves significant improvement over the motion vector extrapolation method.","PeriodicalId":299459,"journal":{"name":"2010 Data Compression Conference","volume":"192 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":"116891107","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}
{"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}