Nabajeet Barman, Steven Schmidt, Saman Zadtootaghaj, M. Martini, S. Möller
{"title":"An Evaluation of Video Quality Assessment Metrics for Passive Gaming Video Streaming","authors":"Nabajeet Barman, Steven Schmidt, Saman Zadtootaghaj, M. Martini, S. Möller","doi":"10.1145/3210424.3210434","DOIUrl":"https://doi.org/10.1145/3210424.3210434","url":null,"abstract":"Video Quality assessment is imperative to estimate and hence manage the Quality of Experience (QoE) in video streaming applications to the end-user. Recent years have seen a tremendous advancement in the field of objective video quality assessment (VQA) metrics, with the development of models that can predict the quality of the videos streamed over the Internet. However, no work so far has attempted to study the performance of such quality assessment metrics on gaming videos, which are artificial and synthetic and have different streaming requirements than traditionally streamed videos. Towards this end, we present in this paper a study of the performance of objective quality assessment metrics for gaming videos considering passive streaming applications. Objective quality assessment considering eight widely used VQA metrics is performed on a dataset of 24 reference videos and 576 compressed sequences obtained by encoding them at 24 different resolution-bitrate pairs. We present an evaluation of the performance behavior of the VQA metrics. Our results indicate that VMAF predicts subjective video quality ratings the best, while NIQE turns out to be a promising alternative as a no-reference metric in some scenarios.","PeriodicalId":395862,"journal":{"name":"Proceedings of the 23rd Packet Video Workshop","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115838430","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}
Simon Da Silva, Joachim Bruneau-Queyreix, M. Lacaud, D. Négru, Laurent Réveillère
{"title":"MUSLIN","authors":"Simon Da Silva, Joachim Bruneau-Queyreix, M. Lacaud, D. Négru, Laurent Réveillère","doi":"10.1145/3210424.3210432","DOIUrl":"https://doi.org/10.1145/3210424.3210432","url":null,"abstract":"Delivering video content with a high and fairly shared quality of experience is a challenging task in view of the drastic video traffic increase forecasts. Currently, content delivery networks provide numerous servers hosting replicas of the video content, and consuming clients are re-directed to the closest server. Then, the video content is streamed using adaptive streaming solutions. However, some servers become overloaded, and clients may experience a poor or unfairly distributed quality of experience. In this paper we propose Muslin, a streaming solution supporting a high, fairly shared end-users quality of experience for live streaming. Muslin leverages on MS-Stream, a content delivery solution in which a client can simultaneously use several servers. Muslin dynamically provisions servers and replicates content into servers, and advertises servers to clients based on real-time delivery conditions. We have used Muslin to replay a one-day video-games event, with hundreds of clients and several test beds. Our results shows that our approach outperforms traditional content delivery schemes by increasing the fairness and quality of experience at the user side without requiring a greater underlying content delivery platform.","PeriodicalId":395862,"journal":{"name":"Proceedings of the 23rd Packet Video Workshop","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114572948","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 Bayesian Bandit Approach to Adaptive Delay-based Congestion Control","authors":"Stefano D'aronco, P. Frossard","doi":"10.1145/3210424.3210430","DOIUrl":"https://doi.org/10.1145/3210424.3210430","url":null,"abstract":"Adapting the transmission rate of video telephony Internet applications in order to guarantee the maximal communication quality is still an open and extremely challenging problem. The congestion control algorithm, which is the algorithm responsible for adjusting the transmission rate according to the network conditions, should typically be able to reach the largest possible rate, in order to achieve a high video quality, at the minimum possible delay, in order to guarantee a good interactivity. At the same time, it should also guarantee a fair share of the network resources when competing with other communication protocols, in particular loss-based congestion protocols. These two objectives actually conflict with each other: whereas, in order to achieve the largest rate with the minimum delay, the delay-based congestion control should be extremely sensitive to delay variations, it should also be ideally immune to delay variations to have perfect coexistence with loss-based protocols. In order to achieve this double objective we propose a learning-based adaptive controller that tunes the delay sensitivity of an underlying delay-based congestion control according to the estimated network conditions. We first define a simple low-dimensional model for the network response. We then formulate a bayesian bandit problem for the selection of the delay sensitivity of the congestion control algorithm. By solving the bandit problem using an optimal learning method we are able to maximize effectively the long term utility provided to the user. Finally, we provide simulation results to demonstrate the operation of the proposed method and its effective ability to adapt to different network scenarios in order to maximize the communication quality.","PeriodicalId":395862,"journal":{"name":"Proceedings of the 23rd Packet Video Workshop","volume":"281 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127506730","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":"Investigation of YouTube regarding Content Provisioning for HTTP Adaptive Streaming","authors":"Armin Trattnig, C. Timmerer, Christopher Müller","doi":"10.1145/3210424.3210431","DOIUrl":"https://doi.org/10.1145/3210424.3210431","url":null,"abstract":"About 300 hours of video are uploaded to YouTube every minute. The main technology to delivery YouTube content to various clients is HTTP adaptive streaming and the majority of today's internet traffic comprises streaming audio and video. In this paper, we investigate content provisioning for HTTP adaptive streaming under predefined aspects representing content features and upload characteristics as well and apply it to YouTube. Additionally, we compare the YouTube's content upload and processing functions with a commercially available video encoding service. The results reveal insights into YouTube's content upload and processing functions and the methodology can be applied to similar services. All experiments conducted within the paper allow for reproducibility thanks to the usage of open source tools, publicly available datasets, and scripts used to conduct the experiments on virtual machines.","PeriodicalId":395862,"journal":{"name":"Proceedings of the 23rd Packet Video Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121075112","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}
R. Mekuria, Christina Kylili, Arjen Wagenaar, Dirk Griffioen
{"title":"Performance Assessment and Improvement of the Video Streaming Backend with Cloud Storage and On-the-Fly Format Conversion","authors":"R. Mekuria, Christina Kylili, Arjen Wagenaar, Dirk Griffioen","doi":"10.1145/3210424.3210433","DOIUrl":"https://doi.org/10.1145/3210424.3210433","url":null,"abstract":"Video Streaming service providers are dealing with increasingly large media asset content repositories. To store these in a flexible and persistent manner, cloud storage is often used. In addition the compute power available in the cloud is often used for on-the-fly format conversion such as dynamic packaging. This way, additional protocols, encryption schemes and formats can be supported from a single storage source. We present a study on the performance of this increasingly common video streaming setup and propose an improvement. We compare the efficiency of different storage formats used in the cloud storage such as fragmented MPEG-4 and MPEG-4 and compare local versus cloud based object storage. In addition we study the resulting traffic between the storage, compute and client nodes. Results show reduced traffic towards the client in the cloud storage based solution. Resulting traffic patterns hint that specific parts of the media assets are most relevant for the conversion at the compute node. Based on this we then introduce an improvement scheme that involves caching metadata files based on dynamically referenced MPEG-4 at the compute node. Experimental results show many benefits such as halving the request time (-50 percent for segment request, -90 percent for manifest requests), reduced number of calls to storage and improved throughput towards the client (+20 percent for fMP4, +100 percent for MP4). In addition, experiments showed player playback startup delay reduced up to 60%. Contrary to the initial setup, both MP4 and fMP4 based storage result in good streaming performance with this scheme, allowing both formats to be used in the storage backend.","PeriodicalId":395862,"journal":{"name":"Proceedings of the 23rd Packet Video Workshop","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127194642","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":"Quickly Starting Media Streams Using QUIC","authors":"Sevket Arisu, A. Begen","doi":"10.1145/3210424.3210426","DOIUrl":"https://doi.org/10.1145/3210424.3210426","url":null,"abstract":"Originally proposed by Google, QUIC is a low-latency transport protocol currently being developed and specified in the IETF. QUIC's low-latency, improved congestion control, multiplexing features are promising and may help improve viewer experience in HTTP adaptive streaming applications. To investigate what issues due to running HTTP over TCP can be alleviated by using HTTP over QUIC, we measured QUIC's streaming performance on wireless and cellular networks. Specifically, we examined QUIC's performance during network interface changes due to viewer's mobility and under unstable network conditions. Results show that QUIC starts media streams more quickly, providing a better streaming and seeking experience, in particular, when there is more congestion in the network, and outperforms TCP when the viewer is mobile and switches between the networks.","PeriodicalId":395862,"journal":{"name":"Proceedings of the 23rd Packet Video Workshop","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125898317","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":"Guided Transcoding Using Deflation and Inflation","authors":"Christopher Hollmann, Rickard Sjöberg","doi":"10.1145/3210424.3210428","DOIUrl":"https://doi.org/10.1145/3210424.3210428","url":null,"abstract":"This paper analyzes and improves an existing guided transcoding scheme called deflation and inflation. By adding three new coding tools, required storage is reduced by 4.2 percentage points on a test set defined by the Moving Picture Experts Group. The first tool predicts coefficient signs, the second tool reorders coefficients using a dynamic scanning order, and the third tool uses new contexts for the binary coder to encode whether coefficients are non-zero or not. All three tools are based on a new method for estimating the likelihood of a coefficient being non-zero. Furthermore, the paper introduces a modified test configuration using a fast transcoder based on the x265 encoder for comparisons. Using this configuration, the three proposed tools provide a storage reduction of 4.4 percentage points with a transcoding complexity of around 5% of a transcoder based on x265.","PeriodicalId":395862,"journal":{"name":"Proceedings of the 23rd Packet Video Workshop","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116159581","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":"Proceedings of the 23rd Packet Video Workshop","authors":"","doi":"10.1145/3210424","DOIUrl":"https://doi.org/10.1145/3210424","url":null,"abstract":"","PeriodicalId":395862,"journal":{"name":"Proceedings of the 23rd Packet Video Workshop","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122934221","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":"Sparse Coding based Frequency Adaptive Loop Filtering for Video Coding","authors":"J. Schneider, Max Bläser, M. Wien","doi":"10.1145/3210424.3210427","DOIUrl":"https://doi.org/10.1145/3210424.3210427","url":null,"abstract":"In-loop filtering is an important task in video coding, as it refines both the reconstructed signal for display and the pictures used for inter-prediction. In order to remove coding artifacts, machine learning based methods are assumed to be beneficial, as they utilize some prior knowledge on the characteristics of raw images. In this contribution, a dictionary learning / sparse coding based inloop filter and a frequency adaptation model based on the lp-ballenergy in the spectral domain is proposed. Thereby the dictionary is trained on raw data and the algorithms are controlled mainly by the parameter for the sparsity. The frequency adaption model results in further improvement of the sparse coding based loop filter. Experimental results show that the proposed method results in coding gains up to l-4.6 % at peak and -1.74 % on average against HEVC in a Random Access coding configuration.","PeriodicalId":395862,"journal":{"name":"Proceedings of the 23rd Packet Video Workshop","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126743200","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}
Y. Reznik, K. Lillevold, Abhijith Jagannath, Justin Greer, Jon Corley
{"title":"Optimal Design of Encoding Profiles for ABR Streaming","authors":"Y. Reznik, K. Lillevold, Abhijith Jagannath, Justin Greer, Jon Corley","doi":"10.1145/3210424.3210436","DOIUrl":"https://doi.org/10.1145/3210424.3210436","url":null,"abstract":"We discuss the problem of optimal design of encoding profiles for adaptive bitrate (ABR) streaming. We formalize this problem and show that it belongs to a class of non-linear constrained optimization problems, with several methods available for solving it numerically. We illustrate the effectiveness of our approach by several examples of optimal encoding ladders constructed for different sources and network models.","PeriodicalId":395862,"journal":{"name":"Proceedings of the 23rd Packet Video Workshop","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126978663","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}