2011 Data Compression Conference最新文献

筛选
英文 中文
Transductive Regression with Local and Global Consistency for Image Super-Resolution 基于局部和全局一致性的图像超分辨率转换回归
2011 Data Compression Conference Pub Date : 2011-03-29 DOI: 10.1109/DCC.2011.24
Xianming Liu, Debin Zhao, Ruiqin Xiong, Siwei Ma, Wen Gao, Huifang Sun
{"title":"Transductive Regression with Local and Global Consistency for Image Super-Resolution","authors":"Xianming Liu, Debin Zhao, Ruiqin Xiong, Siwei Ma, Wen Gao, Huifang Sun","doi":"10.1109/DCC.2011.24","DOIUrl":"https://doi.org/10.1109/DCC.2011.24","url":null,"abstract":"In this paper, we propose a novel image super-resolution algorithm, referred to as interpolation based on transductive regression with local and global consistency (TRLGC). Our algorithm first constructs a set of local interpolation models which can predict the intensity labels of all image samples, and a loss term will be minimized to keep the predicted labels of available low-resolution (LR) samples sufficiently close to the original ones. Then, all of the losses evaluated in local neighborhoods are accumulated together to measure the global consistency on all samples. Furthermore, a graph-Laplacian based manifold regularization term is incorporated to penalize the global smoothness of intensity labels, such smoothing can alleviate the insufficient training of the local models and make them more robust. Finally, we construct a unified objective function to combine together the accumulated loss of the locally linear regression, square error of prediction bias on the available LR samples and the manifold regularization term, which could be solved with a closed-form solution as a convex optimization problem. In this way, a transductive regression algorithm with local and global consistency is developed. Experimental results on benchmark test images demonstrate that the proposed image super-resolution method achieves very competitive performance with the state-of-the-art algorithms.","PeriodicalId":328510,"journal":{"name":"2011 Data Compression Conference","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127160917","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
Conflict in Distributed Hypothesis Testing with Quantized Prior Probabilities 量化先验概率分布假设检验中的冲突
2011 Data Compression Conference Pub Date : 2011-03-29 DOI: 10.1109/DCC.2011.38
Joong Bum Rhim, L. Varshney, Vivek K Goyal
{"title":"Conflict in Distributed Hypothesis Testing with Quantized Prior Probabilities","authors":"Joong Bum Rhim, L. Varshney, Vivek K Goyal","doi":"10.1109/DCC.2011.38","DOIUrl":"https://doi.org/10.1109/DCC.2011.38","url":null,"abstract":"The effect of quantization of prior probabilities in a collection of distributed Bayesian binary hypothesis testing problems over which the priors themselves vary is studied, with focus on conflicting agents. Conflict arises from differences in Bayes costs, even when all agents desire correct decisions and agree on the meaning of correct. In a setting with fusion of local binary decisions by majority rule, Nash equilibrium local decision strategies are found. Assuming that agents follow Nash equilibrium decision strategies, designing quantizers for prior probabilities becomes a strategic form game, we discuss its Nash equilibria. We also propose two different constrained quantizer design games, find Nash equilibrium quantizer designs, and compare performance. The system has deadweight loss: equilibrium decisions are not Pareto optimal.","PeriodicalId":328510,"journal":{"name":"2011 Data Compression Conference","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123410091","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}
引用次数: 16
Distributed Video Coding in Pixel Domain Using Spatial Correlation at the Decoder 基于空间相关解码器的像素域分布式视频编码
2011 Data Compression Conference Pub Date : 2011-03-29 DOI: 10.1109/DCC.2011.67
C. Lahsini, S. Zaibi, R. Pyndiah, A. Bouallègue
{"title":"Distributed Video Coding in Pixel Domain Using Spatial Correlation at the Decoder","authors":"C. Lahsini, S. Zaibi, R. Pyndiah, A. Bouallègue","doi":"10.1109/DCC.2011.67","DOIUrl":"https://doi.org/10.1109/DCC.2011.67","url":null,"abstract":"Distributed coding is a new paradigm for video compression based on Slepian-Wolf (1973) and Wyner-Ziv (1976) theorems. In this paper, we propose a new pixel-domain Distributed Video Coding (DVC) scheme, in which both the temporal and the spatial correlations are exploited only at the decoder. A joint source-channel decoding is implemented to exploit the source statistics. Iterations between the Map channel decoder and the BCJR source decoder are made to improve the global decoder performance. Simulations results show that a gain is obtained, in term of rate, with iterative joint source-channel decoding, compared to the basic decoding.","PeriodicalId":328510,"journal":{"name":"2011 Data Compression Conference","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122335108","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
Set Reordering for Paletted Data 设置调盘数据的重新排序
2011 Data Compression Conference Pub Date : 2011-03-29 DOI: 10.1109/DCC.2011.79
J. Schneider
{"title":"Set Reordering for Paletted Data","authors":"J. Schneider","doi":"10.1109/DCC.2011.79","DOIUrl":"https://doi.org/10.1109/DCC.2011.79","url":null,"abstract":"We present a novel method to recycle bits of paletted data sets. We exploit that the codebook of such data can be reordered without affecting the content. Enumerating all possible permutations of N codebook entries yields an additional O(N log2 N) bits that can be used without storage overhed for the losless encoding of a limited amount of tags, meta-information, or part of the actual data.","PeriodicalId":328510,"journal":{"name":"2011 Data Compression Conference","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122677950","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
Sparse Graph Codes for the Two-Way Relay Network with Correlated Sources 具有相关源的双向中继网络稀疏图码
2011 Data Compression Conference Pub Date : 2011-03-29 DOI: 10.1109/DCC.2011.70
G. Lechner, R. Timo, L. Ong
{"title":"Sparse Graph Codes for the Two-Way Relay Network with Correlated Sources","authors":"G. Lechner, R. Timo, L. Ong","doi":"10.1109/DCC.2011.70","DOIUrl":"https://doi.org/10.1109/DCC.2011.70","url":null,"abstract":"We design sparse graph codes for the two-way relay network with an orthogonal multi-access uplink channel and correlated sources. Recent results on source-channel separation demonstrate the optimality of individual optimisation of source and channel codes. We present a coding scheme based on low-density parity-check codes that performs close to the theoretical limits. Furthermore, we consider the case of non capacity-achieving codes and show the benefits of joint source-channel decoding.","PeriodicalId":328510,"journal":{"name":"2011 Data Compression Conference","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128489963","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
Lie Group Transformation Models for Predictive Video Coding 预测视频编码的李群变换模型
2011 Data Compression Conference Pub Date : 2011-03-29 DOI: 10.1109/DCC.2011.93
Ching Ming Wang, Jascha Narain Sohl-Dickstein, I. Tosic, B. Olshausen
{"title":"Lie Group Transformation Models for Predictive Video Coding","authors":"Ching Ming Wang, Jascha Narain Sohl-Dickstein, I. Tosic, B. Olshausen","doi":"10.1109/DCC.2011.93","DOIUrl":"https://doi.org/10.1109/DCC.2011.93","url":null,"abstract":"We propose a new method for modeling the temporal correlation in videos, based on local transforms realized by Lie group operators. A large class of transforms can be theoretically described by these operators, however, we propose to learn from natural movies a subset of transforms that are statistically relevant for video representation. The proposed transformation modeling is further exploited to remove inter-view redundancy, i.e., as the prediction step of video encoding. Since the Lie group transformation coefficients are continuous, a quantization step is necessary for each transform. Therefore, we derive theoretical bounds on the distortion due to coefficient quantization. The experimental results demonstrate that the new prediction method with learned transforms leads to better rate-distortion performance at higher bit-rates, and competitive performance at lower bit-rates, compared to the standard prediction based on block-based motion estimation.","PeriodicalId":328510,"journal":{"name":"2011 Data Compression Conference","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124221028","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
Adaptive Quantization in DCT Domain for Distributed Video Coding 分布式视频编码的DCT域自适应量化
2011 Data Compression Conference Pub Date : 2011-03-29 DOI: 10.1109/DCC.2011.87
Chun-Ling Yang, Dong-Qin Xiao, L. Po, Wang-Hua Mo
{"title":"Adaptive Quantization in DCT Domain for Distributed Video Coding","authors":"Chun-Ling Yang, Dong-Qin Xiao, L. Po, Wang-Hua Mo","doi":"10.1109/DCC.2011.87","DOIUrl":"https://doi.org/10.1109/DCC.2011.87","url":null,"abstract":"An improved quantization scheme with adaptive quantization levels (AQL) for transform-domain distributed video coding (DVC) is presented in this paper. In the proposed AQL, the quantization level for each DCT band is adaptively determined according to its importance measured by the magnitude of large coefficients. Experimental results demonstrate that the proposed AQL can achieve significant rate-distortion improvement as compared with uniform scalar quantization scheme with fixed quantization levels.","PeriodicalId":328510,"journal":{"name":"2011 Data Compression Conference","volume":"PP 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126401942","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
Robust Learning of 2-D Separable Transforms for Next-Generation Video Coding 面向下一代视频编码的二维可分离变换鲁棒学习
2011 Data Compression Conference Pub Date : 2011-03-29 DOI: 10.1109/DCC.2011.14
O. Sezer, R. Cohen, A. Vetro
{"title":"Robust Learning of 2-D Separable Transforms for Next-Generation Video Coding","authors":"O. Sezer, R. Cohen, A. Vetro","doi":"10.1109/DCC.2011.14","DOIUrl":"https://doi.org/10.1109/DCC.2011.14","url":null,"abstract":"With the simplicity of its application together with compression efficiency, the Discrete Cosine Transform(DCT) plays a vital role in the development of video compression standards. For next-generation video coding, a new set of 2-D separable transforms has emerged as a candidate to replace the DCT. These separable transforms are learned from residuals of each intra prediction mode, hence termed as Mode dependent-directional transforms (MDDT). MDDT uses the Karhunen-Loeve Transform (KLT) to create sets of separable transforms from training data. Since the residuals after intra prediction have some structural similarities, transforms utilizing these correlations improve coding efficiency. However, the KLT is the optimal approach only if the data has a Gaussian distribution without outliers. Due to the nature of the least-square norm, outliers can arbitrarily affect the directions of the KLT components. In this paper, we will address robust learning of separable transforms by enforcing sparsity on the coefficients of the representations. With this new approach, it is possible to improve upon the video coding performance of H.264/AVC by up to 10.2% BD-rate for intra coding. At no additional cost, the proposed techniques can also provide up to 3.9% improvement in BD-rate for intra coding compared to existing MDDT schemes.","PeriodicalId":328510,"journal":{"name":"2011 Data Compression Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117056347","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
The Two-Way Relay Network with Arbitrarily Correlated Sources and an Orthogonal MAC 具有任意相关源和正交MAC的双向中继网络
2011 Data Compression Conference Pub Date : 2011-03-29 DOI: 10.1109/DCC.2011.32
R. Timo, L. Ong, G. Lechner
{"title":"The Two-Way Relay Network with Arbitrarily Correlated Sources and an Orthogonal MAC","authors":"R. Timo, L. Ong, G. Lechner","doi":"10.1109/DCC.2011.32","DOIUrl":"https://doi.org/10.1109/DCC.2011.32","url":null,"abstract":"The problem of loss less joint source-channel coding for the two-way relay network with an orthogonal multiple access channel is studied. Necessary and sufficient conditions for reliable communication are given, and a separation theorem for source and channel coding is proved.","PeriodicalId":328510,"journal":{"name":"2011 Data Compression Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129725752","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
Image Coder Based on Hilbert Scanning of Embedded QuadTrees 基于嵌入式四叉树Hilbert扫描的图像编码器
2011 Data Compression Conference Pub Date : 2011-03-29 DOI: 10.1109/DCC.2011.74
Jesús Jaime Moreno Escobar, X. Otazu
{"title":"Image Coder Based on Hilbert Scanning of Embedded QuadTrees","authors":"Jesús Jaime Moreno Escobar, X. Otazu","doi":"10.1109/DCC.2011.74","DOIUrl":"https://doi.org/10.1109/DCC.2011.74","url":null,"abstract":"In this work we present an effective and computationally simple algorithm for image compression based on Hilbert Scanning of Embedded quadTrees (Hi-SET). It allows to represent an image as an embedded bitstream along a fractal function. Embedding is an important feature of modern image compression algorithms, in this way Salomon in [1, pg. 614] cite that another feature and perhaps a unique one is the fact of achieving the best quality for the number of bits input by the decoder at any point during the decoding. Hi-SET possesses also this latter feature. Furthermore, the coder is based on a quadtree partition strategy, that applied to image transformation structures such as discrete cosine or wavelet transform allows to obtain an energy clustering both in frequency and space. The coding algorithm is composed of three general steps, using just a list of significant pixels.","PeriodicalId":328510,"journal":{"name":"2011 Data Compression Conference","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128916746","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
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学术文献互助群
群 号:481959085
Book学术官方微信