2015 Picture Coding Symposium (PCS)最新文献

筛选
英文 中文
A blind and robust video watermarking scheme in the DT CWT and SVD domain 一种基于DT CWT和SVD域的盲鲁棒视频水印方案
2015 Picture Coding Symposium (PCS) Pub Date : 2015-07-30 DOI: 10.1109/PCS.2015.7170090
Md. Asikuzzaman, M. Alam, M. Pickering
{"title":"A blind and robust video watermarking scheme in the DT CWT and SVD domain","authors":"Md. Asikuzzaman, M. Alam, M. Pickering","doi":"10.1109/PCS.2015.7170090","DOIUrl":"https://doi.org/10.1109/PCS.2015.7170090","url":null,"abstract":"The piracy of a digital movie is a significant problem for movie studios and producers but can be prevented by digital video watermarking. In existing watermarking algorithms, robustness to several attacks on the watermark has been improved. However, none of these existing techniques are robust to a combination of the common geometric distortions of scaling, rotation, cropping and downscaling in resolution with other attacks such as video compression. In this paper, a blind video watermarking algorithm is proposed where the watermark is embedded in the singular values of the dual-tree complex wavelet transform coefficients of the chrominance channel. As distortion in the chrominance channel is less sensitive to the human eye, the original video quality is maintained. The singular value decomposition is used due to the good stability of its singular values while the approximate shift invariance characteristic of the dual-tree complex wavelet transform ensures robustness to geometric attacks. The proposed scheme is robust to upscaling, rotation, cropping, downscaling to an arbitrary resolution, aspect ratio change, noise addition and H.264/AVC compression.","PeriodicalId":210256,"journal":{"name":"2015 Picture Coding Symposium (PCS)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124106414","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}
引用次数: 21
Extended Cross-Component Prediction in HEVC HEVC中的扩展交叉分量预测
2015 Picture Coding Symposium (PCS) Pub Date : 2015-07-30 DOI: 10.1017/ATSIP.2017.3
Tung Nguyen, Ali Khairat, D. Marpe, Mischa Siekmann, T. Wiegand
{"title":"Extended Cross-Component Prediction in HEVC","authors":"Tung Nguyen, Ali Khairat, D. Marpe, Mischa Siekmann, T. Wiegand","doi":"10.1017/ATSIP.2017.3","DOIUrl":"https://doi.org/10.1017/ATSIP.2017.3","url":null,"abstract":"The support for chroma formats other than 4;2;0 and bit depths higher than 10 bit has been included into the High Efficiency Video Coding (HEVC) standard by the publication of Version 2. In contrast to 4;2;2 profiles without additional dedicated coding tools relative to the Main profile, all 4;4;4 profiles specify a novel compression efficiency tool referred to as Cross-Component Prediction (CCP). This paper describes and analyses two additional extensions relative to the specified CCP variant in Version 2. In the first extension, an additional predictor is introduced, particularly, the first chroma component can also serve as the predictor for the second chroma component beside the luma component. The second extension is concerned with the binarization of the single prediction model parameter, which usually has a different distribution for R'G'B' than for Y'CbCr content. Experimental results show that the in this paper presented extensions can improve the compression efficiency by -0.7% on average for R'G'B' content, and by -1.1% for Y'CbCr content, respectively, both in terms of BD rate.","PeriodicalId":210256,"journal":{"name":"2015 Picture Coding Symposium (PCS)","volume":"306 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123208877","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
Spatial induction policies for scalable depth coding 可扩展深度编码的空间归纳策略
2015 Picture Coding Symposium (PCS) Pub Date : 2015-07-30 DOI: 10.1109/PCS.2015.7170044
Mitchell S. Ward, D. Taubman, R. Mathew
{"title":"Spatial induction policies for scalable depth coding","authors":"Mitchell S. Ward, D. Taubman, R. Mathew","doi":"10.1109/PCS.2015.7170044","DOIUrl":"https://doi.org/10.1109/PCS.2015.7170044","url":null,"abstract":"An edge-adaptive depth coding proposed in [1] uses a multi-resolution field of breakpoints to encode edges in a scene's geometry. In order to remain efficient, this scheme uses spatial induction to infer the location of breakpoints from the surrounding geometry where possible. This intelligence means only a subset of the breakpoints need to be encoded. The original proposal employs a simple policy, using linear interpolation between known points to induce breakpoints. Whilst this is effective, a more sophisticated policy could better exploit the available breakpoint data in synthesising edges. This paper presents our findings regarding the potential benefits of higher order spatial induction policies (SIPs).","PeriodicalId":210256,"journal":{"name":"2015 Picture Coding Symposium (PCS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125741921","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
A novel quality assessment of transmitted 3D videos based on binocular rivalry impact 基于双目竞争影响的新型传输3D视频质量评估
2015 Picture Coding Symposium (PCS) Pub Date : 2015-07-30 DOI: 10.1109/PCS.2015.7170094
M. Hasan, J. Arnold, M. Frater
{"title":"A novel quality assessment of transmitted 3D videos based on binocular rivalry impact","authors":"M. Hasan, J. Arnold, M. Frater","doi":"10.1109/PCS.2015.7170094","DOIUrl":"https://doi.org/10.1109/PCS.2015.7170094","url":null,"abstract":"Binocular rivalry, a challenging visual phenomenon occurs frequently for dissimilar monocular stimuli in 3D video communication particularly in error concealment. The quality assessment of distorted 3D video is a crucial element in designing and arranging advanced immersive media distribution platforms. In this paper we propose a quality assessment (QA) criterion that can be measured by considering the correlation of binocular rivalry impact. At first, subjective assessment is done for different frame freezing stereoscopic error concealment techniques and is compared with 2D to approximate the binocular rivalry characteristics. Secondly, a QA approach is proposed based on the perceptual characteristics of the Human Visual System (HVS). Finally, by incorporating the approximation with the perceptual measure, an assessment metric is generated for the transmitted 3D videos. Experimental analysis with common video datasets and comparison with different algorithms shows the efficiency of the proposed algorithm for video that is affected by asymmetric distortion and so is subject to binocular rivalry for stereoscopic views.","PeriodicalId":210256,"journal":{"name":"2015 Picture Coding Symposium (PCS)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134194523","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
Speckle reduction and deblurring of ultrasound images using artificial neural network 基于人工神经网络的超声图像斑点减少与去模糊
2015 Picture Coding Symposium (PCS) Pub Date : 2015-07-30 DOI: 10.1109/PCS.2015.7170056
Muhammad Shahin Uddin, K. K. Halder, M. Tahtali, A. Lambert, M. Pickering
{"title":"Speckle reduction and deblurring of ultrasound images using artificial neural network","authors":"Muhammad Shahin Uddin, K. K. Halder, M. Tahtali, A. Lambert, M. Pickering","doi":"10.1109/PCS.2015.7170056","DOIUrl":"https://doi.org/10.1109/PCS.2015.7170056","url":null,"abstract":"Ultrasound (US) imaging is widely used in clinical diagnostics as it is an economical, portable, painless, comparatively safe, and non-invasive real-time tool. However, the image quality of US imaging is severely affected by the presence of speckle noise during the acquisition process. It is essential to achieve speckle-free high resolution US imaging for better clinical diagnosis. In this paper, we propose a speckle and blur reduction algorithm for US imaging based on artificial neural networks (ANNs). Here, speckle noise is modelled as a multiplicative noise following a Rayleigh distribution, whereas blur is modelled as a Gaussian blur function. The noise and blur variances are estimated by a cascade-forward back propagation (CFBP) neural network using a set of intensity and wavelet features of the US image. The estimated noise and blur variances are then used for speckle reduction by solving the inverse Rayleigh function, and for de-blurring, using the Lucy-Richardson algorithm. The proposed approach gives improved results for both qualitative and quantitative measures.","PeriodicalId":210256,"journal":{"name":"2015 Picture Coding Symposium (PCS)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130819448","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
Fast HEVC coding using reverse CU visiting 快速HEVC编码使用反向CU访问
2015 Picture Coding Symposium (PCS) Pub Date : 2015-07-30 DOI: 10.1109/PCS.2015.7170045
Saverio G. Blasi, Ivan Zupancic, E. Izquierdo, Eduardo Peixoto
{"title":"Fast HEVC coding using reverse CU visiting","authors":"Saverio G. Blasi, Ivan Zupancic, E. Izquierdo, Eduardo Peixoto","doi":"10.1109/PCS.2015.7170045","DOIUrl":"https://doi.org/10.1109/PCS.2015.7170045","url":null,"abstract":"The High Efficiency Video Coding (HEVC) standard makes use of flexible partitioning to achieve high compression ratios. Each frame is divided in Coding Tree Units (CTUs) of fixed size, which are further partitioned into Coding Units (CUs) following a recursive quadtree structure. Typically, CUs at each level of recursion are tested to select the optimal coding configuration, hence this process is extremely demanding in terms of computational complexity. In this paper, a method to reduce complexity of HEVC quadtree configuration selection and mode decision is presented, based on a reverse bottom-to-top visiting order of CUs in the quadtree. By visiting smallest CUs first, information can be extracted to make decisions on larger CUs. The encoder adaptively selects whether a CTU is encoded using the reverse CU visiting, allowing for considerably faster encoding under all conditions. Experimental results show that the algorithm achieves on average 21% speedups over previous state-of-the-art fast HEVC algorithms, and up to 36% for some sequences, at very limited efficiency losses.","PeriodicalId":210256,"journal":{"name":"2015 Picture Coding Symposium (PCS)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115733776","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
Multi-frame optimized quantization for high efficiency video coding 多帧优化量化,实现高效视频编码
2015 Picture Coding Symposium (PCS) Pub Date : 2015-07-30 DOI: 10.1109/PCS.2015.7170067
Martin Winken, Andre Roth, H. Schwarz, T. Wiegand
{"title":"Multi-frame optimized quantization for high efficiency video coding","authors":"Martin Winken, Andre Roth, H. Schwarz, T. Wiegand","doi":"10.1109/PCS.2015.7170067","DOIUrl":"https://doi.org/10.1109/PCS.2015.7170067","url":null,"abstract":"In video coding, the coding decisions made during the encoding of a reference frame impact the achievable rate distortion performance of all inter-predicted frames which refer to it. Most encoders operate frame-by-frame and do not specifically consider this inter-dependency. In this paper, a multi-frame transform coefficient optimization method for H.265/HEVC is proposed. The inter-frame dependencies are described using a linear signal model, such that the optimization problem can be cast in the form of an ℓ1-regularized least squares problem. A simple functional relationship between the regularization parameter and the quantization paramter is empirically found. Bit rate savings are in the range of 7-10% for a simple IPPP... prediction structure and about 3% for a random access configuration.","PeriodicalId":210256,"journal":{"name":"2015 Picture Coding Symposium (PCS)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125798700","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
Adaptive precision motion estimation for HEVC coding HEVC编码的自适应精确运动估计
2015 Picture Coding Symposium (PCS) Pub Date : 2015-07-30 DOI: 10.1109/PCS.2015.7170064
Saverio G. Blasi, Ivan Zupancic, E. Izquierdo, Eduardo Peixoto
{"title":"Adaptive precision motion estimation for HEVC coding","authors":"Saverio G. Blasi, Ivan Zupancic, E. Izquierdo, Eduardo Peixoto","doi":"10.1109/PCS.2015.7170064","DOIUrl":"https://doi.org/10.1109/PCS.2015.7170064","url":null,"abstract":"Most video coding standards, including the state-of-the-art High Efficiency Video Coding (HEVC), make use of sub-pixel Motion Estimation (ME) with Motion Vectors (MV) at fractional precisions to achieve high compression ratios. Unfortunately, sub-pixel ME comes at very high computational costs due to the interpolation step and additional motion searches. In this paper, a fast sub-pixel ME algorithm is proposed. The MV precision is adaptively selected on each block to skip the half or quarter precision steps when not needed. The algorithm bases the decision on local features, such as the behaviour of the residual error samples, and global features, such as the amount of edges in the pictures. Experimental results show that the method reduces total encoding time by up to 17.6% compared to conventional HEVC, at modest efficiency losses.","PeriodicalId":210256,"journal":{"name":"2015 Picture Coding Symposium (PCS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128365057","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}
引用次数: 12
Rate-distortion optimized quantization in HEVC: Performance limitations 率失真优化量化在HEVC:性能限制
2015 Picture Coding Symposium (PCS) Pub Date : 2015-07-30 DOI: 10.1109/PCS.2015.7170052
J. Stankowski, Cezary Korzeniewski, M. Domański, T. Grajek
{"title":"Rate-distortion optimized quantization in HEVC: Performance limitations","authors":"J. Stankowski, Cezary Korzeniewski, M. Domański, T. Grajek","doi":"10.1109/PCS.2015.7170052","DOIUrl":"https://doi.org/10.1109/PCS.2015.7170052","url":null,"abstract":"Rate-Distortion Optimized Quantization (RDOQ) is an encoding optimization technique that may be modified with no implications to the bitstream compliance with the standard. In the paper, we propose an RDOQ variant with exact cost estimation resulting in higher compression ratios as compared to HEVC Test Model. This improvement is obtained at the cost of the complexity increase that may be scaled by replacing the individual steps of exact estimation by the simplified ones from HEVC Test Model. In that way, a family of RDOQ variants is created. The performance of the exact variant from this paper defines a kind of the performance limit for RDOQ.","PeriodicalId":210256,"journal":{"name":"2015 Picture Coding Symposium (PCS)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133042464","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}
引用次数: 18
Optimization of optical flow for scalable coding 面向可扩展编码的光流优化
2015 Picture Coding Symposium (PCS) Pub Date : 2015-07-30 DOI: 10.1109/PCS.2015.7170049
R. Mathew, Sean I. Young, D. Taubman
{"title":"Optimization of optical flow for scalable coding","authors":"R. Mathew, Sean I. Young, D. Taubman","doi":"10.1109/PCS.2015.7170049","DOIUrl":"https://doi.org/10.1109/PCS.2015.7170049","url":null,"abstract":"Optical flow or dense motion field representations provide an alternative to block based schemes and are capable of describing smooth motion flows without introducing any artificial block boundaries. However dense motion fields have not been widely adopted for video coding applications principally due to the prohibitive cost of communicating such detailed motion representations. In this paper our focus is on estimating dense motion fields subject to R-D constraints derived from wavelet based coding of the motion data. We develop a probabilistic framework for estimating dense motion fields that is capable of evaluating the tradeoff between sparsity in the transformed domain and motion compensated distortion. R-D results show that we are able to improve upon traditional optical flow descriptions.","PeriodicalId":210256,"journal":{"name":"2015 Picture Coding Symposium (PCS)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122218293","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
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学术官方微信
小红书