2019 Data Compression Conference (DCC)最新文献

筛选
英文 中文
Adaptive Wavelet Domain Filter for Versatile Video Coding (VVC) 多用途视频编码(VVC)的自适应小波域滤波
2019 Data Compression Conference (DCC) Pub Date : 2019-03-01 DOI: 10.1109/DCC.2019.00015
Suhong Wang, Xianguo Zhang, Shanshe Wang, Siwei Ma, Wen Gao
{"title":"Adaptive Wavelet Domain Filter for Versatile Video Coding (VVC)","authors":"Suhong Wang, Xianguo Zhang, Shanshe Wang, Siwei Ma, Wen Gao","doi":"10.1109/DCC.2019.00015","DOIUrl":"https://doi.org/10.1109/DCC.2019.00015","url":null,"abstract":"Owing to the ability of removing compression artifacts, extensive in-loop filters have been proposed for video coding standards. They are performed after the reconstruction of all coding units (CUs), however, none of them has been taken into account in the mode decision when coding each CU. To address this issue and make the rate-distortion optimization (RDO) more precise for each CU, we introduce a low-pass filter when checking the rate-distortion cost after the reconstruction of each CU. Specifically, based on Haar wavelet, the reconstructed block is transformed to the frequency domain, and then an adaptive wavelet domain filter (AWF) is proposed to suppress the quantization noises in coded blocks. To be adaptive, the filter strength varies from CU to CU according to the texture complexity and quantization parameters (QPs). Experimental results show that the proposed method can reduce the compression artifacts and improve both the objective and subjective quality.","PeriodicalId":167723,"journal":{"name":"2019 Data Compression Conference (DCC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132134955","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
Efficient and Fast Coefficient Sign Inference for Video Coding 高效快速的视频编码系数符号推断
2019 Data Compression Conference (DCC) Pub Date : 2019-03-01 DOI: 10.1109/DCC.2019.00121
Daoyuan Xu, Peiyin Xing, Yaowei Wang, Yonghong Tian
{"title":"Efficient and Fast Coefficient Sign Inference for Video Coding","authors":"Daoyuan Xu, Peiyin Xing, Yaowei Wang, Yonghong Tian","doi":"10.1109/DCC.2019.00121","DOIUrl":"https://doi.org/10.1109/DCC.2019.00121","url":null,"abstract":"In the modern video coding standards, transform coefficient coding takes large portion of output bit-stream. The absolute value of coefficients are usually represented with high-efficiency variable-length code, while the signs are binarized with 1-bit fixed-length code, which ignores the apriority constraints on sign combinations beyond signs. In this paper, we present a fast and efficient sign inference algorithm for improving the coding efficiency of coefficients signs. By considering the correlation of pixels across the transform block boundary, we define a criterion of continuity to constrain the combination space of signs in the block, and shorten the bits will be used. A given number of signs are hidden during bypass coding, and inferred with the high-precision criterion. Then the infer-error is coded with arithmetic coding. Meanwhile a sign bit redefining strategy is introduced, which is based on the invariants of the linear orthogonal separable transform. The strategy ensures that the codec is able to choose up to 4 bits for inferring each block, and avoids the complex decision mechanism introduced by rate distortion optimization. Experiment results show that about 0.6% in average and up to 1.1% BD-rate saving is archived and only less than 1% encoding time complexity increased compared with HEVC baseline.","PeriodicalId":167723,"journal":{"name":"2019 Data Compression Conference (DCC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130720277","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
On the Randomness of Compressed Data 关于压缩数据的随机性
2019 Data Compression Conference (DCC) Pub Date : 2019-03-01 DOI: 10.1109/DCC.2019.00093
S. T. Klein, Dana Shapira
{"title":"On the Randomness of Compressed Data","authors":"S. T. Klein, Dana Shapira","doi":"10.1109/DCC.2019.00093","DOIUrl":"https://doi.org/10.1109/DCC.2019.00093","url":null,"abstract":"It seems reasonable to expect from a good compression method that its output should not be further compressible, because it should behave essentially like random data. We investigate this premise for a variety of known compression techniques, and find that, surprisingly, there is much variability in the randomness, depending on the chosen method. Arithmetic coding seems to produce perfectly random output, whereas that of Huffman or Ziv-Lempel coding still contains many dependencies. In particular, the output of Huffman coding has already been proven to be random under certain conditions, and we show here that arithmetic coding may produce an output that is identical to that of Huffman.","PeriodicalId":167723,"journal":{"name":"2019 Data Compression Conference (DCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130880870","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
Enhanced Context Sensitive Flash Codes 增强的上下文敏感Flash代码
2019 Data Compression Conference (DCC) Pub Date : 2019-03-01 DOI: 10.1109/DCC.2019.00067
Gilad Baruch, S. T. Klein, Dana Shapira
{"title":"Enhanced Context Sensitive Flash Codes","authors":"Gilad Baruch, S. T. Klein, Dana Shapira","doi":"10.1109/DCC.2019.00067","DOIUrl":"https://doi.org/10.1109/DCC.2019.00067","url":null,"abstract":"Rewriting codes for flash memory enable the multiple usage of the same storage space, under the constraint that 0-bits can be changed into 1s, but not vice versa. Context sensitive rewriting codes extend this idea by incorporating also information gathered from surrounding bits. Several new and better context sensitive rewriting codes are presented and analyzed. Empirical simulations show a good match with the theoretical results.","PeriodicalId":167723,"journal":{"name":"2019 Data Compression Conference (DCC)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121063399","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 Hardware-Friendly Extension of Line-Based Intra Prediction for Video Coding 基于行内预测的视频编码硬件友好扩展
2019 Data Compression Conference (DCC) Pub Date : 2019-03-01 DOI: 10.1109/DCC.2019.00078
Santiago De-Luxán-Hernández, A. Wieckowski, H. Schwarz, D. Marpe, T. Wiegand
{"title":"A Hardware-Friendly Extension of Line-Based Intra Prediction for Video Coding","authors":"Santiago De-Luxán-Hernández, A. Wieckowski, H. Schwarz, D. Marpe, T. Wiegand","doi":"10.1109/DCC.2019.00078","DOIUrl":"https://doi.org/10.1109/DCC.2019.00078","url":null,"abstract":"Versatile Video Coding (VVC) is going to be the successor of High Efficiency Video Coding (HEVC). The new standard (currently under development) requires the adoption of tools that provide a good trade-off between gain and implementation complexity. In previous work we proposed a Line-Based Intra Prediction (LIP) algorithm to improve the coding performance of the upcoming standard. However, that contribution did not sufficiently take into account the hardware-related complexity of the method. For this reason, this publication addresses these problems and proposes several modifications of the algorithm to solve them. Experimental results show an average gain of 1.0% and 0.5% for the All Intra (AI) and Random Access (RA) configurations, respectively.","PeriodicalId":167723,"journal":{"name":"2019 Data Compression Conference (DCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121033877","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
Multidimensional Compression with Pattern Matching 基于模式匹配的多维压缩
2019 Data Compression Conference (DCC) Pub Date : 2019-03-01 DOI: 10.1109/DCC.2019.00079
Olivia Del Guercio, Rafael Orozco, A. Sim, John Wu
{"title":"Multidimensional Compression with Pattern Matching","authors":"Olivia Del Guercio, Rafael Orozco, A. Sim, John Wu","doi":"10.1109/DCC.2019.00079","DOIUrl":"https://doi.org/10.1109/DCC.2019.00079","url":null,"abstract":"Sensors typically record their measurements using more precision than the accuracy of the sensing techniques. Thus, experimental and observational data often contains noise that appears random and cannot be easily compressed. This noise increases storage requirement as well as computation time for analyses. In this work, we describe a line of research to develop data reduction techniques that preserve the key features while reduce the storage requirement. Our core observation is that the noise in such cases could be characterized by a small number of patterns based on statistical similarity. In earlier tests, this approach was shown to reduce the storage requirement by over 100-fold for one-dimensional sequences. In this work, we explore a set of different similarity measures for multidimensional sequences. During our tests with standard quality measures such as PSNR, we see that the new compression methods reduce the storage requirements over 100-fold while maintaining relatively low errors in peak signal-to-noise ratio. Thus, we believe that this is a new and effective way of constructing data reduction techniques.","PeriodicalId":167723,"journal":{"name":"2019 Data Compression Conference (DCC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125384397","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
Improved Video Coding Techniques for Next Generation Video Coding Standard 面向下一代视频编码标准的改进视频编码技术
2019 Data Compression Conference (DCC) Pub Date : 2019-03-01 DOI: 10.1109/DCC.2019.00037
Xiaoyu Xiu, Yuwen He, Yan Ye, R. Vanam, Philippe Hanhart, Taoran Lu, Fangjun Pu, P. Yin, Walt Husak, Tao Chen
{"title":"Improved Video Coding Techniques for Next Generation Video Coding Standard","authors":"Xiaoyu Xiu, Yuwen He, Yan Ye, R. Vanam, Philippe Hanhart, Taoran Lu, Fangjun Pu, P. Yin, Walt Husak, Tao Chen","doi":"10.1109/DCC.2019.00037","DOIUrl":"https://doi.org/10.1109/DCC.2019.00037","url":null,"abstract":"This paper describes a video coding scheme submitted in response to the joint call for proposals (CfP) on video compression for capability beyond HEVC issued by ITU-T SG16 Q.6 (VCEG) and ISO/IEC JTC1/SC29/WG11(MPEG) in October 2017. It includes video coding techniques for the standard dynamic range (SDR) and high dynamic range (HDR) categories. Design of the core SDR codec in the response is based on the joint exploration model (JEM) reference software developed by the joint video exploration team (JVET). Some of key coding tools in the JEM are significantly simplified to reduce both average and worst-case complexity for hardware design with negligible coding performance loss. Furthermore, two additional coding technologies, namely multi-type tree (MTT) and decoder-side intra mode derivation (DIMD), are used to further improve coding efficiency. For the HDR category, besides the tools used in SDR category, two additional coding tools: an in-loop reshaper and a luma-based QP prediction method are used to further improve HDR coding efficiency. Simulation results demonstrate the high coding efficiency achieved by the proposed video codec at the expense of moderate coding complexity over HEVC. For random access configuration, it achieves average bit rate savings of 35.7% and 4.00% over the HM and JEM anchors with decoding time of 263% and 33%, respectively, for the SDR sequences. For the HDR sequences, the proposed in-loop reshaper is configured to maximize HDR objective metrics, it achieves average bit rate savings of 31.3% and 4.6% over the HM and JEM for wPSNRY metrics for the HDR PQ content.","PeriodicalId":167723,"journal":{"name":"2019 Data Compression Conference (DCC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129762026","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
Enhanced Compression beyond HEVC for Next Generation Content 增强压缩超越HEVC下一代内容
2019 Data Compression Conference (DCC) Pub Date : 2019-03-01 DOI: 10.1109/DCC.2019.00033
K. Misra, A. Segall, Weijia Zhu, Byeongdoo Choi, F. Bossen, Phil Cowan
{"title":"Enhanced Compression beyond HEVC for Next Generation Content","authors":"K. Misra, A. Segall, Weijia Zhu, Byeongdoo Choi, F. Bossen, Phil Cowan","doi":"10.1109/DCC.2019.00033","DOIUrl":"https://doi.org/10.1109/DCC.2019.00033","url":null,"abstract":"The Joint Video Experts Team recently evaluated technology in response to a Call for Proposals for Video Compression with Capability beyond HEVC. A number of proposed solutions were evaluated, with a sub-set demonstrating the potential to reduce bit-rates by over 40% compared to HEVC. This paper presents the author’s contributions to one of these proposals. The proposal emphasized a flexible, rectangular partitioning structure that was combined with new coding tools, including improved motion vector coding and quantization signaling methods. Results show the efficacy of the approach. Using the evaluation procedure defined in the Call, the described approach provides coding gains relative to an HEVC anchor of 41.2% and 35.7% for 4K-SDR and HD-SDR sequences, respectively, using the random access configuration; 29.0% for HD-SDR sequences using a low delay configuration, and gains of 34.3% and 32.2% for PQ-HDR and HLG-HDR sequences, respectively, using a random access configuration.","PeriodicalId":167723,"journal":{"name":"2019 Data Compression Conference (DCC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123034665","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
Quantized and Regularized Optimization for Coding Images Using Steered Mixtures-of-Experts 使用导向混合专家的图像编码的量化和正则化优化
2019 Data Compression Conference (DCC) Pub Date : 2019-03-01 DOI: 10.1109/DCC.2019.00044
Rolf Jongebloed, Erik Bochinski, Lieven Lange, T. Sikora
{"title":"Quantized and Regularized Optimization for Coding Images Using Steered Mixtures-of-Experts","authors":"Rolf Jongebloed, Erik Bochinski, Lieven Lange, T. Sikora","doi":"10.1109/DCC.2019.00044","DOIUrl":"https://doi.org/10.1109/DCC.2019.00044","url":null,"abstract":"Compression algorithms that employ Mixtures-of-Experts depart drastically from standard hybrid block-based transform domain approaches as in JPEG and MPEG coders. In previous works we introduced the concept of Steered Mixtures-of-Experts (SMoEs) to arrive at sparse representations of signals. SMoEs are gating networks trained in a machine learning approach that allow individual experts to explain and harvest directional long-range correlation in the N-dimensional signal space. Previous results showed excellent potential for compression of images and videos but the reconstruction quality was mainly limited to low and medium image quality. In this paper we provide evidence that SMoEs can compete with JPEG2000 at mid-and high-range bit-rates. To this end we introduce a SMoE approach for compression of color images with specialized gates and steering experts. A novel machine learning approach is introduced that optimizes RD-performance of quantized SMoEs towards SSIM using fake quantization. We drastically improve our previous results and outperform JPEG by up to 42%.","PeriodicalId":167723,"journal":{"name":"2019 Data Compression Conference (DCC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131752276","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
Graph-Based Spatio-Angular Prediction for Quasi-Lossless Compression of Light Fields 基于图的准无损压缩光场空间角预测
2019 Data Compression Conference (DCC) Pub Date : 2019-03-01 DOI: 10.1109/DCC.2019.00046
Mira Rizkallah, Thomas Maugey, C. Guillemot
{"title":"Graph-Based Spatio-Angular Prediction for Quasi-Lossless Compression of Light Fields","authors":"Mira Rizkallah, Thomas Maugey, C. Guillemot","doi":"10.1109/DCC.2019.00046","DOIUrl":"https://doi.org/10.1109/DCC.2019.00046","url":null,"abstract":"Graph-based transforms have been shown to be powerful tools for image compression. However, the computation of the basis functions becomes rapidly untractable when the support increases, i.e. when the dimension of the data is high as in the case of light fields. Local transforms with limited supports have been investigated to cope with this difficulty. Nevertheless, the locality of the support may not allow us to fully exploit long term dependencies in the signal. In this paper, we describe a graph based prediction solution that allows taking advantage of intra prediction mechanisms as well as of the good energy compaction properties of the graph transform. The approach relies on a separable spatio-angular transform and derives low frequency spatio-angular coefficients from one single compressed reference view and from the high angular frequency coefficients. In the tests, we used HEVC-Intra, with QP=0, to encode the reference frame with high quality. The high angular frequency coefficients containing very little energy are coded using a simple entropy coder. The approach is shown to be very efficient in a context of high quality quasi-lossless compression of light fields.","PeriodicalId":167723,"journal":{"name":"2019 Data Compression Conference (DCC)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132157683","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
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学术官方微信